Herbrand-satisfiability of a quantified set-theoretic fragment

DOI10.3233/FI-2017-1460zbMATH Open1374.68238OpenAlexW2593625122MaRDI QIDQ4589601FDOQ4589601

Authors Domenico Cantone, Cristiano Longo, Marianna Nicolosi Asmundo 

Publication date 10 November 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2017-1460

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Axiomatics of classical set theory and its fragments (03E30)

Recommendations

• A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
• Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
• A decidable quantified fragment of set theory involving ordered pairs with applications to description logics
• scientific article; zbMATH DE number 7340151
• Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability

Cited in

(5)

• scientific article; zbMATH DE number 7297821 (Why is no real title available?)
• scientific article; zbMATH DE number 5898609 (Why is no real title available?)
• The \(\exists\forall^2\) fragment of the first-order theory of atomic set constraints is \(\Pi_1^0\)-hard
• scientific article; zbMATH DE number 7340151 (Why is no real title available?)
• A decidable quantified fragment of set theory involving ordered pairs with applications to description logics

This page was built for publication: Herbrand-satisfiability of a quantified set-theoretic fragment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589601)