Trees, ordinals and termination
From MaRDI portal
Publication:5044740
Recommendations
Cites work
- scientific article; zbMATH DE number 1678386 (Why is no real title available?)
- scientific article; zbMATH DE number 3920456 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- Accessible Independence Results for Peano Arithmetic
- Built-up systems of fundamental sequences and hierarchies of number-theoretic functions
- Note on a proof of the extended Kirby-Paris theorem on labelled finite trees
- Orderings for term-rewriting systems
- Proving termination with multiset orderings
- Termination of rewriting
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
Cited in
(8)- More problems in rewriting
- Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
- scientific article; zbMATH DE number 4158596 (Why is no real title available?)
- scientific article; zbMATH DE number 4035798 (Why is no real title available?)
- Type-theoretic approaches to ordinals
- scientific article; zbMATH DE number 1746894 (Why is no real title available?)
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations
- New Computational Paradigms
This page was built for publication: Trees, ordinals and termination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044740)