What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
Publication:1182475
DOI10.1016/0168-0072(91)90022-EzbMath0758.03025DBLPjournals/apal/Gallier91OpenAlexW2076972393WikidataQ29030153 ScholiaQ29030153MaRDI QIDQ1182475
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
surveyordinal notationsnormal functionsunprovabilitycompletion procedurecritical ordinalshierarchies of fast- and slow-growing functionsisomorphism of treesKruskal's tree theoremterm orderings
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Grammars and rewriting systems (68Q42) Proof theory in general (including proof-theoretic semantics) (03F03) Recursive ordinals and ordinal notations (03F15)
Related Items (32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orderings for term-rewriting systems
- On the recursive decomposition ordering with lexicographical status and other related orderings
- Harvey Friedman's research on the foundations of mathematics
- Termination of rewriting
- Using unavoidable set of trees to generalize Kruskal's theorem
- On multiset orderings
- Well rewrite orderings and well quasi-orderings
- Well quasi-ordered sets
- Proof theory and ordinal analysis
- Konstruktiver Aufbau eines Abschnitts der zweiten Cantorschen Zahlenklasse
- Slow growing versus fast growing
- The slow-growing and the Graegorczyk hierarchies
- Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
- Natural well-orderings
- Ordinal numbers and the Hilbert basis theorem
- Proving termination with multiset orderings
- Π12-logic, Part 1: Dilators
- Accessible Independence Results for Peano Arithmetic
- Normal functions and constructive ordinal notations
- Systems of predicative analysis
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- The Universe of Set Theory
- Ordering by Divisibility in Abstract Algebras
- On the restricted ordinal theorem
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