Matches in DBpedia 2015-10 for { ?s ?p ""Dedekind completion" redirects here. For some other related concepts, see Dedekind completeness.In order-theoretic mathematics, the Dedekind–MacNeille completion of a partially ordered set (also called the completion by cuts or normal completion) is the smallest complete lattice that contains the given partial order. 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."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Dedekind–MacNeille_completion abstract ""Dedekind completion" redirects here. For some other related concepts, see Dedekind completeness.In order-theoretic mathematics, the Dedekind–MacNeille completion of a partially ordered set (also called the completion by cuts or normal completion) is the smallest complete lattice that contains the given partial order. 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.".