Join-closed and meet-closed subsets in complete lattices

František Machala; Vladimír Slezák

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica (2004)

  • Volume: 43, Issue: 1, page 113-117
  • ISSN: 0231-9721

Abstract

top
To every subset A of a complete lattice L we assign subsets J ( A ) , M ( A ) and define join-closed and meet-closed sets in L . Some properties of such sets are proved. Join- and meet-closed sets in power-set lattices are characterized. The connections about join-independent (meet-independent) and join-closed (meet-closed) subsets are also presented in this paper.

How to cite

top

Machala, František, and Slezák, Vladimír. "Join-closed and meet-closed subsets in complete lattices." Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica 43.1 (2004): 113-117. <http://eudml.org/doc/32350>.

@article{Machala2004,
abstract = {To every subset $A$ of a complete lattice $L$ we assign subsets $J(A)$, $M(A)$ and define join-closed and meet-closed sets in $L$. Some properties of such sets are proved. Join- and meet-closed sets in power-set lattices are characterized. The connections about join-independent (meet-independent) and join-closed (meet-closed) subsets are also presented in this paper.},
author = {Machala, František, Slezák, Vladimír},
journal = {Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica},
keywords = {complete lattices; join-closed and meet-closed sets; complete lattice; join-closed set; meet-closed set},
language = {eng},
number = {1},
pages = {113-117},
publisher = {Palacký University Olomouc},
title = {Join-closed and meet-closed subsets in complete lattices},
url = {http://eudml.org/doc/32350},
volume = {43},
year = {2004},
}

TY - JOUR
AU - Machala, František
AU - Slezák, Vladimír
TI - Join-closed and meet-closed subsets in complete lattices
JO - Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
PY - 2004
PB - Palacký University Olomouc
VL - 43
IS - 1
SP - 113
EP - 117
AB - To every subset $A$ of a complete lattice $L$ we assign subsets $J(A)$, $M(A)$ and define join-closed and meet-closed sets in $L$. Some properties of such sets are proved. Join- and meet-closed sets in power-set lattices are characterized. The connections about join-independent (meet-independent) and join-closed (meet-closed) subsets are also presented in this paper.
LA - eng
KW - complete lattices; join-closed and meet-closed sets; complete lattice; join-closed set; meet-closed set
UR - http://eudml.org/doc/32350
ER -

References

top
  1. Crawley P., Dilworth R. P.: Algebraic Theory of Lattices., Englewood Cliffs, , 1973. (1973) 
  2. Czédli G., Huhn A. P., Schmidt E. T., Weakly independent sets in lattices, Algebra Univers. 20 (1985), 194–196. (1985) MR0806613
  3. Dlab V., Lattice formulation of general algebraic dependence, Czech. Math. Journal 20, 95 (1970), 603–615. (1970) Zbl0247.06006MR0268093
  4. Grätzer G.: General Lattice Theory., Birkhäuser Verlag, , 1998. (1998) MR1670580
  5. Machala F., Join-independent and meet-independent sets in complete lattices, Order 18 (2001), 269–274. Zbl1009.06005MR1867237
  6. Machala F., Slezák V., Lattice-inadmissible incidence structures, Discuss. Math. (submitted). Zbl1073.06004
  7. Slezák V., On the special context of independent sets, Discuss. Math., Gen. Algebra and Appl. 21 (2001), 115–122. Zbl0997.06003MR1868622
  8. Szász G.: Introduction to Lattice Theory., Akadémiai Kiadó, , Budapest, 1963. (1963) MR0166118

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.