A characterization of multiply recursive functions with Higman's lemma (Q4938604)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1405625
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of multiply recursive functions with Higman's lemma |
scientific article; zbMATH DE number 1405625 |
Statements
5 July 2000
0 references
string rewriting systems
0 references
multiply recursive functions
0 references
expressiveness of Higman's lemma
0 references
order type
0 references
derivation length
0 references
Hardy hierarchy
0 references
0.9926941394805908
0 references
0.7518661618232727
0 references
0.7478188872337341
0 references
0.7285186648368835
0 references
0.7260106801986694
0 references
A characterization of multiply recursive functions with Higman's lemma (English)
0 references
