Bourbaki

Exercise 4, Appendix 0

Tag 03H0, permanent. Cite it as [Bourbaki, Tag 03H0].

Theory of Sets, I, 60

Bourbaki marks this one as harder than the rest.

Let AA be a term or a relation in a theory T\mathscr{T}. Consider the sequence of assemblies defined as follows. First of all, write AA. If AA consists of a single letter, stop there. If not, write next the assembly or assemblies antecedent to AA (if AA begins with a τ\tau, choose one of the antecedent assemblies arbitrarily). Then write the assembly or assemblies antecedent to those of the preceding assemblies which do not consist of a single letter; and so on.

(a) If we reverse the order of this sequence of assemblies, we get a formative construction.

(b) Let BB be a balanced segment of AA such that no sign of BB is linked in AA to a sign outside BB. Show that BB is either a term or a relation (use (a) and Exercise 1).

(c) Replace BB in AA by a term (resp. a relation) if BB is a term (resp. a relation). Show that the assembly thus obtained is a term if AA is a term, a relation if AA is a relation.

Solution

No solution has been written yet.

Cited by

Cites

Transcribed from the printed volume. Not translated.