On the Computational Content of Termination Proofs
From MaRDI portal
Publication:3195706
DOI10.1007/978-3-319-20028-6_28zbMath1459.68093OpenAlexW952401291MaRDI QIDQ3195706
No author found.
Publication date: 20 October 2015
Published in: Evolving Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-20028-6_28
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
- Term rewriting theory for the primitive recursive functions
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Some results on cut-elimination, provable well-orderings, induction and reflection
- Proof-theoretic analysis of termination proofs
- KBOs, ordinals, subrecursive hierarchies and all that
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
