scientific article; zbMATH DE number 1641581

zbMATH Open0981.03056MaRDI QIDQ2740887FDOQ2740887

Domenico Cantone, Eugenio Omodeo, Alberto Policriti

Publication date: 5 September 2001

Title of this publication is not available (Why is that?)

zbMATH Keywords

computational set theory

Mathematics Subject Classification ID

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

Cited In (42)

• Solving quantifier-free first-order constraints over finite sets and binary relations
• Set graphs. IV. Further connections with claw-freeness
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case
• A Logical Framework for Developing and Mechanizing Set Theories
• Three-variable statements of set-pairing
• A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,×
• An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆
• Reasoning on relations, modalities, and sets
• Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*
• Banishing Ultrafilters from Our Consciousness
• 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”.
• Title not available (Why is that?)
• Applicable Mathematics in a Minimal Computational Theory of Sets
• The converse of a stochastic relation
• Title not available (Why is that?)
• A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT
• Title not available (Why is that?)
• Title not available (Why is that?)
• An efficient algorithm for computing bisimulation equivalence
• Set-syllogistics meet combinatorics
• 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
• Deciding Boolean algebra with Presburger arithmetic
• Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators
• The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations
• Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory
• On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework
• A Framework for Formalizing Set Theories Based on the Use of Static Set Terms
• Layered map reasoning
• A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers
• The Bernays-Schönfinkel-Ramsey class for set theory: decidability
• The set player system for symbolic computation on power sets
• STMM: A set theory for mechanized mathematics
• ER modelling from first relational principles
• Changing a Semantics: Opportunism or Courage?
• A tableau-based decision procedure for a fragment of set theory with iterated membership
• Combining sets with cardinals
• Why Predicative Sets?

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Decision procedures for elementary sublanguages of set theory: XII. Multilevel syllogistic extended with singleton and choice operators 👍 👎
• A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets 👍 👎

This page was built for publication:

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