The Bernays—Schönfinkel—Ramsey class for set theory: decidability

Journal of Symbolic Logic 77 (3):896-918 (2012)
  Copy   BIBTEX

Abstract

As proved recently, the satisfaction problem for all prenex formulae in the set-theoretic Bernays-Shönfinkel-Ramsey class is semi-decidable over von Neumann's cumulative hierarchy. Here that semi-decidability result is strengthened into a decidability result for the same collection of formulae

Links

PhilArchive



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

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

ZF + "every set is the same size as a wellfounded set".Thomas Forster - 2003 - Journal of Symbolic Logic 68 (1):1-4.
Bernays and set theory.Akihiro Kanamori - 2009 - Bulletin of Symbolic Logic 15 (1):43-69.
E pluribus unum: Plural logic and set theory.John P. Burgess - 2004 - Philosophia Mathematica 12 (3):193-221.
What is Squiggle? Ramsey on Wittgenstein's Theory of Judgement.Peter M. Sullivan - 2005 - In Hallvard Lillehammer & D. H. Mellor (eds.), Ramsey's Legacy. Oxford University Press.

Analytics

Added to PP
2012-11-06

Downloads
17 (#875,159)

6 months
10 (#280,381)

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

Add more references