The completion of a poset in a lattice of antichains (Q2730725)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The completion of a poset in a lattice of antichains |
scientific article; zbMATH DE number 1624917
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The completion of a poset in a lattice of antichains |
scientific article; zbMATH DE number 1624917 |
Statements
30 January 2002
0 references
poset
0 references
antichain
0 references
order ideal completion
0 references
Dedekind-MacNeille completion
0 references
role-based access control
0 references
The completion of a poset in a lattice of antichains (English)
0 references
For a poset \(P\), a natural partial order on the set of all antichains of \(P\) is defined. It is proven that the set of all antichains of \(P\) with this partial order is a lattice completion of \(P\) isomorphic to the order-ideal completion. The Dedekind-MacNeille completion of \(P\) is also described in the language of antichains. The applications of a completion of posets in role-based access control (it is used for security in computer science) and in modelling of conflicts of interest policies are discussed.
0 references
