763 research outputs found
Full completeness of the multiplicative linear logic of Chu spaces
We prove full completeness of multiplicative linear logic
(MLL) without MIX under the Chu interpretation. In particular
we show that the cut-free proofs of MLL theorems
are in a natural bijection with the binary logical transformations
of the corresponding operations on the category of
Chu spaces on a two-letter alphabet
Constructing Fully Complete Models of Multiplicative Linear Logic
The multiplicative fragment of Linear Logic is the formal system in this
family with the best understood proof theory, and the categorical models which
best capture this theory are the fully complete ones. We demonstrate how the
Hyland-Tan double glueing construction produces such categories, either with or
without units, when applied to any of a large family of degenerate models. This
process explains as special cases a number of such models from the literature.
In order to achieve this result, we develop a tensor calculus for compact
closed categories with finite biproducts. We show how the combinatorial
properties required for a fully complete model are obtained by this glueing
construction adding to the structure already available from the original
category.Comment: 72 pages. An extended abstract of this work appeared in the
proceedings of LICS 201
Big Toy Models: Representing Physical Systems As Chu Spaces
We pursue a model-oriented rather than axiomatic approach to the foundations
of Quantum Mechanics, with the idea that new models can often suggest new
axioms. This approach has often been fruitful in Logic and Theoretical Computer
Science. Rather than seeking to construct a simplified toy model, we aim for a
`big toy model', in which both quantum and classical systems can be faithfully
represented - as well as, possibly, more exotic kinds of systems.
To this end, we show how Chu spaces can be used to represent physical systems
of various kinds. In particular, we show how quantum systems can be represented
as Chu spaces over the unit interval in such a way that the Chu morphisms
correspond exactly to the physically meaningful symmetries of the systems - the
unitaries and antiunitaries. In this way we obtain a full and faithful functor
from the groupoid of Hilbert spaces and their symmetries to Chu spaces. We also
consider whether it is possible to use a finite value set rather than the unit
interval; we show that three values suffice, while the two standard
possibilistic reductions to two values both fail to preserve fullness.Comment: 24 pages. Accepted for Synthese 16th April 2010. Published online
20th April 201
Glueing and Orthogonality for Models of Linear Logic
We present the general theory of the method of glueing and associated technique of orthogonality for constructing categorical models of all the structure of linear logic: in particular we treat the exponentials in detail. We indicate simple applications of the methods and show that they cover familiar examples.
Bifinite Chu Spaces
This paper studies colimits of sequences of finite Chu spaces and their
ramifications. Besides generic Chu spaces, we consider extensional and
biextensional variants. In the corresponding categories we first characterize
the monics and then the existence (or the lack thereof) of the desired
colimits. In each case, we provide a characterization of the finite objects in
terms of monomorphisms/injections. Bifinite Chu spaces are then expressed with
respect to the monics of generic Chu spaces, and universal, homogeneous Chu
spaces are shown to exist in this category. Unanticipated results driving this
development include the fact that while for generic Chu spaces monics consist
of an injective first and a surjective second component, in the extensional and
biextensional cases the surjectivity requirement can be dropped. Furthermore,
the desired colimits are only guaranteed to exist in the extensional case.
Finally, not all finite Chu spaces (considered set-theoretically) are finite
objects in their categories. This study opens up opportunities for further
investigations into recursively defined Chu spaces, as well as constructive
models of linear logic
Linear logic for constructive mathematics
We show that numerous distinctive concepts of constructive mathematics arise
automatically from an interpretation of "linear higher-order logic" into
intuitionistic higher-order logic via a Chu construction. This includes
apartness relations, complemented subsets, anti-subgroups and anti-ideals,
strict and non-strict order pairs, cut-valued metrics, and apartness spaces. We
also explain the constructive bifurcation of classical concepts using the
choice between multiplicative and additive linear connectives. Linear logic
thus systematically "constructivizes" classical definitions and deals
automatically with the resulting bookkeeping, and could potentially be used
directly as a basis for constructive mathematics in place of intuitionistic
logic.Comment: 39 page
Sequentiality vs. Concurrency in Games and Logic
Connections between the sequentiality/concurrency distinction and the
semantics of proofs are investigated, with particular reference to games and
Linear Logic.Comment: 35 pages, appeared in Mathematical Structures in Computer Scienc
From Proof Nets to the Free *-Autonomous Category
In the first part of this paper we present a theory of proof nets for full
multiplicative linear logic, including the two units. It naturally extends the
well-known theory of unit-free multiplicative proof nets. A linking is no
longer a set of axiom links but a tree in which the axiom links are subtrees.
These trees will be identified according to an equivalence relation based on a
simple form of graph rewriting. We show the standard results of
sequentialization and strong normalization of cut elimination. In the second
part of the paper we show that the identifications enforced on proofs are such
that the class of two-conclusion proof nets defines the free *-autonomous
category.Comment: LaTeX, 44 pages, final version for LMCS; v2: updated bibliograph
- âŚ