Set-syllogistics meet combinatorics

DOI10.1017/S0960129515000122MaRDI QIDQ2971068zbMATH OpenOpenAlexFDO

Authors Alberto Policriti, Alexandru I. Tomescu, Eugenio 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)

Recommendations

• Eine Verschärfung Eines Satzes von Kostyrko zur Reduktionstheorie mit Einer Anwendung Auf die Spektrale Darstellung von Prädikaten
• Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
• Zum Reduktionstyp ∃^∞∀∃∀ (0, 1) Und Zur Spektralen Darstellung ϱ‐Stelliger Aufzählbarer und Koaufzählbarer Prädikate Durch Ausdrücke Aus ∃^∞∀∃∀ (ϱ, 1)
• The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
• Decidability of ∀*∀‐Sentences in Membership Theories

Cites work

• Computational logic and set theory. Applying formalized logic to analysis. Foreword by Martin Davis
• 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
• scientific article; zbMATH DE number 1641581 (Why is no real title available?)
• scientific article; zbMATH DE number 965572 (Why is no real title available?)
• Infinity, in short
• Matching theory
• Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
• Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case
• Statements of ill-founded infinity in set theory
• The Bernays-Schönfinkel-Ramsey class for set theory: decidability
• The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
• The Logically Simplest Form of the Infinity Axiom
• Undecidability results for restricted universally quantified formulae of set theory

Cited in

(2)

• Infinity, in short
• On consistent subsets of large sets of satisfiable sentences

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

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