Related papers: A MALL Geometry of Interaction Based on Indexed Li…
Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…
One leading question with respect to Bi-intuitionistic logic (BINT) is, what does BINT look like across the three arcs -- logic, typed $\lambda$-calculi, and category theory -- of the Curry-Howard-Lambek correspondence? Categorically, BINT…
Real-valued logics have seen a renewed interest in verification for probabilistic and quantitative systems, in particular machine learning models, where they can be used to directly integrate specifications in the training objective. To do…
Data-aware modal logics offer a powerful formalism for reasoning about semi-structured queries in languages such as DataGL, XPath, and GQL. In brief, these logics can be viewed as modal systems capable of expressing both reachability…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
We review some relations occurring between the combinatorial intersection theory on the moduli spaces of stable curves and the asymptotic behavior of the 't Hooft-Kontsevich matrix integrals. In particular, we give an alternative proof of…
We examine the categorical structure of the Grothendieck construction $\Sigma_{\mathsf{C}}\mathsf{L}$ of an indexed category $\mathsf{L} \colon \mathsf{C}^{op} \to \mathsf{CAT}$. Our analysis begins with characterisations of fibred limits,…
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…
G\"odel modal logics can be seen as extenions of intutionistic modal logics with the prelinearity axiom. In this paper we focus on the algebraic and relational semantics for G\"odel modal logics that leverages on the duality between finite…
Recent urbanization has coincided with the enrichment of geotagged data, such as street view and point-of-interest (POI). Region embedding enhanced by the richer data modalities has enabled researchers and city administrators to understand…
A categorical model of the multiplicative and exponential fragments of intuitionistic linear logic ($\mathsf{MELL}$), known as a \emph{linear category}, is a symmetric monoidal closed category with a monoidal coalgebra modality (also known…
In this paper, we present a typed lambda calculus ${\bf SILL}(\lambda)_{\Sigma}$, a type-theoretic version of intuitionistic linear logic with subexponentials, that is, we have many resource comonadic modalities with some interconnections…
We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally…
Intuitionistic grammar logics fuse constructive and multi-modal reasoning while permitting the use of converse modalities, serving as a generalization of standard intuitionistic modal logics. In this paper, we provide definitions of these…
Many applications of machine learning involve the analysis of large data frames-matrices collecting heterogeneous measurements (binary, numerical, counts, etc.) across samples-with missing values. Low-rank models, as studied by Udell et al.…
We present a neuro-mathematical model for geometrical optical illusions (GOIs), a class of illusory phenomena that consists in a mismatch of geometrical properties of the visual stimulus and its associated percept. They take place in the…
Interpretability is one of the considerations when applying machine learning to high-stakes fields such as healthcare that involve matters of life safety. Generalized Additive Models (GAMs) enhance interpretability by visualizing shape…
Cut-elimination is the bedrock of proof theory. It is the algorithm that eliminates cuts from a sequent calculus proof that leads to cut-free calculi and applications. Cut-elimination applies to many logics irrespective of their semantics.…
We give a proof-theoretic and algorithmic complexity analysis for systems introduced by Morrill to serve as the core of the CatLog categorial grammar parser. We consider two recent versions of Morrill's calculi, and focus on their fragments…
Let $A$ be a commutative noetherian ring and $I$ an ideal in $A$. We characterize algebraically when all the minimal primes of the associated graded ring $G_I A$ contract to minimal primes of $A/I$. This, applied to intersection theory,…