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

Authors:
Andreas Weiermann
Affiliations:
Vakgroep Zuivere Wiskunde en Computeralgebra, University of Ghent, Ghent, Belgium 9000
Venue:
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Year:
2009

Citing 3
Cited 2

Rewrite systems

Handbook of theoretical computer science (vol. B)
Two applications of analytic functors

Theoretical Computer Science - Special issue on theories of types and proofs
Proving Termination for Term Rewriting Systems

CSL '91 Proceedings of the 5th Workshop on Computer Science Logic

Ordinal theory for expressiveness of well structured transition systems

FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Ordinal theory for expressiveness of well-structured transition systems

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a sharpening of a recent result of Aschenbrenner and Pong about the maximal order type of the term ordering on the finite multisets over a wpo. Moreover we discuss an approach to compute maximal order types of well-partial orders which are related to tree embeddings.