scientific article; zbMATH DE number 1641581
From MaRDI portal
Publication:2740887
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Applications of set theory (03E75) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx) Logic in artificial intelligence (68T27)
Recommendations
Cited in
(58)- The set player system for symbolic computation on power sets
- A derived algorithm for evaluating -expressions over abstract sets
- Computer proofs about finite and regular sets: The unifying concept of subvariance.
- The converse of a stochastic relation
- Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators
- An efficient algorithm for computing bisimulation equivalence
- ER modelling from first relational principles
- Three-variable statements of set-pairing
- 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
- Solving quantifier-free first-order constraints over finite sets and binary relations
- A decision procedure for restricted intensional sets
- Automated reasoning with restricted intensional sets
- A logical framework for developing and mechanizing set theories
- A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT
- Set-theoretic models of computations
- The Bernays-Schönfinkel-Ramsey class for set theory: decidability
- Set-syllogistics meet combinatorics
- Banishing ultrafilters from our consciousness
- The satisfiability problem for Boolean set theory with a choice correspondence
- Changing a Semantics: Opportunism or Courage?
- Applications of formative process to the decision problem in set theory
- scientific article; zbMATH DE number 4081506 (Why is no real title available?)
- scientific article; zbMATH DE number 50150 (Why is no real title available?)
- Set graphs. IV. Further connections with claw-freeness
- scientific article; zbMATH DE number 517057 (Why is no real title available?)
- scientific article; zbMATH DE number 1953886 (Why is no real title available?)
- scientific article; zbMATH DE number 1765710 (Why is no real title available?)
- Applicable mathematics in a minimal computational theory of sets
- Reasoning with finite sets and cardinality constraints in SMT
- An introduction to the technique of formative processes in set theory
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
- scientific article; zbMATH DE number 839566 (Why is no real title available?)
- A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions
- Layered map reasoning: an experimental approach put to trial on sets
- A Set-theoretic Approach to Reasoning Services for the Description Logic đ â D 4,Ă
- An improved set-based reasoner for the description logic \(\mathcal{DL}_\mathrm{D}^{4,\times\dagger}\)
- Why Predicative Sets?
- scientific article; zbMATH DE number 7533333 (Why is no real title available?)
- Complexity assessments for decidable fragments of set theory. I: A taxonomy for the Boolean case
- Computational logic and set theory. Applying formalized logic to analysis. Foreword by Martin Davis
- On sets and graphs. Perspectives on logic and combinatorics
- A Framework for Formalizing Set Theories Based on the Use of Static Set Terms
- A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case
- scientific article; zbMATH DE number 4183384 (Why is no real title available?)
- An Automation-Friendly Set Theory for the B Method
- STMM: A set theory for mechanized mathematics
- An automatically verified prototype of the Android permissions system
- Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory
- 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
- Integrating cardinality constraints into constraint logic programming with sets
- The decision problem for undirected graphs with reachability and acyclicity
- The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations
- A tableau-based decision procedure for a fragment of set theory with iterated membership
- Combining sets with cardinals
- Deciding Boolean algebra with Presburger arithmetic
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)
