A special class of congruences on -frames
From MaRDI portal
Publication:2411684
Abstract: Madden has shown that in contrast to the situation with frames, the smallest dense quotient of a -frame need not be Boolean. We characterise these so-called d-reduced -frames as those which may be embedded as a generating sub--frame of a Boolean frame. We introduce the notion of the closure of a -frame congruence and call a congruence clear if it is the largest congruence with a given closure. These ideas are used to prove -frame analogues of known results concerning Boolean frame quotients. In particular, we show that d-reduced -frames are precisely the quotients of -frames by clear congruences and that every -frame congruence is the meet of clear congruences.
Recommendations
Cites work
Cited in
(7)- The Booleanization of a d-frame
- Variants of Booleanness: congruences of a partial frame versus those of its free frame
- Closed and open maps for partial frames
- An asymmetric characterization of the congruence frame
- The congruence frame and the Madden quotient for partial frames
- A look at the structure of congruence frames by means of Heyting congruences
- Strictly zero-dimensional biframes and a characterisation of congruence frames
This page was built for publication: A special class of congruences on \(\kappa\)-frames
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2411684)