Honest elementary degrees and degrees of relative provability without the cupping property (Q515565): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962938955 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57948749 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1604.06592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of the degrees of relative provability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induction rules, reflection principles, and provably recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the induction schema for decidable predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provability algebras and proof-theoretic ordinals. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of relative provability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unprovability and proving unprovability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4384146 / 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: Q4503966 / 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: Degrees of Total Algorithms versus Degrees of Honest Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streamlined subrecursive degree theory / 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: Q3325707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:08, 13 July 2024

scientific article
Language Label Description Also known as
English
Honest elementary degrees and degrees of relative provability without the cupping property
scientific article

    Statements

    Honest elementary degrees and degrees of relative provability without the cupping property (English)
    0 references
    0 references
    16 March 2017
    0 references
    sub-recursive hierarchies
    0 references
    honest elementary degrees
    0 references
    degrees of relative provability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references