Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-p2v8j Total loading time: 0 Render date: 2024-04-30T13:18:20.432Z Has data issue: false hasContentIssue false

Introduction

Published online by Cambridge University Press:  31 March 2017

Peter G. Hinman
Affiliation:
University of Michigan, Ann Arbor
Get access

Summary

The theory set out in this book is the result of the confluence and common development of two currents of mathematical research, Descriptive Set Theory and Recursion Theory. Both are concerned with notions of definability and, more broadly, with the classification of mathematical objects according to various measures of their complexity. These are the common themes which run through the topics discussed in this book.

Descriptive Set Theory arose around the turn of the century as a reaction among some of the mathematical analysts of the day against the free-wheeling methods of Cantorian set theory. People such as Baire, Borel, and Lebesgue felt uneasy with constructions which required the Axiom of Choice or the set of all countable ordinals and began to investigate what part of analysis could be carried out by more explicit and constructive means. Needless to say, there was vigorous disagreement over the meaning of these terms. Some of the landmarks in the early days of Descriptive Set Theory are the construction of the Borel sets, Suslin's Theorem that a set of real numbers is Borel just in case both it and its complement are analytic, and the discovery that analytic sets have many pleasant properties — they are Lebesgue measurable, have the Baire property, and satisfy the Continuum Hypothesis.

A natural concomitant of this interest in the means necessary to effect mathematical constructions is the notion of hierarchy. Roughly speaking, a hierarchy is a classification of a collection of mathematical objects into levels, usually indexed by ordinal numbers. Objects appearing in levels indexed by larger ordinals are in some way more complex that those at lower levels and the index of the first level at which an object appears is thus a measure of the complexity of the object. Such a classification serves both to deepen our understanding of the objects classified and as a valuable technical tool for establishing their properties.

A familiar example, and one which was an important model in the development of the theory, is the hierarchy of Borel sets of real numbers. This class is most simply characterized as the smallest class of sets containing all intervals and closed under the operations of complementation and countable union.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Introduction
  • Peter G. Hinman, University of Michigan, Ann Arbor
  • Book: Recursion-Theoretic Hierarchies
  • Online publication: 31 March 2017
  • Chapter DOI: https://doi.org/10.1017/9781316717110.003
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Introduction
  • Peter G. Hinman, University of Michigan, Ann Arbor
  • Book: Recursion-Theoretic Hierarchies
  • Online publication: 31 March 2017
  • Chapter DOI: https://doi.org/10.1017/9781316717110.003
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Introduction
  • Peter G. Hinman, University of Michigan, Ann Arbor
  • Book: Recursion-Theoretic Hierarchies
  • Online publication: 31 March 2017
  • Chapter DOI: https://doi.org/10.1017/9781316717110.003
Available formats
×