Gogol, Daniel Sentences with three quantifiers are decidable in set theory. (English) Zbl 0397.03013 Fundam. Math. 102, 1-8 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 3 Documents MSC: 03C10 Quantifier elimination, model completeness, and related topics 03B25 Decidability of theories and sets of sentences Keywords:Sentences with Three Quantifiers; Decidability; Closed Prenex Formula; Zermelo-Frankel Set Theory; Axiom of Choice; Axiom of Regularity; Characterization in Terms of Games Citations:Zbl 0096.243 PDFBibTeX XMLCite \textit{D. Gogol}, Fundam. Math. 102, 1--8 (1979; Zbl 0397.03013) Full Text: DOI EuDML