handout06

# handout06 - Math 5020 Handout 6 Ordinal Arithmetic From now...

This preview shows pages 1–2. Sign up to view the full content.

Math 5020 Handout 6 Ordinal Arithmetic From now on we assume ZF Regularity, until further notice. 1. (Transﬁnite Induction) Let C be a class of ordinals and assume that (i) 0 C ; (ii) if α C then α + 1 C ; (iii) if α is a nonzero limit ordinal and β C for all β < α , then α C . Then C = Ord. 2. A sequence is a function with domain Ord. We denote a sequence by a α : α Ord . If α is an ordinal, a sequence of length α is function with domain α . A ﬁnite sequence is a sequence of length n for some ﬁnite ordinal n ω . 3. (Transﬁnite Recursion) For every function G there is a unique function F such that for all ordinals α , F ( α ) = G ( F | α ). 4. Let W be a set and < W × W . < is a well-order if it is a linear order and any nonempty subset of W has a < -least element. 5. Every well-order is isomorphic to a unique ordinal. I.e., if W is a set and < is a well-order on W , then there is a unique ordinal α such that there exists a bijection

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 04/11/2011 for the course MATH 5020 taught by Professor Staff during the Spring '11 term at North Texas.

### Page1 / 2

handout06 - Math 5020 Handout 6 Ordinal Arithmetic From now...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online