Axiomatic Set Theory: Problem sheet[removed]a) Assuming ZF (ie. ZF∗ Foundation) prove that the following two definitions of “ordinal” are equivalent: (i) An ordinal is a transitive set well-ordered by ∈. (ii) An o - Axiom of regularity - Document - PDFSEARCH.IO

First Page	Meta Content
	Axiomatic Set Theory: Problem sheet[removed]a) Assuming ZF (ie. ZF∗ +Foundation) prove that the following two definitions of “ordinal” are equivalent: (i) An ordinal is a transitive set well-ordered by ∈. (ii) An o Add to Reading List Document Date: 2010-02-03 12:15:01 Open Document File Size: 48,17 KB Share Result on Facebook SocialTag Ordinal numbers Axioms of set theory Z notation Constructible universe Ordinal arithmetic Axiom of regularity S Hartogs number Reflection principle Mathematical logic

Axiomatic Set Theory: Problem sheet[removed]a) Assuming ZF (ie. ZF∗ +Foundation) prove that the following two definitions of “ordinal” are equivalent: (i) An ordinal is a transitive set well-ordered by ∈. (ii) An oAdd to Reading List