Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability

DOI10.1007/BF00243810zbMATH Open0734.03006OpenAlexW2087640143MaRDI QIDQ810494FDOQ810494

Alberto Policriti, Franco Parlamento

Publication date: 1991

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00243810

Recommendations

• Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae
• Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
• Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union 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

zbMATH Keywords

finite satisfiabilitydecision problemhereditarily finite setschoice operatorfirst order set theoretic languagequantified formulaestrong reflection principlesunquantified formulae

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Set theory (03E99)

Cited In (18)

• Three-quantifier sentences
• Set graphs. IV. Further connections with claw-freeness
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random models and the Gödel case of the decision problem
• Decidability and completeness for open formulas of membership theories
• Title not available (Why is that?)
• Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators
• A set-theoretic translation method for polymodal logics
• A decision method for a set of first order classical formulas and its applications to decision problems for non-classical propositional logics
• Title not available (Why is that?)
• Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory
• Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini
• Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator
• The automation of syllogistic. II: Optimization and complexity issues
• THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION
• Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae
• Decision procedures for elementary sublanguages of set theory VII. Validity in set theory when a choice operator is present

This page was built for publication: Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability

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