6,844 research outputs found
On lattices of convex sets in R^n
Properties of several sorts of lattices of convex subsets of R^n are
examined. The lattice of convex sets containing the origin turns out, for n>1,
to satisfy a set of identities strictly between those of the lattice of all
convex subsets of R^n and the lattice of all convex subsets of R^{n-1}. The
lattices of arbitrary, of open bounded, and of compact convex sets in R^n all
satisfy the same identities, but the last of these is join-semidistributive,
while for n>1 the first two are not. The lattice of relatively convex subsets
of a fixed set S \subseteq R^n satisfies some, but in general not all of the
identities of the lattice of ``genuine'' convex subsets of R^n.Comment: 35 pages, to appear in Algebra Universalis, Ivan Rival memorial
issue. See also http://math.berkeley.edu/~gbergman/paper
Operational resolutions and state transitions in a categorical setting
We define a category with as objects operational resolutions and with as
morphisms - not necessarily deterministic - state transitions. We study
connections with closure spaces and join-complete lattices and sketch physical
applications related to evolution and compoundness. An appendix with
preliminaries on quantaloids is included.Comment: 21 page
A Categorical View on Algebraic Lattices in Formal Concept Analysis
Formal concept analysis has grown from a new branch of the mathematical field
of lattice theory to a widely recognized tool in Computer Science and
elsewhere. In order to fully benefit from this theory, we believe that it can
be enriched with notions such as approximation by computation or
representability. The latter are commonly studied in denotational semantics and
domain theory and captured most prominently by the notion of algebraicity, e.g.
of lattices. In this paper, we explore the notion of algebraicity in formal
concept analysis from a category-theoretical perspective. To this end, we build
on the the notion of approximable concept with a suitable category and show
that the latter is equivalent to the category of algebraic lattices. At the
same time, the paper provides a relatively comprehensive account of the
representation theory of algebraic lattices in the framework of Stone duality,
relating well-known structures such as Scott information systems with further
formalisms from logic, topology, domains and lattice theory.Comment: 36 page
Priestley duality for MV-algebras and beyond
We provide a new perspective on extended Priestley duality for a large class
of distributive lattices equipped with binary double quasioperators. Under this
approach, non-lattice binary operations are each presented as a pair of partial
binary operations on dual spaces. In this enriched environment, equational
conditions on the algebraic side of the duality may more often be rendered as
first-order conditions on dual spaces. In particular, we specialize our general
results to the variety of MV-algebras, obtaining a duality for these in which
the equations axiomatizing MV-algebras are dualized as first-order conditions
- …