Related papers: Constructing Fully Complete Models of Multiplicati…
The categorified theories known as "doctrines" specify a category equipped with extra structure, analogous to how ordinary theories specify a set with extra structure. We introduce a new framework for doctrines based on double category…
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
We study modal team logic MTL, the team-semantical extension of modal logic ML closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion logic, are well-understood. However, due to the unrestricted…
We consider a compact orientable hyperbolic 3-manifold with a compressible boundary. Suppose that we are given a sequence of geometrically finite hyperbolic metrics whose conformal boundary structures at infinity diverge to a projective…
From the interpretation of Linear Logic multiplicative disjunction as the $\varepsilon$-product defined by Laurent Schwartz, we construct several models of Differential Linear Logic based on usual mathematical notions of smooth maps. This…
We show that in Grayson's model of higher algebraic $K$-theory using binary acyclic complexes, the complexes of length two suffice to generate the whole group. Moreover, we prove that the comparison map from Nenashev's model for $K_1$ to…
A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…
In this paper, we define a multi-type calculus for inquisitive logic, which is sound, complete and enjoys Belnap-style cut-elimination and subformula property. Inquisitive logic is the logic of inquisitive semantics, a semantic framework…
We present a constructive proof of Ky Fan's combinatorial lemma concerning labellings of triangulated spheres. Our construction works for triangulations of $S^n$ that contain a flag of hemispheres. As a consequence, we produce a…
Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…
We investigate the possibility of extending the non-functionally complete logic of a collection of Boolean connectives by the addition of further Boolean connectives that make the resulting set of connectives functionally complete. More…
We introduce a proper multi-type display calculus for bilattice logic (with conflation) for which we prove soundness, completeness, conservativity, standard subformula property and cut-elimination. Our proposal builds on the product…
We present a process semantics for the purely additive fragment of linear logic in which formulas denote protocols and (equivalence classes of) proofs denote multi-channel concurrent processes. The polycategorical model induced by this…
This work proves that the process of gluing finite lattices to form a larger lattice is bijective, that is each lattice is the glued sum of a unique system of finite lattices, provided the class of lattices is constrained to modular,…
We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…
We exhibit a uniform method for obtaining (wellfounded and non-wellfounded) cut-free sequent-style proof systems that are sound and complete for various classes of action algebras, i.e., Kleene algebras enriched with meets and residuals.…
This paper tackles the problem of formulating and proving the completeness of focused-like proof systems in an automated fashion. Focusing is a discipline on proofs which structures them into phases in order to reduce proof search…
We define fully exact module categories, a subclass of exact module categories over a finite braided tensor category that is stable under the relative Deligne product. In contrast, we demonstrate with examples in both zero and non-zero…
Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…
Given a fixed tensor triangulated category S we consider triangulated categories T together with an S-enrichment which is compatible with the triangulated structure of T. It is shown that, in this setting, an enriched analogue of Brown…