Multiply-Recursive Upper Bounds with Higman’s Lemma (Q3012939): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2138781755 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1103.4399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic analysis of programs with well quasi-ordered domains. / 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: Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pumping and Counting on the Regular Post Embedding Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal recursive bounds for Higman's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite containment problem for Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of symbolic transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of well-quasi-ordering: a frequently discovered concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of number-theoretic functions. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets and large finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4447240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy Counter Machines Decidability Cheat Sheet / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of multiply recursive functions with Higman's lemma. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity bounds for some finite forms of Kruskal's theorem / rank
 
Normal rank

Latest revision as of 05:54, 4 July 2024

scientific article
Language Label Description Also known as
English
Multiply-Recursive Upper Bounds with Higman’s Lemma
scientific article

    Statements

    Identifiers

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