On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework

DOI10.4204/eptcs.346.13MaRDI QIDQ6649524

Domenico Cantone, Andrea de Domenico, Pietro Maugeri

Publication date: 6 December 2024

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Axiomatics of classical set theory and its fragments (03E30) Computational aspects of satisfiability (68R07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combining sets with cardinals
• Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator
• The automation of syllogistic. II: Optimization and complexity issues
• Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership
• Frontiers of combining systems. 5th international workshop, FroCos 2005, Vienna, Austria, September 19--21, 2005. Proceedings.
• Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
• Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator
• Simplification by Cooperating Decision Procedures
• Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
• An Introduction to the Technique of Formative Processes in Set Theory
• Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*
• Computational Logic and Set Theory
• Frontiers of Combining Systems

This page was built for publication: On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework