The ∀n∃‐Completeness of Zermelo‐Fraenkel Set Theory

DOI10.1002/malq.19780241902zbMath0387.03016OpenAlexW2124255744MaRDI QIDQ4168916

Daniel Gogol

Publication date: 1978

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19780241902

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Other classical set theory (including functions, relations, and set algebra) (03E20) Categoricity and completeness of theories (03C35)

Related Items (7)

Foundation versus induction in Kripke-Platek set theory ⋮ A note on the decidability of mls extended with the powerset operator ⋮ The automation of syllogistic. I: Syllogistic normal forms ⋮ The subset relation and 2‐stratified sentences in set theory and class theory ⋮ PRIMITIVE INDEPENDENCE RESULTS ⋮ Truth In V for ∃*∀∀-Sentences is Decidable ⋮ A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets

This page was built for publication: The ∀_n∃‐Completeness of Zermelo‐Fraenkel Set Theory