Partial frames, their free frames and their congruence frames
Anneliese Schauerte, John Frith

TL;DR
This paper explores the structure of partial frames, their free frames, and congruence frames, introducing new concepts and characterizations for their properties, including Booleanness, and analyzing the relationships between different types of congruences.
Contribution
It introduces the notion of partial frames with designated subsets, studies their free and congruence frames, and distinguishes various Booleanness conditions in this context.
Findings
Characterization of partial frames and their axioms.
Analysis of congruence frames and their relation to free frames.
Conditions for isomorphism between congruence frames and free frames.
Abstract
The context of this work is that of partial frames; these are meet-semilattices where not all subsets need have joins. A selection function, S, specifies, for all meet-semilattices, certain subsets under consideration, which we call the ``designated'' ones; an S-frame then must have joins of (at least) all such subsets and binary meet must distribute over these. A small collection of axioms suffices to specify our selection functions; these axioms are sufficiently general to include as examples of partial frames, bounded distributive lattices, sigma-frames, kappa-frames and frames. We consider right and left adjoints of S-frame maps, as a prelude to the introduction of closed and open maps. Then we look at what might be an appropriate notion of Booleanness for partial frames. The obvious candidate is the condition that every element be complemented; this concept is indeed of interest,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Computational Drug Discovery Methods
