Related papers: Residuated Basic Logic I
We define two extensions of the typed linear lambda-calculus that yield minimal Turing-complete systems. The extensions are based on unbounded recursion in one case, and bounded recursion with minimisation in the other. We show that both…
In this paper we explore the boundary between biology and the study of formal systems (logic). In the end, we arrive at a summary formalism, a chapter in "boundary mathematics" where there are not only containers <> but also extainers ><,…
The two Girard translations provide two different means of obtaining embeddings of Intuitionistic Logic into Linear Logic, corresponding to different lambda-calculus calling mechanisms. The translations, mapping A -> B respectively to !A -o…
Description logics (DLs) are well-known knowledge representation formalisms focused on the representation of terminological knowledge. Due to their first-order semantics, these languages (in their classical form) are not suitable for…
Separation logic's compositionality and local reasoning properties have led to significant advances in scalable static analysis. But program analysis has new challenges -- many programs display computational effects and, orthogonally,…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
We show how categorial deduction can be implemented in higher-order (linear) logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing…
In this paper we study the tensor product for MV-algebras, the algebraic structures of \L ukasiewicz $\infty$-valued logic. Our main results are: the proof that the tensor product is preserved by the categorical equivalence between the…
Semiconic idempotent logic sCI is a common generalization of intuitionistic logic, semilinear idempotent logic sLI, and in particular relevance logic with mingle. We establish the projective Beth definability property and the deductive…
By the recursion operator of the Kaup-Newell hierarchy we construct the relativistic derivative NLS (RDNLS) equation and the corresponding Lax pair. In the nonrelativistic limit $c \rightarrow \infty$ it reduces to DNLS equation and…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…
Full Intuitionistic Linear Logic (FILL) is multiplicative intuitionistic linear logic extended with par. Its proof theory has been notoriously difficult to get right, and existing sequent calculi all involve inference rules with complex…
While reinforcement learning (RL) has made great advances in scalability, exploration and partial observability are still active research topics. In contrast, Bayesian RL (BRL) provides a principled answer to both state estimation and the…
The residualization procedure has been applied in many different fields to estimate models with multicollinearity. However, there exists a lack of understanding of this methodology and some authors discourage its use. This paper aims to…
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…
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…
We show how a rescaling of fractional operators with bounded kernels may help circumvent their documented deficiencies, for example, the inconsistency at zero or the lack of inverse integral operator. On the other hand, we build a novel…
This paper aims at connecting the various classes that provide an algebraic semantics for three different conservative expansions of Lukasiewicz logic, using algebraic and category-theoretical techniques. We connect such classes of algebras…
The foundational character of certain algebraic structures as Boolean algebras and Heyting algebras is rooted in their potential to model classical and constructive logic, respectively. In this paper we discuss the contributions of…
We propose a novel logic, called Frame Logic (FL), that extends first-order logic (with recursive definitions) using a construct Sp(.) that captures the implicit supports of formulas -- the precise subset of the universe upon which their…