Publication:3999861
From MaRDI portal
zbMath0755.03024MaRDI QIDQ3999861
Alfredo Ferro, Domenico Cantone, Eugenio Giovanni Omodeo
Publication date: 23 January 1993
choice; decidability; satisfiability problem; quantified formulae; powerset; fragments of set theory; collections of quantifier-free formulas in a relational language; Kelly-Morse theory; unionset
03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
03B25: Decidability of theories and sets of sentences
03E30: Axiomatics of classical set theory and its fragments
Related Items
Witnessing differences without redundancies, 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, Layered map reasoning, Unnamed Item, A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,×, An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆, Why Predicative Sets?, Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*, Goals and benchmarks for automated map reasoning, Constructive negation and constraint logic programming with sets, An automatically verified prototype of the Android permissions system, 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, The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations, A tableau-based decision procedure for a fragment of set theory with iterated membership, Combining sets with cardinals, Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators, A set-theoretic translation method for polymodal logics, Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership, Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate, Set graphs. II. Complexity of set graph recognition and similar problems, Web ontology representation and reasoning via fragments of set theory, Automated reasoning with restricted intensional sets, Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages, 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”., Unnamed Item
