English
Related papers

Related papers: Explorations in Subexponential non-associative non…

200 papers

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

We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…

Logic · Mathematics 2023-06-22 Jim de Groot , Dirk Pattinson

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…

Logic in Computer Science · Computer Science 2020-10-02 Max Kanovich , Stepan Kuznetsov , Andre Scedrov

We characterize type isomorphisms in the multiplicative-additive fragment of linear logic (MALL), and thus in *-autonomous categories with finite products, extending a result for the multiplicative fragment by Balat and Di Cosmo. This…

Logic in Computer Science · Computer Science 2025-11-26 Rémi Di Guardia , Olivier Laurent

In this paper a conditional logic is defined and studied. This conditional logic, Deterministic Bayesian Logic, is constructed as a deterministic counterpart to the (probabilistic) Bayesian conditional. The logic is unrestricted, so that…

Logic in Computer Science · Computer Science 2011-11-09 Frederic Dambreville

We explore the theory of illfounded and cyclic proofs for the propositional modal $\mu$-calculus. A fine analysis of provability for classical and intuitionistic modal logic provides a novel bridge between finitary, cyclic and illfounded…

Logic · Mathematics 2025-09-03 Bahareh Afshari , Graham E. Leigh , Guillermo Menèndez Turata

In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…

Logic in Computer Science · Computer Science 2021-10-20 Samson Abramsky , Dan Marsden

Deep and shallow embeddings of non-classical logics in classical higher-order logic have been explored, implemented, and used in various reasoning tools in recent years. This paper presents a method for the simultaneous deployment of deep…

Logic in Computer Science · Computer Science 2025-06-03 Christoph Benzmüller

We present the logic IBV, which is an intuitionistic version of BV, in the sense that its restriction to the MLL connectives is exactly IMLL, the intuitionistic version of MLL. For this logic we give a deep inference proof system and show…

Logic in Computer Science · Computer Science 2026-04-27 Matteo Acclavio , Lutz Strassburger

This paper represents classical propositional proofs as *combinatorial proofs*, which are more abstract than proof nets: superposition (contraction/weakening) is modelled mathematically, as a lax form of fibration, rather than syntactically…

Logic · Mathematics 2007-05-23 Dominic Hughes

The approach taken by Gheorghiu, Gu and Pym in their paper on giving a Base-extension Semantics for Intuitionistic Multiplicative Linear Logic is an interesting adaptation of the work of Sandqvist for IPL to the substructural setting. What…

Logic in Computer Science · Computer Science 2025-10-16 Yll Buzoku

This article initiates the semantic study of distribution-free normal modal logic systems, laying the semantic foundations and anticipating further research in the area. The article explores roughly the same area, though taking a different…

Logic in Computer Science · Computer Science 2025-11-25 Chrysafis Hartonas

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

In this paper, we introduce a new defeasible version of propositional standpoint logic by integrating Kraus et al.'s defeasible conditionals, Britz and Varzinczak's notions of defeasible necessity and distinct possibility, along with…

Logic in Computer Science · Computer Science 2025-07-15 Nicholas Leisegang , Thomas Meyer , Ivan Varzinczak

We propose an extension of the classical variational theory of evolution equations that accounts for dynamics also in possibly non-reflexive and non-separable spaces. The pivoting point is to establish a novel variational structure, based…

Analysis of PDEs · Mathematics 2021-09-17 Alexander Menovschikov , Anastasia Molchanova , Luca Scarpa

This paper analyzes the correctness of the subsumption algorithm used in CLASSIC, a description logic-based knowledge representation system that is being used in practical applications. In order to deal efficiently with individuals in…

Artificial Intelligence · Computer Science 2009-09-25 A. Borgida , P. F. Patel-Schneider

Double-negation translations are used to encode and decode classical proofs in intuitionistic logic. We show that, in the cut-free fragment, we can simplify the translations and introduce fewer negations. To achieve this, we consider the…

Logic in Computer Science · Computer Science 2013-12-20 Mélanie Boudard , Olivier Hermant

We consider the noncommutative space-times with Lie-algebraic noncommutativity (e.g. $\kappa$-deformed Minkowski space). In the framework with classical fields we extend the $\star$-product in order to represent the noncommutative…

High Energy Physics - Theory · Physics 2016-11-15 Marcin Daszkiewicz , Jerzy Lukierski , Mariusz Woronowicz

In the present paper, we endow a family of axiomatic extensions of semi De Morgan logic with proper multi-type display calculi which are sound, complete, conservative, and enjoy cut elimination and subformula property. Our proposal builds…

Logic · Mathematics 2018-09-26 Giuseppe Greco , Fei Liang , M. Andrew Moshier , Alessandra Palmigiano

We present a uniform characterisation of three-valued logics by means of the bisequent calculus (BSC). It is a generalised form of a sequent calculus (SC) where rules operate on the ordered pairs of ordinary sequents. BSC may be treated as…

Logic in Computer Science · Computer Science 2024-12-03 Andrzej Indrzejczak , Yaroslav Petrukhin
‹ Prev 1 8 9 10 Next ›