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

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1344862166

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,865

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

The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability.Eugenio Omodeo & Alberto Policriti - 2010 - Journal of Symbolic Logic 75 (2):459-480.
The decision problem for restricted universal quantification in set theory and the axiom of foundation.Franco Parlamento & Alberto Policriti - 1992 - Mathematical Logic Quarterly 38 (1):143-156.
Decidability of ∀*∀‐Sentences in Membership Theories.Eugenio G. Omodeo, Franco Parlamento & Alberto Policriti - 1996 - Mathematical Logic Quarterly 42 (1):41-58.
ZF + "every set is the same size as a wellfounded set".Thomas Forster - 2003 - Journal of Symbolic Logic 68 (1):1-4.
An elementary system as and its semi‐completeness and decidability.Qin Jun - 1992 - Mathematical Logic Quarterly 38 (1):305-320.
Decidability and undecidability of theories with a predicate for the primes.P. T. Bateman, C. G. Jockusch & A. R. Woods - 1993 - Journal of Symbolic Logic 58 (2):672-687.
A probabilistic temporal epistemic logic: Decidability.Zoran Ognjanović, Angelina Ilić Stepić & Aleksandar Perović - 2024 - Logic Journal of the IGPL 32 (5):827-879.
Review: Laszlo Kalmar, Reduction of the Decision Problem to the Satisfiability Question of Logical Formulae on a Finite Set. [REVIEW]Rózsa Péter - 1955 - Journal of Symbolic Logic 20 (1):72-72.
Reduction Techniques for Proving Decidability in Logics and Their Meet–Combination.João Rasga, Cristina Sernadas & Walter Carnielli - 2021 - Bulletin of Symbolic Logic 27 (1):39-66.

Analytics

Added to PP
2012-11-06

Downloads
30 (#748,172)

6 months
12 (#290,681)

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

No references found.

Add more references