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.08516OpenAlexW2810888652MaRDI 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 completionfree monoidwell-quasiorder

Mathematics Subject Classification ID

Partial orders, general (06A06) Free semigroups, generators and relations, word problems (20M05) Combinatorics of partially ordered sets (06A07) Complete lattices, completions (06B23) Ordered semigroups and monoids (06F05)

Related Items (1)

A fixed point theorem for commuting families of relational homomorphisms. Applications to metric spaces, ordered sets and oriented graphs

Cites Work

• An application of the Helly property to the partially ordered sets
• General metrics and contracting operations
• Injective envelope of graphs and transition systems
• The smallest graph variety containing all paths
• Free monoids and generalized metric spaces
• Une extension d'un théorème de P. Jullien sur les âges de mots
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A syntactic approach to the MacNeille completion of \(\Lambda^\ast\), the free monoid over an ordered alphabet \(\Lambda\)