Page 1

Displaying 1 – 7 of 7

Showing per page

Three-quantifier sentences

Harvey M. Friedman (2003)

Fundamenta Mathematicae

We 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 [2]).

Currently displaying 1 – 7 of 7

Page 1