The following pages link to Trees, ordinals and termination (Q5044740):
Displaying 7 items.
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees (Q582289) (← links)
- Type-theoretic approaches to ordinals (Q2700785) (← links)
- (Q3775533) (← links)
- (Q4531086) (← links)
- More problems in rewriting (Q5055812) (← links)
- New Computational Paradigms (Q5717041) (← links)