Pages that link to "Item:Q1182475"
From MaRDI portal
The following pages link to What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory (Q1182475):
Displaying 31 items.
- Coq formalization of the higher-order recursive path ordering (Q843949) (← links)
- Ordinal arithmetic: Algorithms and mechanization (Q851144) (← links)
- Ordinal recursive bounds for Higman's theorem (Q1129003) (← links)
- A notation for lambda terms. A generalization of environments (Q1129257) (← links)
- Well rewrite orderings and well quasi-orderings (Q1209622) (← links)
- Proof-theoretic investigations on Kruskal's theorem (Q1210137) (← links)
- Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\) (Q1295369) (← links)
- Equational derivation vs. computation (Q1338198) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Invariants, patterns and weights for ordering terms (Q1581131) (← links)
- Well quasi orders in a categorical setting (Q1734279) (← links)
- Ordinals. I: Basic notions (Q1817060) (← links)
- Ordinals. II: Some applications and a functorial approach (Q1817061) (← links)
- An abstract factorization theorem and some applications (Q2132471) (← links)
- Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data (Q2268856) (← links)
- Theorems as Constructive Visions (Q2915840) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- Strong WQO Tree Theorems (Q3295147) (← links)
- The computable dimension of trees of infinite height (Q3370758) (← links)
- On some slowly terminating term rewriting systems (Q3466405) (← links)
- Type-Based Termination with Sized Products (Q3540199) (← links)
- A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets (Q3576087) (← links)
- From Kruskal’s theorem to Friedman’s gap condition (Q4988429) (← links)
- (Q5009706) (← links)
- Trees, ordinals and termination (Q5044740) (← links)
- E-Unification based on Generalized Embedding (Q5084482) (← links)
- The length of an intersection (Q5108104) (← links)
- A Tutorial on Type-Based Termination (Q5191089) (← links)
- Simple termination revisited (Q5210790) (← links)
- An ordinal calculus for proving termination in term rewriting (Q5878912) (← links)
