A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets

DOI10.1007/978-3-642-03073-4_50zbMath1268.03064OpenAlexW1512244371MaRDI QIDQ3576087

Andreas Weiermann

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://biblio.ugent.be/publication/856316

zbMATH Keywords

ordinalsterm orderingsfinite multisetsmaximal order typeswell-partial orderingswell-quasi orderings

Mathematics Subject Classification ID

Partial orders, general (06A06) Other combinatorial set theory (03E05)

Related Items

Minimal bad sequences are necessary for a uniform Kruskal theorem ⋮ How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems ⋮ Bachmann-Howard derivatives ⋮ Unnamed Item ⋮ On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders ⋮ An order-theoretic characterization of the Howard-Bachmann-hierarchy ⋮ Ordinal recursive complexity of unordered data nets ⋮ Well-partial-orderings and the big Veblen number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof theory. The first step into impredicativity
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• Proof-theoretic investigations on Kruskal's theorem
• Polynomial functions with exponentiation are well ordered
• Computable linearizations of well-partial-orderings
• Fields of surreal numbers and exponentiation
• Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
• Π12-logic, Part 1: Dilators
• A Uniform Approach to Fundamental Sequences and Hierarchies
• An order‐theoretic characterization of the Schütte‐Veblen‐Hierarchy
• Orderings of monomial ideals
• The complexity of decision procedures in relevance logic II
• Systems of predicative analysis, II: Representations of ordinals
• Two applications of analytic functors