A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
From MaRDI portal
Publication:477206
DOI10.1016/J.TCS.2014.03.021zbMATH Open1329.03045OpenAlexW2011350458MaRDI QIDQ477206FDOQ477206
Authors: Domenico Cantone, Cristiano Longo 
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.03.021
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
Decidability of theories and sets of sentences (03B25) Axiomatics of classical set theory and its fragments (03E30)
Cites Work
- Title not available (Why is that?)
- The Description Logic Handbook
- On the Properties of Metamodeling in OWL
- Title not available (Why is that?)
- The undecidability of the domino problem
- Title not available (Why is that?)
- Computational logic and set theory. Applying formalized logic to analysis. Foreword by Martin Davis
- The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
- Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator
- A decidable quantified fragment of set theory involving ordered pairs with applications to description logics
- The Bernays-Schönfinkel-Ramsey class for set theory: decidability
- 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. I. Multi-level syllogistic and some extensions
- Title not available (Why is that?)
- Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
- Title not available (Why is that?)
- Notes from the logbook of a proof-checker's project
- Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs
- Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\)
Cited In (6)
- 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
- Title not available (Why is that?)
- 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
Uses Software
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)
