<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/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-11-21T07:50:11Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/154" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/154</identifier><datestamp>2026-05-13T16:37:21Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Greenberg, Noam</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2004-07-16T18:39:00Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2004-07-16T18:39:00Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2004-07-16T18:39:00Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/154</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">6475944</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classical priority constructions can be lifted to any admissible ordinal satisfying a sufficiently strong fragment of the replacement scheme. We show, however, that this is not always the case. In fact, there are some constructions which&#xd;
make an essential use of the notion of finiteness which cannot be replaced by the generalized notion of alpha-finiteness. As examples we discuss both codings of models of arithmetic into the recursively enumerable degrees, and non-distributive lattice embeddings into these degrees. We show that if an admissible ordinal alpha is effectively close to omega (where this closeness can be measured by size or by&#xd;
cofinality) then such constructions may be performed in the alpha-r.e. degrees, but&#xd;
otherwise they fail. The results of these constructions can be expressed in the&#xd;
first-order language of partially ordered sets, and so these results also show that&#xd;
there are natural elementary differences between the structures of alpha-r.e. degrees&#xd;
for various classes of admissible ordinals alpha. Together with coding work which shows&#xd;
that for some alpha, the theory of the alpha-r.e. degrees is complicated, we get that&#xd;
for every admissible ordinal alpha, the alpha-r.e. degrees and the classical r.e.&#xd;
degrees are not elementarily equivalent.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">710115 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en_US</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="isformatof">bibid: 6475944</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Admissible Recursion Theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Recursively Enumerable Degrees</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Finite</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">The role of true finiteness in the admissible recursively enumerable degrees</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Greenberg, Noam</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="aa0cc2a3-e027-4179-9e7d-2c19187b6a85">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>The role of true finiteness in the admissible recursively enumerable degrees&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2004-07-16T18:39:00Z&lt;/PublicationDate>
   	&lt;Authors&gt;
      	&lt;Author>
        	&lt;DisplayName>Greenberg, Noam&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>Admissible Recursion Theory&lt;/Keyword>
    &lt;Keyword>Recursively Enumerable Degrees&lt;/Keyword>
    &lt;Keyword>Finite&lt;/Keyword>
   	&lt;Abstract>When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classical priority constructions can be lifted to any admissible ordinal satisfying a sufficiently strong fragment of the replacement scheme. We show, however, that this is not always the case. In fact, there are some constructions which&#xd;
make an essential use of the notion of finiteness which cannot be replaced by the generalized notion of alpha-finiteness. As examples we discuss both codings of models of arithmetic into the recursively enumerable degrees, and non-distributive lattice embeddings into these degrees. We show that if an admissible ordinal alpha is effectively close to omega (where this closeness can be measured by size or by&#xd;
cofinality) then such constructions may be performed in the alpha-r.e. degrees, but&#xd;
otherwise they fail. The results of these constructions can be expressed in the&#xd;
first-order language of partially ordered sets, and so these results also show that&#xd;
there are natural elementary differences between the structures of alpha-r.e. degrees&#xd;
for various classes of admissible ordinals alpha. Together with coding work which shows&#xd;
that for some alpha, the theory of the alpha-r.e. degrees is complicated, we get that&#xd;
for every admissible ordinal alpha, the alpha-r.e. degrees and the classical r.e.&#xd;
degrees are not elementarily equivalent.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>