Sentences with three quantifiers are decidable in set theory

DOI10.4064/fm-102-1-1-8zbMath0397.03013OpenAlexW1536307137MaRDI QIDQ4180323

Daniel Gogol

Publication date: 1979

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/211009

zbMATH Keywords

DecidabilityAxiom of ChoiceAxiom of RegularityCharacterization in Terms of GamesClosed Prenex FormulaSentences with Three QuantifiersZermelo-Frankel Set Theory

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (3)

The automation of syllogistic. I: Syllogistic normal forms ⋮ The subset relation and 2‐stratified sentences in set theory and class theory ⋮ Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator

This page was built for publication: Sentences with three quantifiers are decidable in set theory