Characterization of closed upper sets in the MacNeille completion of the free monoid
Let be a well-founded conditional lattice, and let be an upper set of the free monoid . The MacNeille completion identifies closed upper sets with upper sets satisfying four specified rules.
Closed-upper-set characterization. An upper set of is closed if and only if it satisfies the four rules.
This gives a syntactic characterization of the closed upper sets in the MacNeille completion of . The supplied text does not state whether this result is conjectural or has been proved; the surrounding discussion presents related results as consequences of a theorem, so the status should be checked against the paper.
References
Primary source
Hans-Jürgen Bandelt and Maurice Pouzet, “A syntactic approach to the MacNeille completion of Λ^, the free monoid over an ordered alphabet Λ”, arXiv:1712.08516 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.