Abstract
The representation of quantification over relations in monadic third-order logic is discussed; it is shown to be possible in numerous special cases of foundational interest, but not in general unless something akin to the Axiom of Choice is assumed.
Similar content being viewed by others
REFERENCES
Boffa, M. (1984): Arithmetic and the theory of types, Journal of Symbolic Logic 49: 621–624.
Burgess, J. P., Hazen, A. P. and Lewis D. (1991): Appendix on pairing. In Lewis David (ed.), Parts of Classes. Basil Blackwell, Oxford, pp. 121–149.
Church A. (1956): Introduction to Mathematical Logic. Princeton University Press, Princeton.
Hazen A. P. (1993): Against pluralism, Australasian Journal of Philosophy 71: 132–145.
Hintikka, K. J. J. (1955): Reductions in the theory of types. In Hintikka, K. J. J. (ed.), Two Papers in Symbolic Logic. Acta Philosophica Fennica, fasc. VI, Helsinki, pp. 61–115.
Lewis D. (1993): Mathematics is megethology, Philosophia Mathematica, series III 1: 1–23.
Pabion, J. F. (1980): TT3I est équivalent à l'arithmétique du scond ordre, Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences de Paris. Série A 290: 1117–1118.
Quine, W. V. (1963): Set Theory and its Logic.Belknap Press, Cambridge.
Rabin, M. O. (1965): A simple method for undecidability proofs and some applications. In Bar-Hillel, Y. (ed.), Logic, Methodology, and Philosophy of Science: proceedings of the 1964 international conference. North-Holland, Amsterdam, pp. 58–68.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hazen, A.P. Relations in Monadic Third-Order Logic. Journal of Philosophical Logic 26, 619–628 (1997). https://doi.org/10.1023/A:1004247419201
Issue Date:
DOI: https://doi.org/10.1023/A:1004247419201