English
Related papers

Related papers: Cut elimination, identity elimination, and interpo…

200 papers

An approach to universal (meta-)logical reasoning in classical higher-order logic is employed to explore and study simplifications of Kurt G\"odel's modal ontological argument. Some argument premises are modified, others are dropped, modal…

Logic in Computer Science · Computer Science 2020-06-16 Christoph Benzmüller

We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the…

Logic in Computer Science · Computer Science 2011-03-02 Zoran Majkic

Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…

Logic · Mathematics 2024-08-23 Jonte Deakin , Jim de Groot

This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of…

Logic in Computer Science · Computer Science 2024-11-13 Alexander V. Gheorghiu , Tao Gu , David J. Pym

Subatomic systems were recently introduced to identify the structural principles underpinning the normalization of proofs. "Subatomic" means that we can reformulate logical systems in accordance with two principles. Their atomic formulas…

Logic in Computer Science · Computer Science 2018-04-24 Luca Roversi

In this paper we present a constructive proof of cut elimination for a system of full second order logic with the structural rules absorbed and using sets instead of sequences. The standard problem of the cutrank growth is avoided by using…

Logic · Mathematics 2016-06-22 Sandro Skansi

This paper is a study of first-order coherent logic from the point of view of duality and categorical logic. We prove a duality theorem between coherent hyperdoctrines and open polyadic Priestley spaces, which we subsequently apply to prove…

Logic · Mathematics 2024-06-21 Sam van Gool , Jérémie Marquès

We study abstract intermediate justification logics, that is arbitrary intermediate propositional logics extended with a subset of specific axioms of (classical) justification logics. For these, we introduce various semantics by combining…

Logic · Mathematics 2020-08-18 Nicholas Pischke

In [17], we introduced a modal logic, called $L$, which combines intuitionistic propositional logic $IPC$ and classical propositional logic $CPC$ and is complete w.r.t. an algebraic semantics. However, $L$ seems to be too weak for…

Logic in Computer Science · Computer Science 2015-10-20 Steffen Lewitzka

The four-valued semantics of Belnap--Dunn logic, consisting of the truth values True, False, Neither, and Both, gives rise to several non-classical logics depending on which feature of propositions we wish to preserve: truth, non-falsity,…

Logic · Mathematics 2021-11-22 Adam Přenosil

Linear logic is a substructural logic proposed as a refinement of classical and intuitionistic logics, with applications in programming languages, game semantics, and quantum physics. We present a template for Gentzen-style linear logic…

Logic in Computer Science · Computer Science 2023-09-26 Alen Docef , Radu Negulescu , Mihai Prunescu

Nominal logic is a variant of first-order logic that provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any…

Logic in Computer Science · Computer Science 2013-12-18 James Cheney

In this survey, we present in a unified way the categorical and syntactical settings of coherent differentiation introduced recently, which shows that the basic ideas of differential linear logic and of the differential lambda-calculus are…

Logic in Computer Science · Computer Science 2024-01-29 Thomas Ehrhard

We consider an extension of the modal logic of transitive closure K+ with some inifinitary derivations and present a sequent calculus for this extension, which allows non-well-founded proofs. For the given calculus, we obtain the…

Logic · Mathematics 2024-11-25 Daniyar Shamkanov

In the present paper, we introduce a multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The display-approach is suitable to modularly chart the space of dynamic epistemic logics on…

Je\v{r}\'abek showed that cuts in classical propositional logic proofs in deep inference can be eliminated in quasipolynomial time. The proof is indirect and it relies on a result of Atserias, Galesi and Pudl\'ak about monotone sequent…

Computational Complexity · Computer Science 2017-01-11 Paola Bruscoli , Alessio Guglielmi , Tom Gundersen , Michel Parigot

The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness…

Logic in Computer Science · Computer Science 2020-02-17 Marianna Girlando , Sara Negri , Nicola Olivetti

Normal modal logics extending the logic K4.3 of linear transitive frames are known to lack the Craig interpolation property, except some logics of bounded depth such as S5. We turn this `negative' fact into a research question and pursue a…

Logic · Mathematics 2025-08-14 Agi Kurucz , Frank Wolter , Michael Zakharyaschev

Nowadays there is a large number of non-classical logics, each one best suited for reasoning about some issues in abstract fields, such as linguistics or epistemology, among others. Proving interesting properties for each one of them…

Logic · Mathematics 2024-03-14 Raül Espejo-Boix

The Craig interpolation property (CIP) states that an interpolant for an implication exists iff it is valid. The projective Beth definability property (PBDP) states that an explicit definition exists iff a formula stating implicit…

Logic in Computer Science · Computer Science 2023-05-01 Alessandro Artale , Jean Christoph Jung , Andrea Mazzullo , Ana Ozaki , Frank Wolter