<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-20T19:16:50Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/86840" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/86840</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_16340</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_16339</setSpec>
        <setSpec>com_2142_8903</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Jockusch, Carl G., Jr.</dc:contributor>
          <dc:creator>Mileti, Joseph Roy</dc:creator>
          <dc:date>2015-09-28T15:19:48Z</dc:date>
          <dc:date>2015-09-28T15:19:48Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2004</dc:date>
          <dc:date>2004</dc:date>
          <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."</dc:description>
          <dc:description>Made available in DSpace on 2015-09-28T15:19:48Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3153383.pdf: 4161995 bytes, checksum: 51f49560771c08071118051a500768af (MD5)
  Previous issue date: 2004</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 88121
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>76 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/86840</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3153383</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Mathematics</dc:subject>
          <dc:title>Partition Theorems and Computability Theory</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Mathematics</department>
            <discipline>Mathematics</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
