No CrossRef data available.
Article contents
The rise and fall of typed sentences
Published online by Cambridge University Press: 12 March 2014
Abstract
We characterize the 3-stratiflable theorems of NF as a 3-stratifiable extension of NF3: and show that NF is equiconsistent with TT plus raising type axioms for sentences asserting the existence of some predicate over an atomic Boolean algebra.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2000
References
REFERENCES
[1]Boffa, M., A reduction of the theory of types, Set theory and hierarchy theory, Springer Lecture Notes in Mathematics, vol. 619, 1977, pp. 95–100.CrossRefGoogle Scholar
[2]Boffa, M. and Crabbé, M., Les théorèmes 3-stratifiés de NF3, Comptes rendus de l'Academie des Sciences de Paris, série A, vol. 280 (1975), pp. 1657–1658.Google Scholar
[3]Crabbé, M., La prédicativité dans les théories Élémentaires, Logique et Analyse, vol. 35 (1976), pp. 255–266.Google Scholar
[4]Crabbé, M., On the reduction of type theory, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 29 (1983), pp. 235–237.CrossRefGoogle Scholar
[5]Forster, Th., Set theory with a universal set. Exploring an untyped universe, second ed., Oxford Logic Guides, no. 31, Clarendon Press, Oxford, 1995.CrossRefGoogle Scholar
[6]Grishin, V. N., The method of stratification in set theory, Ph. D. thesis, Moscow University, 1972, in Russian.Google Scholar
[7]Oswald, U., Fragmente von “New Foundations” und Typentheorie, Ph. D. thesis, ETH, Zürich, 1976.Google Scholar
[8]Specker, E., Typical ambiguity, Logic, methodology and the philosophy of science (Nagel, E., Suppes, P., and Tarski, A., editors), Stanford University Press, Stanford, 1962, pp. 116–124.Google Scholar