Dzierzgowski, D.
A sentence of the usual language of set theory is said to be stratified if it is obtained by ''erasing'' type indices in a sentence of the language of Russell's Simple Theory of Types. In this paper we give an alternative presentation of a proof the ambiguity theorem stating that any provable stratified sentence has a stratified proof. To this end, we introduce a new set of ambiguity axioms, inspired by Fraisse's characterization of elementary equivalence; these axioms can be naturally used to give different proofs of the ambiguity theorem (semantic or syntactic, classical or intuitionistic).
- Boffa, Teoria, 4, 3 (1984)
- Elements de mathématique. Théorie des ensembles. Hermann, Paris, 1970.
- and , Model Theory (3rd edition). North-Holland Publ. Comp., Amsterdam, 1990.
- Crabbé, Fundamenta Mathematicae, 101, 11 (1978)
- Dzierzgowski, Archive Math. Logic, 31, 171 (1992)
- , and , Mathematical Logic. Springer-Verlag, Berlin-Heidelberg-New York, 1984.
- , and , Foundations of Set Theory. North-Holland Publ. Comp., Amsterdam 1973.
- Typical ambiguity. In: Logic, Methodology and Philosophy of Science (, and , eds.), Proceedings of the International Congress, Stanford, California, 1960. Stanford University Press, Stanford, 1962, pp. 116–124.
Bibliographic reference |
Dzierzgowski, D.. Typical Ambiguity and Elementary Equivalence. In: Mathematical Logic Quarterly, Vol. 39, no. 4, p. 436-446 (1993) |
Permanent URL |
http://hdl.handle.net/2078.1/48789 |