A characterisation of multiply recursive functions with Higman's lemma. (Q1400716): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods / 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: Q3874266 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orderings for term-rewriting systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4385532 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Termination proofs by multiset path orderings imply primitive recursive derivation lengths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5533181 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5297489 / rank | |||
Normal rank |
Revision as of 08:39, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A characterisation of multiply recursive functions with Higman's lemma. |
scientific article |
Statements
A characterisation of multiply recursive functions with Higman's lemma. (English)
0 references
2 November 2003
0 references
string rewriting systems
0 references
0 references
0 references