What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory

From MaRDI portal
Revision as of 00:08, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1182475

DOI10.1016/0168-0072(91)90022-EzbMath0758.03025DBLPjournals/apal/Gallier91OpenAlexW2076972393WikidataQ29030153 ScholiaQ29030153MaRDI QIDQ1182475

Jean H. Gallier

Publication date: 28 June 1992

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(91)90022-e




Related Items (32)

Trees, ordinals and terminationEquational derivation vs. computationAn abstract factorization theorem and some applicationsCoq formalization of the higher-order recursive path orderingOn the modularity of termination of term rewriting systemsOrdinal arithmetic: Algorithms and mechanizationTheorems as Constructive VisionsOn some slowly terminating term rewriting systemsE-Unification based on Generalized EmbeddingOrdinal recursive bounds for Higman's theoremA notation for lambda terms. A generalization of environmentsSimple termination of rewrite systemsThe length of an intersectionA constructive picture of Noetherian conditions and well quasi-ordersUnnamed ItemType-Based Termination with Sized ProductsThe Ideal Approach to Computing Closed Subsets in Well-Quasi-orderingsStrong WQO Tree TheoremsWell quasi orders in a categorical settingA Computation of the Maximal Order Type of the Term Ordering on Finite MultisetsWell rewrite orderings and well quasi-orderingsProof-theoretic investigations on Kruskal's theoremMind change complexity of inferring unbounded unions of restricted pattern languages from positive dataA Tutorial on Type-Based TerminationThe computable dimension of trees of infinite heightSimple termination revisitedOrdinals. I: Basic notionsOrdinals. II: Some applications and a functorial approachFrom Kruskal’s theorem to Friedman’s gap conditionInvariants, patterns and weights for ordering termsPredicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\)An ordinal calculus for proving termination in term rewriting



Cites Work


This page was built for publication: What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory