Streamlined subrecursive degree theory (Q408165): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4893145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Uniform Approach to Fundamental Sequences and Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4893148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A jump operator on honest subrecursive degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subrecursive degrees and fragments of Peano arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented loop languages and classes of computable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The honest subrecursive classes are a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the density of honest subrecursive classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Classification of the Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325707 / rank
 
Normal rank

Revision as of 00:27, 5 July 2024

scientific article
Language Label Description Also known as
English
Streamlined subrecursive degree theory
scientific article

    Statements

    Streamlined subrecursive degree theory (English)
    0 references
    29 March 2012
    0 references
    The paper under review consists of two parts. Part I is devoted to the investigation of the structure of honest elementary degrees, i.e., the degree structure induced on the honest functions by the reducibility relation ``being (Kalmar) elementary in''. In Part II the degree theory found in Part I is generalized. The reducibility relation ``being \(\alpha\)-elementary in'', where \(\alpha\) is an ordinal \(\leq \varepsilon_{0}\), is introduced and the structure of honest \(\alpha\)-elementary degrees is investigated. Relations between the degree theory developed in the paper and provability in Peano arithmetic is also discussed.
    0 references
    subrecursive degrees
    0 references
    honest functions
    0 references
    provability in PA
    0 references

    Identifiers