Exercise 1, § 1
Tag 03VK, permanent. Cite it as [Bourbaki, Tag 03VK].
Theory of Sets, IV, 289
Let be the set of signs , , , the letters being of weight , of weight , and of weight . Let be a balanced word in . Such a word will be called an echelon type on .
Let be terms in a theory stronger than the theory of sets. For each echelon type on define a term as follows :
(i) If is a letter , then is the set .
(ii) If is of the form , then is the set
(iii) If is of the form , where and are assemblies antecedent to , then is the set .
Show that, for each echelon type on , is an echelon on the terms , and conversely (proof by induction on the length of the echelon type or of the echelon construction scheme). is called the realization of the echelon type on the terms . More precisely, every echelon on distinct letters can be written in exactly one way in the form , where is an echelon type.
Also show how one may associate with an echelon type on letters, and mappings , a canonical extension of these mappings. Deduce that if two echelon construction schemes , on letters are such that ( being distinct letters), then
Solution
No solution has been written yet.
Cited by
Cites
Nothing.