Sentences with three quantifiers are decidable in set theory
Fundamenta Mathematicae (1979)
- Volume: 102, Issue: 1, page 1-8
- ISSN: 0016-2736
Access Full Article
top
How to cite
topGogol, Daniel. "Sentences with three quantifiers are decidable in set theory." Fundamenta Mathematicae 102.1 (1979): 1-8. <http://eudml.org/doc/211009>.
@article{Gogol1979,
author = {Gogol, Daniel},
journal = {Fundamenta Mathematicae},
keywords = {Sentences with Three Quantifiers; Decidability; Closed Prenex Formula; Zermelo-Frankel Set Theory; Axiom of Choice; Axiom of Regularity; Characterization in Terms of Games},
language = {eng},
number = {1},
pages = {1-8},
title = {Sentences with three quantifiers are decidable in set theory},
url = {http://eudml.org/doc/211009},
volume = {102},
year = {1979},
}
TY - JOUR
AU - Gogol, Daniel
TI - Sentences with three quantifiers are decidable in set theory
JO - Fundamenta Mathematicae
PY - 1979
VL - 102
IS - 1
SP - 1
EP - 8
LA - eng
KW - Sentences with Three Quantifiers; Decidability; Closed Prenex Formula; Zermelo-Frankel Set Theory; Axiom of Choice; Axiom of Regularity; Characterization in Terms of Games
UR - http://eudml.org/doc/211009
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.