Positive rudimentarity of the graphs of Ackermann and Grzegorczyk (Q1168313): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q5824357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of recursive functions based on Ackermann's function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free languages and rudimentary attributes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bounded arithmetic hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Formal Systems. (AM-47) / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01629447 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008978907 / rank
 
Normal rank

Latest revision as of 11:36, 30 July 2024

scientific article
Language Label Description Also known as
English
Positive rudimentarity of the graphs of Ackermann and Grzegorczyk
scientific article

    Statements

    Positive rudimentarity of the graphs of Ackermann and Grzegorczyk (English)
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    positive rudimentary predicates
    0 references
    Ackermann's function
    0 references
    Grzegorczyk's function
    0 references
    Grzegorczyk hierarchy
    0 references
    0 references