Well partial orders

DOI10.1007/978-3-031-47921-2_10MaRDI QIDQ6612816

Andreas Weiermann

Publication date: 1 October 2024

zbMATH Keywords

finite treesHigman's lemmaKruskal's tree theoremwell quasi orderswell partial ordersmaximal order typesFriedman style miniaturization

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Subsystems of classical logic (including intuitionistic logic) (03B20) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An order-theoretic characterization of the Howard-Bachmann-hierarchy
• Orderings for term-rewriting systems
• Phase transitions of iterated Higman-style well-partial-orderings
• Graph minors. XX: Wagner's conjecture
• Phase transitions for Gödel incompleteness
• Proof-theoretic investigations on Kruskal's theorem
• Polynomial functions with exponentiation are well ordered
• Bounding derivation lengths with functions from the slow growing hierarchy
• A characterisation of multiply recursive functions with Higman's lemma.
• Continuous increasing functions of finite and transfinite ordinals.
• Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
• Complexity bounds for some finite forms of Kruskal's theorem
• Proof-theoretic analysis of termination proofs
• Minimal bad sequences are necessary for a uniform Kruskal theorem
• Well-partial-orderings and the big Veblen number
• The number of trees
• Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen
• Analysis of a Double Kruskal Theorem
• Well (and Better) Quasi-Ordered Transition Systems
• On the lengths of bad sequences of monomial ideals over polynomial rings
• Bounds for the closure ordinals of essentially monotonic increasing functions
• Phase transition thresholds for some Friedman-style independence results
• A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
• Natural well-orderings
• Ordinal numbers and the Hilbert basis theorem
• Bounds for the closure ordinals of replete monotonic increasing functions
• Length of Polynomial Ascending Chains and Primitive Recursiveness.
• A Uniform Approach to Fundamental Sequences and Hierarchies
• An order‐theoretic characterization of the Schütte‐Veblen‐Hierarchy
• Unlabeled trees: Distribution of the maximum degree
• A classification of rapidly growing Ramsey functions
• An application of graphical enumeration to PA *
• Fraïssé’s conjecture in Π11-comprehension
• Orderings of monomial ideals
• Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees
• TRACKING CHAINS REVISITED
• Program termination and well partial orderings
• Systems of predicative analysis, II: Representations of ordinals
• Ordering by Divisibility in Abstract Algebras
• Arithmetic of ordinals with applications to the theory of ordered Abelian groups
• Long finite sequences

This page was built for publication: Well partial orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612816)