Pages that link to "Item:Q331054"
From MaRDI portal
The following pages link to Proof complexity of intuitionistic implicational formulas (Q331054):
Displaying 12 items.
- Complexity of subclasses of the intuitionistic propositional calculus (Q688732) (← links)
- Proof finding algorithms for implicational logics (Q1575928) (← links)
- Admissibility in positive logics (Q1689558) (← links)
- An algorithm for the class of pure implicational formulas (Q1961448) (← links)
- On the proof complexity of logics of bounded branching (Q2084964) (← links)
- Essential structure of proofs as a measure of complexity (Q2183713) (← links)
- Intuitionistic implication makes model checking hard (Q2887060) (← links)
- A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems (Q2944868) (← links)
- Inductive Complexity of Goodstein’s Theorem (Q4648198) (← links)
- Computer Science Logic (Q5292653) (← links)
- Implicit proofs (Q5311729) (← links)
- Exploring Computational Contents of Intuitionist Proofs (Q5463274) (← links)