Pages that link to "Item:Q5940143"
From MaRDI portal
The following pages link to On the computational content of intuitionistic propositional proofs (Q5940143):
Displaying 18 items.
- Proof complexity of intuitionistic implicational formulas (Q331054) (← links)
- Substitution Frege and extended Frege proof systems in non-classical logics (Q1023047) (← links)
- Computations in fragments of intuitionistic propositional logic (Q1181713) (← links)
- The complexity of the disjunction and existential properties in intuitionistic logic (Q1304542) (← links)
- Monotone simulations of non-monotone proofs. (Q1872729) (← links)
- On the proof complexity of logics of bounded branching (Q2084964) (← links)
- Rasiowa-Harrop disjunction property (Q2363508) (← links)
- Upper bounds on complexity of Frege proofs with limited use of certain schemata (Q2491079) (← links)
- Frege systems for extensible modal logics (Q2503409) (← links)
- On the Computational Content of Termination Proofs (Q3195706) (← links)
- (Q3743301) (← links)
- (Q4012886) (← links)
- On the complexity of propositional quantification in intuitionistic logic (Q4358053) (← links)
- INCOMPLETENESS IN THE FINITE DOMAIN (Q4640304) (← links)
- On intuitionistic proof nets with additional rewrite rules and their approximations (Q4916174) (← links)
- Exploring Computational Contents of Intuitionist Proofs (Q5463274) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)
- Universal proof theory: feasible admissibility in intuitionistic modal logics (Q6652040) (← links)