A Note on Recursive Models of Set Theories

Notre Dame Journal of Formal Logic 42 (2):109-115 (2001)
  Copy   BIBTEX

Abstract

We construct two recursive models of fragments of set theory. We also show that the fragments of Kripke-Platek set theory that prove -induction for -formulas have no recursive models but the standard model of the hereditarily finite sets.

Other Versions

No versions found

Analytics

Added to PP
2010-08-24

Downloads
285 (#150,461)

6 months
13 (#892,628)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On Interpretations of Arithmetic and Set Theory.Richard Kaye & Tin Lok Wong - 2007 - Notre Dame Journal of Formal Logic 48 (4):497-510.
Amphi-ZF : axioms for Conway games.Michael Cox & Richard Kaye - 2012 - Archive for Mathematical Logic 51 (3-4):353-371.
Conservativity of transitive closure over weak constructive operational set theory.Andrea Cantini & Laura Crosilla - 2012 - In Ulrich Berger, Hannes Diener, Peter Schuster & Monika Seisenberger, Logic, Construction, Computation. Berlin, Boston: De Gruyter. pp. 91-122.

Add more citations

References found in this work

Bounded existential induction.George Wilmers - 1985 - Journal of Symbolic Logic 50 (1):72-90.
Foundation versus Induction in Kripke-Platek Set Theory.Domenico Zambella - 1998 - Journal of Symbolic Logic 63 (4):1399-1403.

Add more references