Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
From MaRDI portal
Publication:3900014
DOI10.1002/cpa.3160330503zbMath0453.03009WikidataQ56061184 ScholiaQ56061184MaRDI QIDQ3900014
Alfredo Ferro, Jacob T. Schwartz, Eugenio Giovanni Omodeo
Publication date: 1980
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cpa.3160330503
Related Items
Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini, A fast saturation strategy for set-theoretic tableaux, Unnamed Item, Goals and benchmarks for automated map reasoning, A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions, A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case, Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator, A tableau-based decision procedure for a fragment of set theory with iterated membership, 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. I: Syllogistic normal forms, First steps towards exact algebraic identification, A system of relational syllogistic incorporating full Boolean reasoning, Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets, A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions1 1This research has been partially supported by MURST Grant prot. 2001017741 under project “Ragionamento su aggregati e numeri a supporto della programmazione e relative verifiche”., Set-syllogistics meet combinatorics
