scientific article; zbMATH DE number 1641581
From MaRDI portal
Publication:2740887
zbMATH Open0981.03056MaRDI QIDQ2740887FDOQ2740887
Authors: Domenico Cantone, Alberto Policriti, Eugenio Omodeo 
Publication date: 5 September 2001
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 50150
- Decision procedures for elementary sublanguages of set theory: XII. Multilevel syllogistic extended with singleton and choice operators
- Publication:4864265
- Publication:5749278
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets
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 (54)
- Title not available (Why is that?)
- A logical framework for developing and mechanizing set theories
- Banishing ultrafilters from our consciousness
- Solving quantifier-free first-order constraints over finite sets and binary relations
- Set graphs. IV. Further connections with claw-freeness
- On sets and graphs. Perspectives on logic and combinatorics
- 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
- Layered map reasoning: an experimental approach put to trial on sets
- Computer proofs about finite and regular sets: The unifying concept of subvariance.
- A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case
- Three-variable statements of set-pairing
- A Set-theoretic Approach to Reasoning Services for the Description Logic đ â D 4,Ă
- Reasoning on relations, modalities, and sets
- Computational logic and set theory. Applying formalized logic to analysis. Foreword by Martin Davis
- The converse of a stochastic relation
- A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions
- Title not available (Why is that?)
- A decision procedure for restricted intensional sets
- Applications of formative process to the decision problem in set theory
- A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT
- Title not available (Why is that?)
- Reasoning with finite sets and cardinality constraints in SMT
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Complexity assessments for decidable fragments of set theory. I: A taxonomy for the Boolean case
- An improved set-based reasoner for the description logic \(\mathcal{DL}_\mathrm{D}^{4,\times\dagger}\)
- A Framework for Formalizing Set Theories Based on the Use of Static Set Terms
- The satisfiability problem for Boolean set theory with a choice correspondence
- A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers
- An Automation-Friendly Set Theory for the B Method
- The Bernays-Schönfinkel-Ramsey class for set theory: decidability
- The set player system for symbolic computation on power sets
- Set-theoretic models of computations
- STMM: A set theory for mechanized mathematics
- Applicable mathematics in a minimal computational theory of sets
- 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
- An introduction to the technique of formative processes in set theory
- Why Predicative 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)
