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

DOI10.2178/jsl/1268917490zbMath1201.03007OpenAlexW1994011085MaRDI QIDQ3570158

Alberto Policriti, Eugenio Giovanni Omodeo

Publication date: 24 June 2010

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

Full work available at URL: https://doi.org/10.2178/jsl/1268917490

zbMATH Keywords

satisfiabilitydecision algorithmscomputable set theorysemi-decision algorithms

Mathematics Subject Classification ID

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

Related Items

The Bernays-Schönfinkel-Ramsey class for set theory: decidability ⋮ Set-syllogistics meet combinatorics ⋮ Testable and untestable classes of first-order formulae ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets
• Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
• Expressing infinity without foundation
• Witnessing differences without redundancies
• Decidability of ∀*∀‐Sentences in Membership Theories
• Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case