scientific article
From MaRDI portal
Publication:3999861
zbMath0755.03024MaRDI QIDQ3999861
Alfredo Ferro, Domenico Cantone, Eugenio Giovanni Omodeo
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
choicedecidabilitysatisfiability problemquantified formulaepowersetfragments of set theorycollections of quantifier-free formulas in a relational languageKelly-Morse theoryunionset
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) Axiomatics of classical set theory and its fragments (03E30)
Related Items (27)
Web ontology representation and reasoning via fragments of set theory ⋮ Why Predicative Sets? ⋮ A set-theoretic translation method for polymodal logics ⋮ 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”. ⋮ Automated reasoning with restricted intensional sets ⋮ An automatically verified prototype of the Android permissions system ⋮ Witnessing differences without redundancies ⋮ Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages ⋮ A fast saturation strategy for set-theoretic tableaux ⋮ Unnamed Item ⋮ Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership ⋮ A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions ⋮ Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini ⋮ Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* ⋮ 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 ⋮ Goals and benchmarks for automated map reasoning ⋮ Layered map reasoning ⋮ A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case ⋮ Constructive negation and constraint logic programming with sets ⋮ Unnamed Item ⋮ The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations ⋮ A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,× ⋮ An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆ ⋮ Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators ⋮ A tableau-based decision procedure for a fragment of set theory with iterated membership ⋮ Combining sets with cardinals
This page was built for publication:
