Borel Determinacy and Metamathematics

PDF Version Also Available for Download.

Description

Borel determinacy states that if G(T;X) is a game and X is Borel, then G(T;X) is determined. Proved by Martin in 1975, Borel determinacy is a theorem of ZFC set theory, and is, in fact, the best determinacy result in ZFC. However, the proof uses sets of high set theoretic type (N1 many power sets of ω). Friedman proved in 1971 that these sets are necessary by showing that the Axiom of Replacement is necessary for any proof of Borel Determinacy. To prove this, Friedman produces a model of ZC and a Borel set of Turing degrees that neither contains ... continued below

Creation Information

Bryant, Ross December 2001.

Context

This thesis is part of the collection entitled: UNT Theses and Dissertations and was provided by UNT Libraries to Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 309 times . More information about this thesis can be viewed below.

Who

People and organizations associated with either the creation of this thesis or its content.

Author

Chair

Committee Member

Publisher

Rights Holder

For guidance see Citations, Rights, Re-Use.

  • Bryant, Ross David

Provided By

UNT Libraries

Library facilities at the University of North Texas function as the nerve center for teaching and academic research. In addition to a major collection of electronic journals, books and databases, five campus facilities house just under six million cataloged holdings, including books, periodicals, maps, documents, microforms, audiovisual materials, music scores, full-text journals and books. A branch library is located at the University of North Texas Dallas Campus.

Contact Us

What

Descriptive information to help identify this thesis. Follow the links below to find similar items on the Digital Library.

Degree Information

Description

Borel determinacy states that if G(T;X) is a game and X is Borel, then G(T;X) is determined. Proved by Martin in 1975, Borel determinacy is a theorem of ZFC set theory, and is, in fact, the best determinacy result in ZFC. However, the proof uses sets of high set theoretic type (N1 many power sets of ω). Friedman proved in 1971 that these sets are necessary by showing that the Axiom of Replacement is necessary for any proof of Borel Determinacy. To prove this, Friedman produces a model of ZC and a Borel set of Turing degrees that neither contains nor omits a cone; so by another theorem of Martin, Borel Determinacy is not a theorem of ZC. This paper contains three main sections: Martin's proof of Borel Determinacy; a simpler example of Friedman's result, namely, (in ZFC) a coanalytic set of Turing degrees that neither contains nor omits a cone; and finally, the Friedman result.

Language

Identifier

Unique identifying numbers for this thesis in the Digital Library or other systems.

Collections

This thesis is part of the following collection of related materials.

UNT Theses and Dissertations

Theses and dissertations represent a wealth of scholarly and artistic content created by masters and doctoral students in the degree-seeking process. Some ETDs in this collection are restricted to use by the UNT community.

What responsibilities do I have when using this thesis?

When

Dates and time periods associated with this thesis.

Creation Date

  • December 2001

Added to The UNT Digital Library

  • Sept. 25, 2007, 10:56 p.m.

Description Last Updated

  • Nov. 26, 2008, 2:35 p.m.

Usage Statistics

When was this thesis last used?

Yesterday: 0
Past 30 days: 3
Total Uses: 309

Interact With This Thesis

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Bryant, Ross. Borel Determinacy and Metamathematics, thesis, December 2001; Denton, Texas. (digital.library.unt.edu/ark:/67531/metadc3061/: accessed April 30, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; .