Free lattices over join-trivial partial lattices (Q583251): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Jaroslav Jezek / rank | |||
Property / author | |||
Property / author: Václav Slavík / rank | |||
Property / author | |||
Property / author: Jaroslav Jezek / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Václav Slavík / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Free Lattices Generated by Partially Ordered Sets and Preserving Bounds / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3875978 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01190250 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2036144757 / rank | |||
Normal rank |
Latest revision as of 09:09, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Free lattices over join-trivial partial lattices |
scientific article |
Statements
Free lattices over join-trivial partial lattices (English)
0 references
1990
0 references
Up to now, there are only partial answers to the problem of describing all finite partial lattices P for which the free lattice over P is finite. In this paper the authors give a set of four conditions which together are necessary and sufficient for the free lattice over a finite join-trivial partial lattice to be finite. (The expression join-trivial means that if the join of two elements is defined then these two elements are comparable.)
0 references
finiteness
0 references
free lattice
0 references
finite join-trivial partial lattice
0 references