Sentences with three quantifiers are decidable in set theory

DOI10.4064/FM-102-1-1-8MaRDI QIDQ4180323zbMATH OpenOpenAlexFDO

Authors Daniel Gogol

Publication date 1979

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Axiom of ChoiceAxiom of RegularityCharacterization in Terms of GamesClosed Prenex FormulaDecidabilitySentences 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)

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4180323)