Related papers: The external version of a subclassical logic
The Lambek calculus is a substructural logic known to be closely related to the formal language theory: on the one hand, it is used for generating formal languages by means of categorial grammars and, on the other hand, it has formal…
The recently introduced series of description logics under the common moniker DL-Lite has attracted attention of the description logic and semantic web communities due to the low computational complexity of inference, on the one hand, and…
This paper defines a new proof- and category-theoretic framework for classical linear logic that separates reasoning into one linear regime and two persistent regimes corresponding to ! and ?. The resulting linear/producer/consumer (LPC)…
We present a novel unity of logic, viz., a single sequent calculus that embodies classical, intuitionistic and linear logics. Concretely, we define classical linear logic negative (CLL$^-$), a new logic that is classical and linear yet…
Internal language theorems are fundamental in categorical logic, since they express an equivalence between syntax and semantics. One of such theorems was proven by Clairambault and Dybjer, who corrected the result originally by Seely. More…
Given an extriangulated category $(\mathcal{C},\mathbb{E},\mathfrak{s})$, we introduce the $3 \times 3$-lemma property for subfunctors of $\mathbb{E}$ and prove that an additive subfunctor $\mathbb{F}$ of $\mathbb{E}$ is closed if, and only…
Two types of higher order Lie $\ell$-ple systems are introduced in this paper. They are defined by brackets with $\ell > 3$ arguments satisfying certain conditions, and generalize the well known Lie triple systems. One of the…
A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers. A labelled tableau system is…
The use of Extended Logics to replace ordinary second order definability in Kleene's {\em Ramified Analytical Hierarchy} is investigated. This mirrors a similar investigation of Kennedy, Magidor and V\"a\"an\"anen \cite{KeMaVa2016} where…
An algebraically expandable (AE) class is a class of algebraic structures axiomatizable by sentences of the form $\forall \exists! \land p = q$. For a logic $L$ algebraized by a quasivariety $\mathcal{Q}$ we show that the AE-subclasses of…
A semi-discrete Lax pair formed from the differential system and recurrence relation for semi-classical orthogonal polynomials, leads to a discrete integrable equation for a specific semi-classical orthogonal polynomial weight. The main…
We prove that $\delta$-derivations of a simple finite-dimensional Lie algebra over a field of characteristic zero, with values in a finite-dimensional module, are either inner derivations, or, in the case of adjoint module, multiplications…
In this work we present additional results related to the property of strong equivalence of logic programs. This property asserts that two programs share the same set of stable models, even under the addition of new rules. As shown in a…
Linear algebra algorithms often require some sort of iteration or recursion as is illustrated by standard algorithms for Gaussian elimination, matrix inversion, and transitive closure. A key characteristic shared by these algorithms is that…
The primary goal of this paper is to present a unified way to transform the syntax of a logic system into certain initial algebraic structure so that it can be studied algebraically. The algebraic structures which one may choose for this…
It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type…
Large language models perform well on many logical reasoning benchmarks, but it remains unclear which core logical skills they truly master. To address this, we introduce LogicSkills, a benchmark that isolates three fundamental logical…
Many complex scenarios require the coordination of agents possessing unique points of view and distinct semantic commitments. In response, standpoint logic (SL) was introduced in the context of knowledge integration, allowing one to reason…
Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression. In programming, short-circuit…
Extensional higher-order logic programming has been introduced as a generalization of classical logic programming. An important characteristic of this paradigm is that it preserves all the well-known properties of traditional logic…