Deep inference and symmetry in classical proofs

zbMATH Open1094.03043MaRDI QIDQ3375282FDOQ3375282

Authors: Kai Brünnler 

Publication date: 7 March 2006

Recommendations

• Locality for classical logic
• Logical Approaches to Computational Barriers
• Proof Complexity of the Cut-free Calculus of Structures
• A proof calculus which reduces syntactic bureaucracy
• A Local System for Classical Logic

zbMATH Keywords

proof searchdeep inferencenormalization of proof

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Classical propositional logic (03B05) Cut-elimination and normal-form theorems (03F05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Classical first-order logic (03B10) Structure of proofs (03F07)

Cited In (18)

• The canonical pairs of bounded depth Frege systems
• Locality for classical logic
• A first order system with finite choice of premises
• The three dimensions of proofs
• On the logical philosophy of assertive graphs
• Peirce's calculi for classical propositional logic
• Cut elimination inside a deep inference system for classical predicate logic
• Proof analysis of Peirce's alpha system of graphs
• Logical Approaches to Computational Barriers
• On the proof complexity of cut-free bounded deep inference
• From deep inference to proof nets via cut elimination
• A deep inference system for the modal logic S5
• On the length of medial-switch-mix derivations
• Deep sequent systems for modal logic
• A proof calculus which reduces syntactic bureaucracy
• Proof Complexity of the Cut-free Calculus of Structures
• Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
• On the proof complexity of deep inference

This page was built for publication: Deep inference and symmetry in classical proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3375282)