scientific article; zbMATH DE number 1641581
From MaRDI portal
Publication:2740887
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)
Recommendations
Cited in
(54)- An introduction to the technique of formative processes in set theory
- Why Predicative Sets?
- A logical framework for developing and mechanizing set theories
- scientific article; zbMATH DE number 4081506 (Why is no real title available?)
- Solving quantifier-free first-order constraints over finite sets and binary relations
- Banishing ultrafilters from our consciousness
- Set graphs. IV. Further connections with claw-freeness
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership
- On sets and graphs. Perspectives on logic and combinatorics
- scientific article; zbMATH DE number 1953886 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 7533333 (Why is no real title available?)
- 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
- An efficient algorithm for computing bisimulation equivalence
- Reasoning with finite sets and cardinality constraints in SMT
- scientific article; zbMATH DE number 4183384 (Why is no real title available?)
- scientific article; zbMATH DE number 50150 (Why is no real title available?)
- scientific article; zbMATH DE number 1765710 (Why is no real title available?)
- scientific article; zbMATH DE number 839566 (Why is no real title available?)
- scientific article; zbMATH DE number 517057 (Why is no real title available?)
- Set-syllogistics meet combinatorics
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
- Deciding Boolean algebra with Presburger arithmetic
- An automatically verified prototype of the Android permissions system
- The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations
- Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators
- 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
- ER modelling from first relational principles
- Applicable mathematics in a minimal computational theory of sets
- STMM: A set theory for mechanized mathematics
- A tableau-based decision procedure for a fragment of set theory with iterated membership
- Combining sets with cardinals
- Changing a Semantics: Opportunism or Courage?
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)
