Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T22:30:57.900Z Has data issue: false hasContentIssue false

The k-Normal Completion of Function Lattices

Published online by Cambridge University Press:  20 November 2018

Henry B. Cohen*
Affiliation:
University of Pittsburgh
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A subset G of a non-empty partially ordered set C is called normal if it coincides with the set of all upper bounds of the set of lower bounds of G. This is equivalent to stipulating that G be the set of all upper bounds of some subset of C called a set of generators for G. When ordered by inclusion, the family of all normal subsets of C forms a complete lattice with maximum C and minimum empty or singleton. The meet operation is simply point set intersection; whence, the meet of a family Gi of normal subsets is the set of upper bounds of ∪ Fi where Fi generates Gi for each i. A normal subset is called proper if it is neither void nor C, and the proper normal subsets. of C form a boundedly complete lattice.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1965