Trees, ordinals and termination

DOI10.1007/3-540-56610-4_68zbMath1497.68140OpenAlexW1867700116MaRDI QIDQ5044740

Nachum Dershowitz

Publication date: 2 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56610-4_68

Mathematics Subject Classification ID

Data structures (68P05) Ordinal and cardinal numbers (03E10)

Related Items (3)

More problems in rewriting ⋮ Type-theoretic approaches to ordinals ⋮ Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations

Cites Work

• Orderings for term-rewriting systems
• Termination of rewriting
• Note on a proof of the extended Kirby-Paris theorem on labelled finite trees
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• Proving termination with multiset orderings
• Accessible Independence Results for Peano Arithmetic
• Built-up systems of fundamental sequences and hierarchies of number-theoretic functions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Trees, ordinals and termination