KBOs, ordinals, subrecursive hierarchies and all that

DOI10.1093/LOGCOM/EXU072zbMATH Open1361.68113OpenAlexW2144278562MaRDI QIDQ2987062

Georg Moser

Publication date: 17 May 2017

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6c2e00855a42078012df5d250aa3731598088453

zbMATH Keywords

complexityordinalsterm-rewrite systemssubrecursive hierarchiesKnuth-Bendix orders

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

On the Computational Content of Termination Proofs

Uses Software

• Tyrolean

Recommendations

• Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs 👍 👎
• Recursion on generalized computable ordinals 👍 👎
• Ordinals and Knuth-Bendix Orders 👍 👎
• Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets 👍 👎
• Hierarchies of Partially Ordered Connectives and Quantifiers 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: KBOs, ordinals, subrecursive hierarchies and all that

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2987062)