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

DOI10.2178/jsl/1344862166zbMath1251.03025OpenAlexW4233684349MaRDI QIDQ2915897

Alberto Policriti, Eugenio Giovanni Omodeo

Publication date: 19 September 2012

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1344862166

zbMATH Keywords

satisfiabilitydecision algorithmsprenex formulacomputable set theorysemi-decision algorithms

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Set theory (03E99)

Related Items

Set-syllogistics meet combinatorics ⋮ A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions ⋮ Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates

Cites Work

• Set theory. An introduction to independence proofs. 2nd print
• {log}: A language for programming in logic with finite sets
• The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
• The Logically Simplest Form of the Infinity Axiom
• Unnamed Item
• Unnamed Item