An ordinal calculus for proving termination in term rewriting

DOI10.1007/3-540-61064-2_40OpenAlexW1539334891MaRDI QIDQ5878912

E. A. Cichon, Hélène Touzet

Publication date: 23 February 2023

Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61064-2_40

zbMATH Keywords

rewriting systemsterminationprimitive recursionordinal recursion

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (3)

Size-based termination of higher-order rewriting ⋮ Ordinal recursive bounds for Higman's theorem ⋮ An ordinal measure based procedure for termination of functions

Cites Work

• Unnamed Item
• Unnamed Item
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• Ordinal complexity of recursive definitions
• Π12-logic, Part 1: Dilators
• Accessible Independence Results for Peano Arithmetic

This page was built for publication: An ordinal calculus for proving termination in term rewriting