The deduction rule and linear and near-linear proof simulations
DOI10.2307/2275228zbMATH Open0848.03028OpenAlexW2012084714MaRDI QIDQ3138022FDOQ3138022
Authors: Maria Luisa Bonet, Samuel R. Buss 
Publication date: 24 October 1993
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275228
Recommendations
natural deduction calculusspeedupFrege systemslength of proofsproof systems for propositional logicnear-linear simulationspropositional Gentzen sequent calculustree-like systemsvariants of the deduction rule
Cites Work
Cited In (15)
- The Deduction Theorem for Strong Propositional Proof Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simulation of Natural Deduction and Gentzen Sequent Calculus
- Lower complexity bounds in justification logic
- Exponential lower bounds for the pigeonhole principle
- The deduction theorem for strong propositional proof systems
- Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss
- Some remarks on lengths of propositional proofs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the correspondence between arithmetic theories and propositional proof systems – a survey
- Logical Closure Properties of Propositional Proof Systems
- The NP-Completeness of Reflected Fragments of Justification Logics
- Monotone simulations of non-monotone proofs.
This page was built for publication: The deduction rule and linear and near-linear proof simulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138022)
