Hostname: page-component-669899f699-swprf Total loading time: 0 Render date: 2025-04-29T15:08:23.305Z Has data issue: false hasContentIssue false
  • English
  • Français

CANTORIAN MODELS OF PREDICATIVE $\mathrm {NF}$

Part of: Set theory

Published online by Cambridge University Press:  13 October 2022

PANAGIOTIS ROUVELAS Open the ORCID record for PANAGIOTIS ROUVELAS [Opens in a new window]
PANAGIOTIS ROUVELAS*
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF PATRAS 26504 RIO PATRAS, GREECE
*
E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

Tangled Type Theory was introduced by Randall Holmes in [3] as a new way of approaching the consistency problem for $\mathrm {NF}$. Although the task of finding models for this theory is far from trivial (considering it is equiconsistent with $\mathrm {NF}$), ways of constructing models for certain fragments of it have been discovered. In this article, we present a simpler way of constructing models of predicative Tangled Type Theory and consequently of predicative $\mathrm {NF}$. In these new models of predicative $\mathrm {NF}$, the universe is well-orderable and equinumerous to the set of singletons.

Keywords

set theorySimple Type TheoryTSTTangled Type TheoryNew FoundationsNFpredicative NF

MSC classification

Primary: 03E35: Consistency and independence results 03E70: Nonclassical and second-order set theories
Type
Article
Information
The Journal of Symbolic Logic , Volume 89 , Issue 2 , June 2024 , pp. 637 - 645
Check for updates
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Crabbé, M., On the consistency of an impredicative subsystem of Quine’s $\mathrm{NF}$ , this Journal, vol. 47 (1982), no. 1, pp. 131–136.Google Scholar
Forster, T. E., Set Theory with a Universal Set: Exploring an Untyped Universe, second ed., Oxford Logic Guides, vol. 31, The Clarendon Press and Oxford University Press, New York, 1995, Oxford Science Publications.CrossRefGoogle Scholar
Randall Holmes, M., The equivalence of $\mathrm{NF}$ -style set theories with “tangled” type theories: The construction of $\omega$ -models of predicative $\mathrm{NF}$ (and more), this Journal, vol. 60 (1995), no. 1, pp. 178–190.Google Scholar
Randall Holmes, M., Subsystems of Quine’s “new foundations” with predicativity restrictions . Notre Dame Journal of Formal Logic, vol. 40 (1999), no. 2, pp. 183–196.Google Scholar
Randall Holmes, M., NF is consistent, preprint, 2022, arXiv:1503.01406.Google Scholar
Specker, E., The axiom of choice in Quine’s new foundations for mathematical logic . Proceedings of the National Academy of Sciences of the United States of America, vol. 39 (1953), pp. 972–975.CrossRefGoogle Scholar
Specker, E., Typical ambiguity , Logic, Methodology and Philosophy of Science (Proceedings of the 1960 International Congress) (E. Nagel, P. Suppes and A. Tarski, editors), Stanford University Press, Stanford, 1962, pp. 116–124.Google Scholar