The subset relation and 2‐stratified sentences in set theory and class theory

Mathematical Logic Quarterly 69 (1):77-91 (2023)
  Copy   BIBTEX

Abstract

Hamkins and Kikuchi (2016, 2017) show that in both set theory and class theory the definable subset ordering of the universe interprets a complete and decidable theory. This paper identifies the minimum subsystem of,, that ensures that the definable subset ordering of the universe interprets a complete theory, and classifies the structures that can be realised as the subset relation in a model of this set theory. Extending and refining Hamkins and Kikuchi's result for class theory, a complete extension,, of the theory of infinite atomic boolean algebras and a minimum subsystem,, of are identified with the property that if is a model of, then is a model of, where M is the underlying set of, is the unary predicate that distinguishes sets from classes and is the definable subset relation. These results are used to show that that decides every 2‐stratified sentence of set theory and decides every 2‐stratified sentence of class theory.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,283

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Stratified languages.A. Pétry - 1992 - Journal of Symbolic Logic 57 (4):1366-1376.
Undecidable semiassociative relation algebras.Roger D. Maddux - 1994 - Journal of Symbolic Logic 59 (2):398-418.
Strawson on Categories.Charles Sayward - 1978 - Journal of Critical Analysis 7 (3):83-88.
Too Good to be “Just True”.Marcus Rossberg - 2013 - Thought: A Journal of Philosophy 2 (1):1-8.
The interpretability logic of peano arithmetic.Alessandro Berarducci - 1990 - Journal of Symbolic Logic 55 (3):1059-1089.
On the V3-Theory of the Factor Lattice by the Major Subset Relation.Eberhard Herrmann - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 224--139.
Time, tense, truth.Katalin Farkas - 2008 - Synthese 160 (2):269 - 284.
Relatively Speaking: The Coherence of Anti-Realist Relativism.James O. Young - 1986 - Canadian Journal of Philosophy 16 (3):503 - 509.

Analytics

Added to PP
2023-05-30

Downloads
3 (#1,715,951)

6 months
1 (#1,478,781)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Current Research on Gödel’s Incompleteness Theorems.Yong Cheng - 2021 - Bulletin of Symbolic Logic 27 (2):113-167.
The ∀ n∃‐Completeness of Zermelo‐Fraenkel Set Theory.Daniel Gogol - 1978 - Mathematical Logic Quarterly 24 (19-24):289-290.
The ∀n∃‐Completeness of Zermelo‐Fraenkel Set Theory.Daniel Gogol - 1978 - Mathematical Logic Quarterly 24 (19‐24):289-290.

Add more references