A syntactic approach to the MacNeille completion of \(\Lambda^\ast\), the free monoid over an ordered alphabet \(\Lambda\)

DOI10.1007/s11083-018-9462-7zbMath1441.06002arXiv1712.08516MaRDI QIDQ2314419

Maurice Pouzet, Hans-Jürgen Bandelt

Publication date: 22 July 2019

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.08516

zbMATH Keywords

MacNeille completion; free monoid; well-quasiorder

Mathematics Subject Classification ID

06A06: Partial orders, general

20M05: Free semigroups, generators and relations, word problems

06A07: Combinatorics of partially ordered sets

06B23: Complete lattices, completions

06F05: Ordered semigroups and monoids