Set-syllogistics meet combinatorics

DOI10.1017/S0960129515000122zbMath1423.03046OpenAlexW2566393547MaRDI QIDQ2971068

Alberto Policriti, Alexandru I. Tomescu, Eugenio Giovanni Omodeo

Publication date: 4 April 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129515000122

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Axiomatics of classical set theory and its fragments (03E30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
• The Bernays-Schönfinkel-Ramsey class for set theory: decidability
• The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
• Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
• 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
• Undecidability results for restricted universally quantified formulae of set theory
• The Logically Simplest Form of the Infinity Axiom
• Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case
• Infinity, in short
• Computational Logic and Set Theory

This page was built for publication: Set-syllogistics meet combinatorics