English
Related papers

Related papers: The external version of a subclassical logic

200 papers

Finite dimensional modular Lie superalgebras over algebraically closed fields with indecomposable Cartan matrices are classified under some technical, most probably inessential, hypotheses. If the Cartan matrix is invertible, the…

Representation Theory · Mathematics 2009-06-11 Sofiane Bouarroudj , Pavel Grozman , Dimitry Leites

This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theorem of Peter Freyd saying that there are no sufficiently…

Category Theory · Mathematics 2014-10-16 Michal R. Przybylek

The development of logic has largely been through the 'deductive' paradigm: conclusions are inferred from established premisses. However, the use of logic in the context of both human and machine reasoning is typically through the dual…

Logic in Computer Science · Computer Science 2025-04-29 Alexander V. Gheorghiu , David J. Pym

We provide a Lawvere-style definition for partial theories, extending the classical notion of equational theory by allowing partially defined operations. As in the classical case, our definition is syntactic: we use an appropriate class of…

Logic in Computer Science · Computer Science 2020-11-16 Ivan Di Liberti , Fosco Loregian , Chad Nester , Paweł Sobociński

The thesis of this paper is that truth-relevant logic is a better foundation for mathematics than classical logic. It is a system proposed by Richard Diaz in 1981. In a certain sense t-relevant logic is based on Kleene strong tables. These…

Logic · Mathematics 2023-02-14 X. Y. Newberry

We investigate the real Lie algebra of first-order differential operators with polynomial coefficients, which is subject to the following requirements. (1) The Lie algebra should admit a basis of differential operators with homogeneous…

Mathematical Physics · Physics 2024-01-09 Alfred Michel Grundland , Ian Marquette

This paper establishes the normalisation of natural deduction or lambda calculus formulation of Intuitionistic Non Commutative Logic --- which involves both commutative and non commutative connectives. This calculus first introduced by de…

Logic in Computer Science · Computer Science 2014-02-04 Maxime Amblard , Christian Retoré

Let $\mathcal{L}$ be a first-order two-sorted language and consider a class of $\mathcal{L}$-structures of the form $\langle M, X \rangle$ where $M$ varies among structures of the first sort, while $X$ is fixed in the second sort, and it is…

This document describes syntax, semantics and implementation guidelines in order to enrich the DLV system with the possibility to make external C function calls. This feature is realized by the introduction of parametric external…

Artificial Intelligence · Computer Science 2007-05-23 G. Ianni , F. Calimeri , A. Pietramala , M. C. Santoro

LP$^{\supset,\mathsf{F}}$ is a three-valued paraconsistent propositional logic which is essentially the same as J3. It has most properties that have been proposed as desirable properties of a reasonable paraconsistent propositional logic.…

Logic in Computer Science · Computer Science 2021-03-08 C. A. Middelburg

For the description logic EL, we consider the neighborhood relation which is induced by the subsumption order, and we show that the corresponding lattice of EL concept descriptions is distributive, modular, graded, and metric. In…

Logic in Computer Science · Computer Science 2019-01-18 Francesco Kriegel

In a previous publication, we introduced an abstract logic via an abstract notion of quantifier. Drawing upon concepts from categorical logic, this abstract logic interprets formulas from context as subobjects in a specific category, e.g.,…

Logic in Computer Science · Computer Science 2024-07-08 Marc Aiguier , Isabelle Bloch , Romain Pascual

To understand a document with multiple events, event-event relation extraction (ERE) emerges as a crucial task, aiming to discern how natural events temporally or structurally associate with each other. To achieve this goal, our work…

Information Theory · Computer Science 2024-12-20 Peixin Huang , Xiang Zhao , Minghao Hu , Zhen Tan , Weidong Xiao

We study relationship between first order multiplicative linear logic (MLL1), which has been known to provide representations to different categorial grammars, and the recently introduced extended tensor type calculus (ETTC). We identify a…

Computation and Language · Computer Science 2022-01-03 Sergey Slavnov

We present a theory and applications of discrete exterior calculus on simplicial complexes of arbitrary finite dimension. This can be thought of as calculus on a discrete space. Our theory includes not only discrete differential forms but…

Differential Geometry · Mathematics 2007-05-23 Mathieu Desbrun , Anil N. Hirani , Melvin Leok , Jerrold E. Marsden

We identify multirole logic as a new form of logic and formalize linear multirole logic (LMRL) as a natural generalization of classical linear logic (CLL). Among various meta-properties established for LMRL, we obtain one named multi-cut…

Programming Languages · Computer Science 2016-11-29 Hongwei Xi , Hanwen Wu

A variety of problems emerged investigating electronic circuits, computer devices and cellular automata motivated a number of attempts to create a differential and integral calculus for Boolean functions. In the present article, we extend…

Logic · Mathematics 2016-08-17 Eduardo Mizraji

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present…

Logic · Mathematics 2023-04-06 Wesley H. Holliday

A classical result due to Bochner characterizes the classical orthogonal polynomial systems as solutions of a second-order eigenvalue equation. We extend Bochner's result by dropping the assumption that the first element of the orthogonal…

Mathematical Physics · Physics 2010-04-14 David Gomez-Ullate , Niky Kamran , Robert Milson

We give labeled natural deduction systems for a family of tense logics extending the basic linear tense logic Kl. We prove that our systems are sound and complete with respect to the usual Kripke semantics, and that they possess a number of…

Logic in Computer Science · Computer Science 2008-03-25 Luca Viganò , Marco Volpe