A computation of the maximal order type of the term ordering on finite multisets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5635 LNCS, Issue , 2009, Pages 488-498

  Weiermann, Andreas ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

Finite multisets; Maximal order types; Ordinals; Term orderings; Well partial orderings; Well quasi orderings

Indexed keywords

FINITE MULTISETS; MAXIMAL ORDER TYPES; MULTI-SETS; ORDER TYPES; PARTIAL ORDERING; QUASI-ORDERING;

COMPUTATION THEORY;

EID: 76249110810     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03073-4_50     Document Type: Conference Paper

References (22)

1. Aschenbrenner, M., Pong, W.Y.: Orderings of monomial ideals. Fund. Math. 181(1), 27-74 (2004)
2. Becker, T., Weispfenning, V.: Gröbner bases. A computational approach to commutative algebra. In: Cooperation with Heinz Kredel. Graduate Texts in Mathematics, vol. 141. Springer, New York (1993)
3. Buchholz, W., Cichon, E.A., Weiermann, A.: A uniform approach to fundamental sequences and hierarchies. Math. Logic Quart. 40(2), 273-286 (1994)
4. De Jongh, D.H.J., Parikh, R.R.: Well-partial orderings and hierarchies. Nederl. Akad. Wetensch. Proc. Ser. A 80=Indag. Math. 39(3), 195-207 (1977)
5. Van den Dries, L., Ehrlich, P.: Fields of surreal numbers an exponentiation. Fund. Math. 168(2), 173-188 (2001);
6. Erratum to [5] in Fund. Math. 167(3), 295-297 (2001)
7. Dershowitz, N.N., Jouannaud, J.P.: Rewrite systems. In: Handbook of Theoretical Computer Science, Part B, pp. 243-320. Elsevier, Amsterdam (1990)
8. Ehrenfeucht, A.: Polynomial functions with exponentiation are well-ordered. Algebra Universalis 3, 261-262 (1973)
9. Feferman, S.: Systems of predicative analysis. II. Representations of ordinals. J. Symbolic Logic 33, 193-220 (1968)
10. 0? A survey of some results in proof theory. Annals of Pure and Applied Logic 53, 199-260 (1991)
11. 1-logic. I. Dilators. Ann. Math. Logic 21(2-3), 75-219 (1981)
12. Hasegawa, R.: Two applications of analytic functors. Theories of types and proofs (Tokyo, 1997). Theoret. Comput. Sci. 272(1-2), 113-175 (2002)
13. Montalbán, A.: Computable linearizations of well-partial- orderings. Order 24(1), 39-48 (2007)
14. Rathjen, M., Weiermann, A.: Proof-theoretic investigations on Kruskal's theorem. Annals of Pure and Applied Logic 60, 49-88 (1993)
15. Pohlers, W.: Proof Theory. The first step into Impredicativity. Springer, Berlin (2009)
16. Schmidt, D.: Well-Partial Orderings and Their Maximal Order Types. Habilita-tionsschrift, Heidelberg (1979)
17. Schütte, K., Simpson, S.G.: Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen. Archiv für mathematische Logik und Grundlagenforschung 25, 75-89 (1985)
18. Simpson, S.G.: Nonprovability of certain combinatorial properties of finite trees. In: Harvey Friedman's research on the foundations of mathematics. Stud. Logic Found. Math., vol. 117, pp. 87-117. North-Holland, Amsterdam (1985)
19. Urquhart, A.: The complexity of decision procedures in relevance logic. II. J. Symbolic Logic 64(4), 1774-1802 (1999)
20. Weiermann, A.: Proving termination for term rewriting systems. In: Kleine Büning, H., Jäger, G., Börger, E., Richter, M.M. (eds.) CSL 1991. LNCS, vol. 626, pp. 419-428. Springer, Heidelberg (1992)
21. Weiermann, A.: An order-theoretic characterization of the Schütte-Veblen-hierarchy. Math. Logic Quart. 39(3), 367-383 (1993)
22. Weiermann, A.: Well partial orderings and their strengths measured in maximal order types. In: Summary of a talk given at the conference on computability, reverse mathematics and combinatorics in Banff (2008)