Three quantifier sentences
AbstractWe give a complete proof that all 3 quantifier sentences in the primitive notation of set theory (Œ,=), are decided in ZFC, and in fact in a weak fragment of ZF without the power set axiom. We obtain information concerning witnesses of 2 quantifier formulas with one free variable. There is a 5 quantifier sentence that is not decided in ZFC (see [Fr02]).
Added to PP
Historical graph of downloads
References found in this work
No references found.
Citations of this work
No citations found.
Similar books and articles
Children's Acceptance of Underinformative Sentences: The Case of Some as a Determiner.Valentina Sala, Laura Macchi, Marco D'Addario & Maria Bagassi - 2009 - Thinking and Reasoning 15 (2):211-235.
Arithmetic Definability by Formulas with Two Quantifiers.Shih Ping Tung - 1992 - Journal of Symbolic Logic 57 (1):1-11.
Truth in V for Ǝ ∀∀-Sentences Is Decidable.D. Bellé & F. Parlamento - 2006 - Journal of Symbolic Logic 71 (4):1200 - 1222.
Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
On the Definability of the Quantifier “There Exist Uncountably Many”.Žarko Mijajlović - 1985 - Studia Logica 44 (3):257 - 264.
Theory Discovery From Data with Mixed Quantifiers.Kevin T. Kelly & Clark Glymour - 1990 - Journal of Philosophical Logic 19 (1):1 - 33.