English
Related papers

Related papers: The external version of a subclassical logic

200 papers

Let $f:V\times V\to F$ be a totally arbitrary bilinear form defined on a finite dimensional vector space $V$ over a a field $F$, and let $L(f)$ be the subalgebra of $\gl(V)$ of all skew-adjoint endomorphisms relative to $f$. Provided $F$ is…

Rings and Algebras · Mathematics 2013-08-22 S. Ruhallah Ahmadi , Martin Chaktoura , Fernando Szechtman

The so-called light logics have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus from these logics, however, is problematic. In this paper we…

Logic in Computer Science · Computer Science 2015-07-01 Paolo Coppola , Ugo Dal Lago , Simona Ronchi Della Rocca

This paper aims at providing a comprehensive solution to the archaic open problem: how to define semantics of three-valued modal logic with vivid intuitive picture, convincing philosophical justification as well as versatile practical…

Logic · Mathematics 2022-09-28 Xinyu Wang , Yang Song , Satoshi Tojo

The finite families of Hahn polynomials and associated biorthogonal rational functions are interpreted algebraically in the framework of Leonard trios. We introduce the trio Hahn algebra and prove that it is isomorphic to the meta Hahn…

Mathematical Physics · Physics 2026-05-20 Nicolas Crampé , Quentin Labriet , Lucia Morey , Luc Vinet

Glivenko's theorem states that a formula is derivable in classical propositional logic $\mathrm{CL}$ iff under the double negation it is derivable in intuitionistic propositional logic $\mathrm{IL}$: $\mathrm{CL}\vdash\varphi$ iff…

Logic · Mathematics 2020-03-12 Ilya B. Shapirovsky

Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…

Logic in Computer Science · Computer Science 2026-02-02 Amirhossein Akbar Tabatabai , Raheleh Jalali

The concept of a clone is central to many branches of mathematics, such as universal algebra, algebraic logic, and lambda calculus. Abstractly a clone is a category with two objects such that one is a countably infinite power of the other.…

Logic in Computer Science · Computer Science 2009-07-28 Zhaohua Luo

A Lie algebra $L$ is said to be $(\Theta_{n},sl_{n})$-graded if it contains a simple subalgebra $\mathfrak{g}$ isomorphic to $sl_{n}$ such that the $\mathfrak{g}$-module $L$ decomposes into copies of the adjoint module, the trivial module,…

Rings and Algebras · Mathematics 2021-04-21 Alexander Baranov , Hogir M. Yaseen

This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of Linear Logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have…

Logic in Computer Science · Computer Science 2015-09-07 Daniele Porello , Nicolas Troquard

Classification theorems for linear differential equations in two real variables, possessing eigenfunctions in the form of the polynomials (the generalized Bochner problem) are given. The main result is based on the consideration of the…

High Energy Physics - Theory · Physics 2016-09-06 Alexander Turbiner

We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal…

Logic in Computer Science · Computer Science 2019-04-16 Marcelo Fiore , Philip Saville

Using the lattice-theoretic version of the Euler characteristic introduced by V. Klee and G.-C. Rota in the Sixties, we define the Euler characteristic of a formula in G\"{o}del logic (over finitely or infinitely many truth-values). We then…

Logic in Computer Science · Computer Science 2014-01-22 Pietro Codara , Ottavio M. D'Antona , Vincenzo Marra

The study of Description Logics have been historically mostly focused on features that can be translated to decidable fragments of first-order logic. In this paper, we leave this restriction behind and look for useful and decidable…

Logic in Computer Science · Computer Science 2023-08-30 Joshua Hirschbrunn , Yevgeny Kazakov

We develop a Gentzen-style proof theory for super-Belnap logics (extensions of the four-valued Dunn-Belnap logic), expanding on an approach initiated by Pynko. We show that just like substructural logics may be understood…

Logic · Mathematics 2018-03-13 Adam Prenosil

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…

Logic in Computer Science · Computer Science 2013-03-13 Jan A. Bergstra , A. Ponse , D. J. C. Staudt

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

The concept of counterfactual explanations (CE) has emerged as one of the important concepts to understand the inner workings of complex AI systems. In this paper, we translate the idea of CEs to linear optimization and propose, motivate,…

Optimization and Control · Mathematics 2024-05-27 Jannis Kurtz , Ş. İlker Birbil , Dick den Hertog

De Rijke introduced a unary interpretability logic $\mathbf{il}$, and proved that $\mathbf{il}$ is the unary counterpart of the binary interpretability logic $\mathbf{IL}$. In this paper, we find the unary counterparts of the sublogics of…

Logic · Mathematics 2022-06-09 Yuya Okawa

This paper introduces a logical system, called BV, which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challenging for the sequent calculus, and so far it is not achieved…

Logic in Computer Science · Computer Science 2007-05-23 Alessio Guglielmi

Let V be a finite-dimensional superspace and G a simple (or a ``close'' to simple) matrix Lie superalgebra, i.e., a Lie subsuperalgebra in GL(V). Under the classical invariant theory for G we mean the description of G-invariant elements of…

Representation Theory · Mathematics 2007-05-23 Alexander Sergeev