Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
The following link can be shared to navigate to this page. You can select the link to copy or click the 'Copy To Clipboard' button below.
Copy To Clipboard
Successfully Copied!
The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
 
Noam Greenberg University of Notre Dame, Notre Dame, IN
Front Cover for The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
Available Formats:
Electronic ISBN: 978-1-4704-0458-1
Product Code: MEMO/181/854.E
List Price: $63.00
MAA Member Price: $56.70
AMS Member Price: $37.80
Front Cover for The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
Click above image for expanded view
  • Front Cover for The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
  • Back Cover for The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
Noam Greenberg University of Notre Dame, Notre Dame, IN
Available Formats:
Electronic ISBN:  978-1-4704-0458-1
Product Code:  MEMO/181/854.E
List Price: $63.00
MAA Member Price: $56.70
AMS Member Price: $37.80
  • Book Details
     
     
    Memoirs of the American Mathematical Society
    Volume: 1812006; 99 pp
    MSC: Primary 03;

    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 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 cofinality) then such constructions may be performed in the \(\alpha\)-r.e. degrees, but otherwise they fail. The results of these constructions can be expressed in the first-order language of partially ordered sets, and so these results also show that there are natural elementary differences between the structures of \(\alpha\)-r.e. degrees for various classes of admissible ordinals \(\alpha\). Together with coding work which shows that for some \(\alpha\), the theory of the \(\alpha\)-r.e. degrees is complicated, we get that for every admissible ordinal \(\alpha\), the \(\alpha\)-r.e. degrees and the classical r.e. degrees are not elementarily equivalent.

  • Table of Contents
     
     
    • Chapters
    • 1. Introduction
    • 2. Coding into the R.E. degrees
    • 3. Coding effective successor models
    • 4. A negative result concerning effective successor models
    • 5. A nonembedding result
    • 6. Embedding the 1-3-1 lattice
  • Request Review Copy
  • Get Permissions
Volume: 1812006; 99 pp
MSC: Primary 03;

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 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 cofinality) then such constructions may be performed in the \(\alpha\)-r.e. degrees, but otherwise they fail. The results of these constructions can be expressed in the first-order language of partially ordered sets, and so these results also show that there are natural elementary differences between the structures of \(\alpha\)-r.e. degrees for various classes of admissible ordinals \(\alpha\). Together with coding work which shows that for some \(\alpha\), the theory of the \(\alpha\)-r.e. degrees is complicated, we get that for every admissible ordinal \(\alpha\), the \(\alpha\)-r.e. degrees and the classical r.e. degrees are not elementarily equivalent.

  • Chapters
  • 1. Introduction
  • 2. Coding into the R.E. degrees
  • 3. Coding effective successor models
  • 4. A negative result concerning effective successor models
  • 5. A nonembedding result
  • 6. Embedding the 1-3-1 lattice
Please select which format for which you are requesting permissions.