Pages that link to "Item:Q5878912"
From MaRDI portal
The following pages link to An ordinal calculus for proving termination in term rewriting (Q5878912):
Displaying 11 items.
- Term rewriting theory for the primitive recursive functions (Q674412) (← links)
- Ordinal arithmetic: Algorithms and mechanization (Q851144) (← links)
- Ordinal recursive bounds for Higman's theorem (Q1129003) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982) (← links)
- A proof of strongly uniform termination for Gödel's \(T\) by methods from local predicativity (Q1374676) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- Automatic termination proofs with transformation orderings (Q5055814) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q5096206) (← links)
- A survey of ordinal interpretations of type ɛ0 for termination of rewriting systems (Q5881273) (← links)
- Automated Deduction – CADE-19 (Q5900722) (← links)
- An ordinal measure based procedure for termination of functions (Q5940917) (← links)