Related papers: Universal Proof Theory: Semi-analytic Rules and Cr…
The logic of bunched implications (BI) is a substructural logic that forms the backbone of separation logic, the much studied logic for reasoning about heap-manipulating programs. Although the proof theory and metatheory of BI are…
We say that a logic L has the Lyndon positivity property (LPP) if all formulas which are monotone in L (that is, are preserved under increasing the valuation on L-algebras) are L-equivalent to positive formulas (formulas without negation…
Let $A$ be a separable simple exact ${\cal Z}$-stable $C^*$-algebra. We show that the unitay group of ${\tilde A}$ has the cancellation property. If $A$ has continuous scale, the Cuntz semigroup of $\tilde A$ has the strict comparison…
In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce a set of logical connectives allowing us to extend the correspondence between cographs and classical propositional formulas to any…
The present work aims to give a unity of logic via standard sequential, unpolarized games. Specifically, our vision is that there must be mathematically precise concepts of linear refinement and intuitionistic restriction of logic such that…
Recall that a triangular Hopf algebra A is said to have the Chevalley property if the tensor product of any two simple A-modules is semisimple, or, equivalently, if the radical of A is a Hopf ideal. There are two reasons to study this class…
By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…
In this chapter we give a basic overview of known results regarding Craig interpolation for first-order logic as well as for fragments of first-order logic. Our aim is to provide an entry point into the literature on interpolation theorems…
We show that if the graph of a bounded analytic function in the unit disk $\mathbb D$ is not complete pluripolar in $\mathbb C^2$ then the projection of the closure of its pluripolar hull contains a fine neighborhood of a point $p \in…
In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication. In logics with the projective Beth definability property (PBDP), the existence of an…
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 consider continuous relational structures with finite domain $[n] := \{1, \ldots, n\}$ and a many valued logic, $CLA$, with values in the unit interval and which uses continuous connectives and continuous aggregation functions. $CLA$…
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…
We prove that a graph C*-algebra with exactly one proper nontrivial ideal is classified up to stable isomorphism by its associated six-term exact sequence in K-theory. We prove that a similar classification also holds for a graph C*-algebra…
Let $\CaC\subset \Q^p$ be a rational cone. An affine semigroup $S\subset \CaC$ is a $\CaC$-semigroup whenever $(\CaC\setminus S)\cap \N^p$ has only a finite number of elements. In this work, we study the tree of $\CaC$-semigroups, give a…
We explore a proof language for intuitionistic multiplicative additive linear logic, incorporating the sup connective that introduces additive pairs with a probabilistic elimination, and sum and scalar products within the proof-terms. We…
We introduce a new categorical and constructive foundation for analytic approximation based on a Contextual Choice Principle (CCP), which enforces locality and compatibility in the construction of mathematical objects. Central to our…
We present a typing system with non-idempotent intersection types, typing a term syntax covering three different calculi: the pure {\lambda}-calculus, the calculus with explicit substitutions {\lambda}S, and the calculus with explicit…
Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms: constant degree semi-algebraic proofs lead to conjecturally optimal polynomial-time…
Nonlinear interpolants have been shown useful for the verification of programs and hybrid systems in contexts of theorem proving, model checking, abstract interpretation, etc. The underlying synthesis problem, however, is challenging and…