The Structure of the Ordinals and the Interpretation of ZF in Double Extension Set Theory

Studia Logica 79 (3):357-372 (2005)
  Copy   BIBTEX

Abstract

Andrzej Kisielewicz has proposed three systems of double extension set theory of which we have shown two to be inconsistent in an earlier paper. Kisielewicz presented an argument that the remaining system interprets ZF, which is defective: it actually shows that the surviving possibly consistent system of double extension set theory interprets ZF with Separation and Comprehension restricted to 0 formulas. We show that this system does interpret ZF, using an analysis of the structure of the ordinals.

Categories

Keywords

Reprint years

DOI

10.1007/s11225-005-3611-x

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

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

Through your library

My notes

Similar books and articles

Paradoxes in double extension set theories.M. Randall Holmes - 2004 - Studia Logica 77 (1):41 - 57.
A Covering Lemma for HOD of K (ℝ).Daniel W. Cunningham - 2010 - Notre Dame Journal of Formal Logic 51 (4):427-442.
Operating on the universe.Narciso Garcia - 1988 - Archive for Mathematical Logic 27 (1):61-68.
Countable partition ordinals.Rene Schipperus - 2010 - Annals of Pure and Applied Logic 161 (10):1195-1215.
Proof theory for theories of ordinals—I: recursively Mahlo ordinals.Toshiyasu Arai - 2003 - Annals of Pure and Applied Logic 122 (1-3):1-85.
Proof theory for theories of ordinals II: Π3-reflection.Toshiyasu Arai - 2004 - Annals of Pure and Applied Logic 129 (1-3):39-92.
Fixed points in Peano arithmetic with ordinals.Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 60 (2):119-132.
Selection over classes of ordinals expanded by monadic predicates.Alexander Rabinovich & Amit Shomrat - 2010 - Annals of Pure and Applied Logic 161 (8):1006-1023.
Register computations on ordinals.Peter Koepke & Ryan Siders - 2008 - Archive for Mathematical Logic 47 (6):529-548.
Blunt and topless end extensions of models of set theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.
Elementary extensions of countable models of set theory.John E. Hutchinson - 1976 - Journal of Symbolic Logic 41 (1):139-145.
Models of set theory with definable ordinals.Ali Enayat - 2005 - Archive for Mathematical Logic 44 (3):363-385.
Δ1-Definability.Sy D. Friedman & Boban Veličković - 1997 - Annals of Pure and Applied Logic 89 (1):93-99.
Trees and Ehrenfeucht–Fraı̈ssé games.Stevo Todorčević & Jouko Väänänen - 1999 - Annals of Pure and Applied Logic 100 (1-3):69-97.
Constructive Versus Ontological Construals of Cantorian Ordinals.Wolfram Hinzen - 2003 - History and Philosophy of Logic 24 (1):45-63.

Analytics

Added to PP
2009-01-28

Downloads
50 (#316,816)

6 months
6 (#509,130)

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

Ackermann's set theory equals ZF.William N. Reinhardt - 1970 - Annals of Mathematical Logic 2 (2):189.
Zur Axiomatik der Mengenlehre.Dana Scott - 1958 - Journal of Symbolic Logic 23 (2):215-216.
A very strong set theory?Andrzej Kisielewicz - 1998 - Studia Logica 61 (2):171-178.

Add more references