Undecidability results for restricted universally quantified formulae of set theory

DOI10.1002/cpa.3160460104zbMath0797.03005OpenAlexW2005661612MaRDI QIDQ4291741

Alberto Policriti, Franco Parlamento

Publication date: 17 October 1994

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cpa.3160460104

zbMATH Keywords

satisfiabilityantifoundation axiom\(\omega\)-modelscodings of Turing machine computations in set theoretic languageundecidability in first-order set theoretic languageZF without Foundation Axiom

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10) Set theory (03E99)

Related Items (4)

Three-variable statements of set-pairing ⋮ Decidability and completeness for open formulas of membership theories ⋮ Set-syllogistics meet combinatorics ⋮ Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini

Cites Work

• Unnamed Item

This page was built for publication: Undecidability results for restricted universally quantified formulae of set theory