A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 488-498
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Proving termination for term rewriting systems2005
- Orderings of monomial idealsFundamenta Mathematicae, 2004
- The complexity of decision procedures in relevance logic IIThe Journal of Symbolic Logic, 1999
- A Uniform Approach to Fundamental Sequences and HierarchiesMathematical Logic Quarterly, 1994
- Proof-theoretic investigations on Kruskal's theoremAnnals of Pure and Applied Logic, 1993
- An order‐theoretic characterization of the Schütte‐Veblen‐HierarchyMathematical Logic Quarterly, 1993
- What's so special about Kruskal's theorem and the ordinal Γo? A survey of some results in proof theoryAnnals of Pure and Applied Logic, 1991
- Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen ZahlenArchive for Mathematical Logic, 1985
- Π12-logic, Part 1: DilatorsAnnals of Mathematical Logic, 1981
- Systems of predicative analysis, II: Representations of ordinalsThe Journal of Symbolic Logic, 1968