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

Andreas Weiermann
2009 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-642-03073-4_50 fatcat:plh52xlfjbcmfdzcs3qdd7fcrm