Bourbaki

Remark

Tag 077R, permanent. Cite it as [Bourbaki, Tag 077R].

Theory of Sets, chapter I, § 1. Terms and relations

Intuitively, terms are assemblies which represent objects, and relations are assemblies which represent assertions which can be made about these objects. Condition (a) means that the letters represent objects. Condition (b) means that if BB is an assertion, then ¬B\neg B, called the negation of BB, is an assertion (which is read : not BB). Condition (c) means that if BB and CC are assertions, ∨BC\vee BC, which is called the disjunction of BB and CC, is an assertion (which is read : either BB or CC); thus ¬→BC\neg\to BC is an assertion (in words : “either not BB, or CC”, or “BB implies CC”). Condition (d) means that if BB is an assertion and xx a letter, then τx(B)\tau_x(B) is an object. Let us consider the assertion BB as expressing a property of the object XX; then, if there exists an object which has the property in question, τx(B)\tau_x(B) represents a distinguished object which has this property; if not, τx(B)\tau_x(B) represents an object about which nothing can be said. Finally, condition (e) means that if A1,A2,…,AnA_1,A_2,\ldots,A_n are objects, and if ss is a relational (resp. substantific) sign of weight nn, then sA1A2…AnsA_1A_2\ldots A_n is an assertion about the objects A1,…,AnA_1,\ldots,A_n (resp. an object depending on A1,…,AnA_1,\ldots,A_n).

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Nothing.

Transcribed from the printed edition, 2004, Springer. Not translated.