30,049 research outputs found
Between quantum logic and concurrency
We start from two closure operators defined on the elements of a special kind
of partially ordered sets, called causal nets. Causal nets are used to model
histories of concurrent processes, recording occurrences of local states and of
events. If every maximal chain (line) of such a partially ordered set meets
every maximal antichain (cut), then the two closure operators coincide, and
generate a complete orthomodular lattice. In this paper we recall that, for any
closed set in this lattice, every line meets either it or its orthocomplement
in the lattice, and show that to any line, a two-valued state on the lattice
can be associated. Starting from this result, we delineate a logical language
whose formulas are interpreted over closed sets of a causal net, where every
line induces an assignment of truth values to formulas. The resulting logic is
non-classical; we show that maximal antichains in a causal net are associated
to Boolean (hence "classical") substructures of the overall quantum logic.Comment: In Proceedings QPL 2012, arXiv:1407.842
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
On the lattice structure of probability spaces in quantum mechanics
Let C be the set of all possible quantum states. We study the convex subsets
of C with attention focused on the lattice theoretical structure of these
convex subsets and, as a result, find a framework capable of unifying several
aspects of quantum mechanics, including entanglement and Jaynes' Max-Ent
principle. We also encounter links with entanglement witnesses, which leads to
a new separability criteria expressed in lattice language. We also provide an
extension of a separability criteria based on convex polytopes to the infinite
dimensional case and show that it reveals interesting facets concerning the
geometrical structure of the convex subsets. It is seen that the above
mentioned framework is also capable of generalization to any statistical theory
via the so-called convex operational models' approach. In particular, we show
how to extend the geometrical structure underlying entanglement to any
statistical model, an extension which may be useful for studying correlations
in different generalizations of quantum mechanics.Comment: arXiv admin note: substantial text overlap with arXiv:1008.416
- …