Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability
From MaRDI portal
Publication:810494
DOI10.1007/BF00243810zbMath0734.03006OpenAlexW2087640143MaRDI QIDQ810494
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
choice operatordecision problemfinite satisfiabilityhereditarily finite setsfirst order set theoretic languagequantified formulaestrong reflection principlesunquantified formulae
Related Items (6)
Decidability and completeness for open formulas of membership theories ⋮ A set-theoretic translation method for polymodal logics ⋮ Set graphs. IV. Further connections with claw-freeness ⋮ Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini ⋮ The automation of syllogistic. II: Optimization and complexity issues ⋮ Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators
This page was built for publication: Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability