The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations

DOI10.1016/j.entcs.2016.03.006zbMath1345.03020arXiv1506.01476OpenAlexW2962833833WikidataQ113317699 ScholiaQ113317699MaRDI QIDQ737087

Marianna Nicolosi-Asmundo, Domenico Cantone

Publication date: 5 August 2016

Full work available at URL: https://arxiv.org/abs/1506.01476

zbMATH Keywords

satisfiability problemset theoryrestricted quantificationfinite enumerations

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Axiomatics of classical set theory and its fragments (03E30)

Related Items

Unnamed Item, The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations

Cites Work

• The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations
• Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
• Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators
• A set-theoretic translation method for polymodal logics
• Web ontology representation and reasoning via fragments of set theory
• On the Satisfiability Problem for a 4-level Quantified Syllogistic and Some Applications to Modal Logic
• Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(x)={{y}|y εx}
• Set Theory
• Techniques of computable set theory with applications to proof verification
• Computational Logic and Set Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item