Jump to ContentJump to Main Navigation
Set Theory and its PhilosophyA Critical Introduction$
Users without a subscription are not able to see the full content.

Michael Potter

Print publication date: 2004

Print ISBN-13: 9780199269730

Published to Oxford Scholarship Online: September 2011

DOI: 10.1093/acprof:oso/9780199269730.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 22 November 2019

Ordinals

Ordinals

Chapter:
(p.175) Chapter 11 Ordinals
Source:
Set Theory and its Philosophy
Author(s):

Michael Potter (Contributor Webpage)

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199269730.003.0016

The simple and general principles of induction are powerful tools for proving things about the natural numbers. This chapter investigates ways in which they can be generalized to apply to a very much wider class of ordered sets than the subsets of ω. The basis of this study is the observation that a version of induction can be applied to any ordered set with a property called well-ordering. The strategy is to apply much the same techniques to the study of isomorphism between well-ordered sets used in Chapter 9 to investigate equinumerosity between sets. Just as that work led to an arithmetic of cardinals, what this chapter does is lead to an arithmetic of ordinals.

Keywords:   ordinals, well-ordering, cardinality, transfinite induction, recursion

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .