A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
From MaRDI portal
(Redirected from Publication:477206)
Recommendations
- scientific article; zbMATH DE number 7340151
- A decidable quantified fragment of set theory involving ordered pairs with applications to description logics
- The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations
- scientific article; zbMATH DE number 16631
- Decidability of the restricted theories of a class of partial orders
- Decidable fragments of many-sorted logic
- Decidable Fragments of Many-Sorted Logic
- On decidability and axiomatizability of some ordered structures
- Quasi-decidability of a fragment of the first-order theory of real numbers
- Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices
Cites work
- scientific article; zbMATH DE number 1641581 (Why is no real title available?)
- scientific article; zbMATH DE number 3976287 (Why is no real title available?)
- scientific article; zbMATH DE number 3715506 (Why is no real title available?)
- scientific article; zbMATH DE number 50150 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- A decidable quantified fragment of set theory involving ordered pairs with applications to description logics
- Computational logic and set theory. Applying formalized logic to analysis. Foreword by Martin Davis
- Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
- Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
- Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator
- Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator
- Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\)
- Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs
- Notes from the logbook of a proof-checker's project
- On the Properties of Metamodeling in OWL
- The Bernays-Schönfinkel-Ramsey class for set theory: decidability
- The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
- The Description Logic Handbook
- The undecidability of the domino problem
Cited in
(9)- Some fragments of second-order logic over the reals for which satisfiability and equivalence are (un)decidable
- Solving quantifier-free first-order constraints over finite sets and binary relations
- A decidable quantified fragment of set theory involving ordered pairs with applications to description logics
- Herbrand-satisfiability of a quantified set-theoretic fragment
- scientific article; zbMATH DE number 7340151 (Why is no real title available?)
- The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations
- A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers
- Web ontology representation and reasoning via fragments of set theory
- Automated reasoning with restricted intensional sets
This page was built for publication: A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477206)
