4

I've heard this joke thrown around:

The Axiom of Choice is obviously true, the well-ordering principle is obviously false, and who can guess about Zorn's lemma?

Of course, all three statements are equivalent. Are there non trivial reformulations of any of other axioms for ZFC?

Nitin
  • 2,988

3 Answers3

4

An interesting reformulation of ZF uses levels (the levels of the Von Neumann hierarchy, actually). We have of variables two types: sets ($x$,$y$,...) and levels ($V$, $V'$,...). Can be proved that ZF is equivalent to Extensionality, Separation, Infinity, Replacement and:

Accumulation: $$\forall V'\forall x[x\in V'\iff\exists V\in V'(x\in V\vee x\subset V)].$$

Restriction: $$\forall x\exists V(x\subset V).$$

(exercise 3.11.9 of Set Theory by Frank Drake)

Martín-Blas Pérez Pinilla
  • 42,722
  • 4
  • 51
  • 94
3

Sure, as many as you like. For example:

  • Relative to the other axioms of $\operatorname{ZFC}$, the axiom scheme of replacement and the axiom scheme of collection are equivalent. However, this is no longer true, when dropping the power set axiom.
  • $\operatorname{ZFC}$ is equivalent to $\operatorname{ZFC}^0$, where the latter doesn't allow parameters in its axiom schemes. See here.
  • There are, relative to the other axioms of $\operatorname{ZFC}$, many equivalent formulations of the axiom of infinity, e.g. "$V_{\omega}$ exists".
  • The usual formulation of $\operatorname{ZFC}$ is redundant. Therefore you can leave out any of the redundant axioms, say $\phi$. Then, relative to the other axioms of $\operatorname{ZFC}$, $\phi$ is equivalent to $\psi$ for any $\psi$ with $\operatorname{ZFC} \vdash \psi$.
  • ...
Stefan Mesken
  • 16,852
  • 3
  • 28
  • 48
  • 1
    When you say "[t]he usual formulation of ZFC is redundant", is this proven or are you saying if that is true, we can leave out the redundant axioms? – Nitin Nov 23 '16 at 16:11
  • @Nitin I'm saying that there are axioms included, that already follow from others. In particular, separation and pairing are entirely redundant see here. – Stefan Mesken Nov 23 '16 at 16:15
  • 1
    Plus, any presentation of replacement I am aware of includes redundant axioms. – Andrés E. Caicedo Nov 24 '16 at 14:46
  • @AndrésE.Caicedo That got me thinking: Is there a $\subseteq$-minimal subset of $\operatorname{ZFC}$ equivalent to $\operatorname{ZFC}$ that is not recursively enumerable? If so, we should use that instead! – Stefan Mesken Nov 24 '16 at 18:10
0

Something that I have read of, but have not studied: Take the versions of the Comprehension and Separation schemas in Kunen [1]. Kurt Godel showed that in ZF minus Comprehension, the Comprehension schema can be replaced by 8 sentences that he presented (or,equivalenty, by one cumbersome sentence.) I dk if Infinity matters here but I doubt it.

Reference: [1].Kunen, K. Set Theory: An Introduction to Independence Proofs.

DanielWainfleet
  • 59,529
  • That would imply that ZF is finitely axiomatizable, which is not true. – Asaf Karagila Nov 24 '16 at 12:20
  • @AsafKaragila Why? The system still has replacement, I assume. If anything, comprehension can be eliminated. – Andrés E. Caicedo Nov 24 '16 at 14:01
  • Do you have a reference for this? Gödel showed how we can use a finite list of functions to code the constructible universe rather than having to formalize definability, but I do not recall him addressing comprehension specifically. (He worked in a system different from ZF anyway.) – Andrés E. Caicedo Nov 24 '16 at 14:04
  • 1
    @Andrés: I see, but in that case separtaion is just a theorem and can be removed altogether (or replaced by something like $\exists x(x=x)$ or any other valid sentence). – Asaf Karagila Nov 24 '16 at 14:06