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

DOI10.2178/JSL/1344862166MaRDI QIDQ2915897zbMATH OpenOpenAlexFDO

Authors Alberto Policriti, Eugenio 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

computable set theorydecision algorithmsprenex formulasatisfiabilitysemi-decision algorithms

Mathematics Subject Classification ID

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

Recommendations

• The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
• Undecidability results for restricted universally quantified formulae of set theory
• Publication:4731166
• Publication:3489978
• Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators

Cites work

• scientific article; zbMATH DE number 1641581 (Why is no real title available?)
• scientific article; zbMATH DE number 965572 (Why is no real title available?)
• Set theory. An introduction to independence proofs. 2nd print
• The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
• The Logically Simplest Form of the Infinity Axiom
• {log}: A language for programming in logic with finite sets

Cited in

(9)

• Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
• Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate
• On the combination of the Bernays-Schönfinkel-Ramsey fragment with simple linear integer arithmetic
• Set-syllogistics meet combinatorics
• The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
• scientific article; zbMATH DE number 4091462 (Why is no real title available?)
• scientific article; zbMATH DE number 23190 (Why is no real title available?)
• A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
• A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers

This page was built for publication: The Bernays-Schönfinkel-Ramsey class for set theory: decidability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915897)