Dedekind–MacNeille completion
Smallest complete lattice containing a partial order / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Glivenko–Stone theorem?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In mathematics, specifically order theory, the Dedekind–MacNeille completion of a partially ordered set is the smallest complete lattice that contains it. It is named after Holbrook Mann MacNeille whose 1937 paper first defined and constructed it, and after Richard Dedekind because its construction generalizes the Dedekind cuts used by Dedekind to construct the real numbers from the rational numbers. It is also called the completion by cuts or normal completion.[1]
"Dedekind completion" redirects here. For some other related concepts, see Dedekind completeness.