scientific article

Domenico Cantone, Alberto Policriti, Eugenio Giovanni Omodeo

Publication date: 5 September 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Logic in artificial intelligence (68T27) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Applications of set theory (03E75) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Related Items (38)

An efficient algorithm for computing bisimulation equivalence ⋮ ER modelling from first relational principles ⋮ Three-variable statements of set-pairing ⋮ Why Predicative Sets? ⋮ Changing a Semantics: Opportunism or Courage? ⋮ Unnamed Item ⋮ The Bernays-Schönfinkel-Ramsey class for set theory: decidability ⋮ Deciding Boolean algebra with Presburger arithmetic ⋮ 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 graphs. IV. Further connections with claw-freeness ⋮ An automatically verified prototype of the Android permissions system ⋮ Set-syllogistics meet combinatorics ⋮ 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 ⋮ Banishing Ultrafilters from Our Consciousness ⋮ Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* ⋮ Applicable Mathematics in a Minimal Computational Theory of Sets ⋮ Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate ⋮ Layered map reasoning ⋮ The converse of a stochastic relation ⋮ A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory ⋮ A Framework for Formalizing Set Theories Based on the Use of Static Set Terms ⋮ The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations ⋮ Reasoning on relations, modalities, and sets ⋮ On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework ⋮ A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers ⋮ Solving quantifier-free first-order constraints over finite sets and binary relations ⋮ A Logical Framework for Developing and Mechanizing Set Theories ⋮ A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT ⋮ 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: