Pages that link to "Item:Q4635844"
From MaRDI portal
The following pages link to A Note on the Complexity of Classical and Intuitionistic Proofs (Q4635844):
Displaying 6 items.
- Correspondences between classical, intuitionistic and uniform provability (Q1575924) (← links)
- (Q4012886) (← links)
- A generalization of a conservativity theorem for classical versus intuitionistic arithmetic (Q4458699) (← links)
- Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk) (Q4649532) (← links)
- Exploring Computational Contents of Intuitionist Proofs (Q5463274) (← links)
- Almost all Classical Theorems are Intuitionistic (Q5871575) (← links)