Matches in DBpedia 2016-04 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."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Dedekind–MacNeille_completion comment "\"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.".