Pages that link to "Item:Q1295443"
From MaRDI portal
The following pages link to Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443):
Displaying 8 items.
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem (Q647334) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- Bounded arithmetic for NC, ALogTIME, L and NL (Q1192345) (← links)
- Parikh and Wittgenstein (Q3299831) (← links)
- (Q3794178) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- (Q5465358) (← links)
- Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity (Q5941296) (← links)