Pages that link to "Item:Q3138022"
From MaRDI portal
The following pages link to The deduction rule and linear and near-linear proof simulations (Q3138022):
Displaying 12 items.
- Lower complexity bounds in justification logic (Q408543) (← links)
- Exponential lower bounds for the pigeonhole principle (Q687506) (← links)
- The deduction theorem for strong propositional proof systems (Q987382) (← links)
- Monotone simulations of non-monotone proofs. (Q1872729) (← links)
- Some remarks on lengths of propositional proofs (Q1908815) (← links)
- Logical Closure Properties of Propositional Proof Systems (Q3502657) (← links)
- The NP-Completeness of Reflected Fragments of Justification Logics (Q3605524) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss (Q4646655) (← links)
- Simulation of Natural Deduction and Gentzen Sequent Calculus (Q4683217) (← links)
- (Q4842971) (← links)
- The Deduction Theorem for Strong Propositional Proof Systems (Q5458838) (← links)