Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03204450n
Noun Concept
Categories: Closure operators, Lattice theory
EN
complete lattice  complete free lattice  Complete homomorphism  Complete lattice homomorphism  complete lattices
EN
In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum and an infimum. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum and an infimum. Wikipedia
Partially ordered set in which all subsets have both a supremum and infimum Wikidata
A partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Wiktionary
Partially ordered set. Wiktionary (translation)
IS A
partially ordered set
lattice
HAS KIND
complete Heyting algebra
quantale
completely distributive lattice
Dedekind–MacNeille completion
STUDIED BY
category theory
Wikipedia
EN
complete lattice
Wikidata
EN
complete lattice
Wiktionary
EN
complete lattice
Wikipedia Redirections
EN
complete free lattice, Complete homomorphism, Complete lattice homomorphism, complete lattices, Locally finite complete lattice

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License