English
Related papers

Related papers: Type Isomorphisms for Multiplicative-Additive Line…

200 papers

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…

Logic in Computer Science · Computer Science 2016-04-05 Sabine Frittella , Giuseppe Greco , Alessandra Palmigiano , Fan Yang

We identify multirole logic as a new form of logic in which conjunction/disjunction is interpreted as an ultrafilter on the power set of some underlying set (of roles) and the notion of negation is generalized to endomorphisms on this…

Logic · Mathematics 2017-03-21 Hongwei Xi , Hanwen Wu

We adapt methods coming from additive combinatorics in groups to the study of linear span in associative unital algebras. In particular, we establish for these algebras analogues of Diderrich-Kneser's and Hamidoune's theorems on sumsets and…

Combinatorics · Mathematics 2015-06-24 Vincent Beck , Cédric Lecouvey

We describe a categorical model of MALL (Multiplicative Additive Linear Logic) inspired by the Heisenberg-Schr\"odinger duality of finite-dimensional quantum theory. Proofs of formulas with positive logical polarity correspond to CPTP…

Category Theory · Mathematics 2026-01-23 Thea Li , Vladimir Zamdzhiev

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…

Category Theory · Mathematics 2010-03-03 C. A. Pastro

We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent…

Logic in Computer Science · Computer Science 2014-01-08 Alejandro Díaz-Caro , Giulio Manzonetto , Michele Pagani

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

Logic · Mathematics 2016-09-06 Alan H. Mekler , Saharon Shelah

There are two main results. The first states that isotropy subgroups of groups acting transitively on a rationally hyperbolic spaces have infinitely generated rational cohomology algebra. Using this fact, we prove that the analogous…

Algebraic Topology · Mathematics 2007-05-23 Jarek Kedra

Differential Linear Logic (DiLL) is a sequent calculus that expresses differentiation via symmetries between linear and non-linear formulas. In this paper, we express categorical models of DiLL as a pair of Grothendieck fibrations equipped…

Logic in Computer Science · Computer Science 2026-05-11 Jad Koleilat

We prove 2-categorical conservativity for any {0,T}-free fragment of MALL over its corresponding intuitionistic version: that is, that the universal map from a closed symmetric monoidal category to the *-autonomous category that it freely…

Category Theory · Mathematics 2022-01-03 Michael Shulman

We study an extension of the Distributive Full Non-associative Lambek Calculus with iterative division operators. The iterative operators can be seen as representing iterative composition of linguistic resources or of actions. A complete…

Logic in Computer Science · Computer Science 2019-10-28 Igor Sedlár

Consider a finite-dimensional algebra $A$ and any of its moduli spaces $\mathcal{M}(A,\mathbf{d})^{ss}_{\theta}$ of representations. We prove a decomposition theorem which relates any irreducible component of…

Representation Theory · Mathematics 2018-09-25 Calin Chindris , Ryan Kinser

The use of meta-rules in logic, i.e., rules whose content includes other rules, has recently gained attention in the setting of non-monotonic reasoning: a first logical formalisation and efficient algorithms to compute the (meta)-extensions…

Artificial Intelligence · Computer Science 2022-09-27 Francesco Olivieri , Guido Governatori , Matteo Cristani , Antonino Rotolo , Abdul Sattar

Given a local Haag-Kastler net of von Neumann algebras and one of its scaling limit states, we introduce a variant of the notion of asymptotic morphism by Connes and Higson, and we show that the unitary equivalence classes of (localized)…

Mathematical Physics · Physics 2015-10-20 Roberto Conti , Gerardo Morsella

In this paper we study a notion of HL-extension (HL standing for Herwig--Lascar) for a structure in a finite relational language $\mathcal{L}$. We give a description of all finite minimal HL-extensions of a given finite…

Logic · Mathematics 2020-07-22 Mahmood Etedadialiabadi , Su Gao

Product logic is one of the main fuzzy logics arising from a continuous t-norm, and its equivalent algebraic semantics is the variety of product algebras. In this contribution, we study maximal filters of product algebras, and their…

Logic · Mathematics 2023-08-28 Valeria Giustarini , Sara Ugolini

We consider a category whose morphisms are bordisms of $n$-dimensional pseudomanifolds equipped with a certain additional structure (coloring). On the other hand, we consider the product $G$ of $(n+1)$ copies of infinite symmetric group. We…

Representation Theory · Mathematics 2018-12-14 Alexander A. Gaifullin , Yury A. Neretin

We considers how a particular kind of graph corresponds to multiplicative intuitionistic linear logic formula. The main feature of the graphical notation is that it absorbs certain symmetries between conjunction and implication. We look at…

Logic in Computer Science · Computer Science 2022-08-08 Lucas Dixon

We define evaluation forms associated to objects in a module subcategory of Ext-symmetry generated by finitely many simple modules over a path algebra with relations and prove a multiplication formula for the product of two evaluation…

Representation Theory · Mathematics 2009-02-03 Jie Xiao , Fan Xu

In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here, we further explore this system, exhibiting a classical…

Logic in Computer Science · Computer Science 2023-08-11 Eben Blaisdell , Max Kanovich , Stepan L. Kuznetsov , Elaine Pimentel , Andre Scedrov
‹ Prev 1 4 5 6 7 8 10 Next ›