Related papers: Explorations in Subexponential Non-associative Non…
The extended de Finetti theorem characterizes exchangeable infinite random sequences as conditionally i.i.d. and shows that the apparently weaker distributional symmetry of spreadability is equivalent to exchangeability. Our main result is…
A cyclic proof system gives us another way of representing inductive definitions and efficient proof search. In 2011 Brotherston and Simpson conjectured the equivalence between the provability of the classical cyclic proof system and that…
We extend the main result of (G. Badia and G. Olkhovikov. A Lindstr\"om theorem for intuitionistic propositional logic. Notre Dame Journal of Formal Logic, 61 (1): 11--30 (2020)) to the first-order intuitionistic logic (with and without…
We describe a natural deduction formalization of intuitionistic and classical propositional logic in the Isabelle/Pure framework. In contrast to earlier work, where we explored the pedagogical benefits of using a deep embedding approach to…
We introduce labelled sequent calculi for the basic normal non-distributive modal logic L and 31 of its axiomatic extensions, where the labels are atomic formulas of a first order language which is interpreted on the canonical extensions of…
In their seminal paper Artemov and Protopopescu provide Hilbert formal systems, Brower-Heyting-Kolmogorov and Kripke semantics for the logics of intuitionistic belief and knowledge. Subsequently Krupski has proved that the logic of…
We introduce the new notion of epsilon-graded associative algebras which takes its root into the notion of commutation factors introduced in the context of Lie algebras. We define and study the associated notion of epsilon-derivation-based…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
We continue our exploration of various approaches to integration of representations from a Lie algebra $\mbox{Lie} (G)$ to an algebraic group $G$ in positive characteristic. In the present paper we concentrate on an approach exploiting…
Differential Linear Logic enriches Linear Logic with additional logical rules for the exponential connectives, dual to the usual rules of dereliction, weakening and contraction. We present a proof-net syntax for Differential Linear Logic…
Multiphysics problems involving two or more coupled physical phenomena are ubiquitous in science and engineering. This work develops a new partitioned exponential approach for the time integration of multiphysics problems. After a possible…
Inquisitive modal logic InqML is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they…
Lie-Poisson gauge formalism provides a semiclassical description of noncommutative $U(1)$ gauge theory with Lie algebra type noncommutativity. Using the Dirac approach to constrained Hamiltonian systems, we focus on a class of Lie-Poisson…
Non-normal modal logics, interpreted on neighbourhood models which generalise the usual relational semantics, have found application in several areas, such as epistemic, deontic, and coalitional reasoning. We present here preliminary…
Pomset logic introduced by Retor\'e is an extension of linear logic with a self-dual noncommutative connective. The logic is defined by means of proof-nets, rather than a sequent calculus. Later a deep inference system BV was developed with…
Ordered logics and type systems have been used in a variety of applications including computational linguistics, memory allocation, stream processing, logical frameworks, parametricity, and enforcing security protocols. In most…
The development of compositional distributional models of semantics reconciling the empirical aspects of distributional semantics with the compositional aspects of formal semantics is a popular topic in the contemporary literature. This…
We present a polymorphic linear lambda-calculus as a proof language for second-order intuitionistic linear logic. The calculus includes addition and scalar multiplication, enabling the proof of a linearity result at the syntactic level.
We present a uniform characterisation of three-valued logics by means of the bisequent calculus (BSC). It is a generalised form of a sequent calculus (SC) where rules operate on the ordered pairs of ordinary sequents. BSC may be treated as…
The multimodal Lambek calculus is an extension of the Lambek calculus that includes several product operations (some of them being commutative or/and associative), unary modalities, and corresponding residual implications. In this work, we…