A Local System for Classical Logic
From MaRDI portal
Publication:2996175
DOI10.1007/3-540-45653-8_24zbMath1275.03150OpenAlexW1811725859MaRDI QIDQ2996175
Publication date: 6 May 2011
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45653-8_24
Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items (20)
MELL in the calculus of structures ⋮ Deep sequent systems for modal logic ⋮ A Subatomic Proof System for Decision Trees ⋮ An Analytic Propositional Proof System on Graphs ⋮ On the Power of Substitution in the Calculus of Structures ⋮ Combinatorial flows as bicolored atomic flows ⋮ Enumerating Independent Linear Inferences ⋮ A System of Interaction and Structure III: The Complexity of BV and Pomset Logic ⋮ Intermutation ⋮ Spinal atomic \(\lambda\)-calculus ⋮ On linear rewriting systems for Boolean logic and some applications to proof theory ⋮ The canonical pairs of bounded depth Frege systems ⋮ System NEL is Undecidable ⋮ Extension without cut ⋮ On structuring proof search for first order linear logic ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem ⋮ Unnamed Item ⋮ Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic ⋮ Deep inference and expansion trees for second-order multiplicative linear logic ⋮ Constructing weak simulations from linear implications for processes with private names
This page was built for publication: A Local System for Classical Logic
