Results 21 to 30 of about 2,682,535 (254)
Taylor expansion in linear logic is invertible [PDF]
Logical Methods in Computer Science, 2018 Each Multiplicative Exponential Linear Logic (MELL) proof-net can be expanded into a differential net, which is its Taylor expansion. We prove that two different MELL proof-nets have two different Taylor expansions.
Daniel de Carvalho
doaj +3 more sources
Cut elimination in coalgebraic logics
Information and Computation, 2010 We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomatisation of a particular logic and its coalgebraic semantics that guarantee that the cut-rule is admissible in the ensuing sequent calculus.
Dirk Pattinson, Lutz Schröder
+7 more sources
Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
FICS@CSLWe consider modal logic extended with the well-known temporal operator'eventually'and provide a cut-elimination procedure for a cyclic sequent calculus that captures this fragment.
Bahareh Afshari, Johannes Kloibhofer
openalex +2 more sources
Cut Elimination in Nested Sequents for Intuitionistic Modal Logics [PDF]
Foundations of Software Science and Computation Structure, 2013 Lutz Straßburger
openalex +2 more sources
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic [PDF]
Logic in Computer Science, 2022 This paper introduces the exponential substitution calculus (ESC), a new presentation of cut elimination for IMELL, based on proof terms and building on the idea that exponentials can be seen as explicit substitutions.
Beniamino Accattoli
semanticscholar +1 more source
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic [PDF]
Logical Methods in Computer Science, 2023 This paper introduces the exponential substitution calculus (ESC), a new presentation of cut elimination for IMELL, based on proof terms and building on the idea that exponentials can be seen as explicit substitutions.
Beniamino Accattoli
doaj +1 more source
Analytic Non-Labelled Proof-Systems for Hybrid Logic: Overview and a couple of striking facts
Bulletin of the Section of Logic, 2022 This paper is about non-labelled proof-systems for hybrid logic, that is, proofsystems where arbitrary formulas can occur, not just satisfaction statements.
Torben Braüner
doaj +1 more source
On Synonymy in Proof-Theoretic Semantics: The Case of \(\mathtt{2Int}\)
Bulletin of the Section of Logic, 2023 We consider an approach to propositional synonymy in proof-theoretic semantics that is defined with respect to a bilateral G3-style sequent calculus \(\mathtt{SC2Int}\) for the bi-intuitionistic logic \(\mathtt{2Int}\). A distinctive feature of \(\mathtt{
Sara Ayhan, Heinrich Wansing
doaj +1 more source
Algebraic Aspects of Cut Elimination [PDF]
Studia Logica, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Belardinelli, Francesco +2 more
openaire +2 more sources
One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity
Bulletin of the Section of Logic, 2021 Bilinear Logic of Lambek amounts to Noncommutative MALL of Abrusci. Lambek proves the cut–elimination theorem for a one-sided (in fact, left-sided) sequent system for this logic.
Paweł Płaczek
doaj +1 more source