No label defined (Q4464692)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2068083
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2068083 |
Statements
27 May 2004
0 references
category
0 references
adjoint relations
0 references
ordered set
0 references
lattice
0 references
Boolean algebra
0 references
Heyting algebra
0 references
0 references
0 references
This is partially a brief survey of known results in the study of ordered sets via adjunctions. For ungraduate students, much of the material in \textit{F. W. Lawvere} and \textit{R. Rosebrugh}'s book [Sets for mathematics. Cambridge: Cambridge Univ. Press (2003; Zbl 1031.18001) is a serious prerequisite for this chapter, which is organized as follows: In Section 1 the author provides some preliminaries that allow us to build ordered set theory from the bicategory of relations in \textbf{Set}. In fact he defines adjunctions therein, and shows that from these we can recover functions. In Section 2, ordered sets, the bicategory of ordered sets, and adjunctions therein are formally defined, and some important examples are provided. The adjunctions are put to work in Section 3 to describe semilattices, lattices and a few of their specializations. So as to discuss complete lattices in these terms in Section 5, Section 4 addresses power set Heyting algebras. Section 6 is a brief introduction to the author's own work on completely distributive lattices, developed jointly with a number of coauthors, most notably Rosebrugh. It is here that the approach to ordered sets via adjunction seems to add the greatest clarity to the subject to date. For the entire collection see [Zbl 1034.18001].
0 references