Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00772357n
Noun Concept
Categories: Order theory
EN
strong antichain
EN
In order theory, a subset A of a partially ordered set P is a strong downwards antichain if it is an antichain in which no two distinct elements have a common lower bound in P, that is, ∀ x, y ∈ A [ x ≠ y → ¬ ∃ z ∈ P [ z ≤ x ∧ z ≤ y ] ]. Wikipedia
Definitions
Sources
EN
In order theory, a subset A of a partially ordered set P is a strong downwards antichain if it is an antichain in which no two distinct elements have a common lower bound in P, that is, ∀ x, y ∈ A [ x ≠ y → ¬ ∃ z ∈ P [ z ≤ x ∧ z ≤ y ] ]. Wikipedia
Wikipedia
EN
strong antichain
Wikidata
EN
Strong antichain
Wikipedia Redirections
EN
Strong Antichain

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