Back to results
University of Illinois at Urbana-Champaign
Partition Theorems and Computability Theory
Abstract
dc:description"We also study Ramsey degrees, i.e. those Turing degrees which are able to compute homogeneous sets for every computable 2-coloring of pairs of natural numbers, in an attempt to further understand the effective content of Ramsey's Theorem for exponent 2. We establish some new results about these degrees, and obtain as a corollary the nonexistence of a ""universal"" computable 2-coloring of pairs of natural numbers."
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Mileti, Joseph Roy
- Contributors dc:contributor
-
- Jockusch, Carl G., Jr.
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI3153383
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/86840