The following pages link to (Q3136460):
Displayed 15 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- \(\text{Count}(q)\) does not imply \(\text{Count}(p)\) (Q1377601) (← links)
- Nondeterministic stack register machines (Q1391527) (← links)
- Cutting planes, connectivity, and threshold logic (Q1908818) (← links)
- \(k\)-provability in \(\mathrm{PA}\) (Q2070428) (← links)
- Efficient elimination of Skolem functions in \(\text{LK}^\text{h} \) (Q2144618) (← links)
- Translation of resolution proofs into short first-order proofs without choice axioms (Q2486578) (← links)
- Petr Hájek: A Scientific Biography (Q2948582) (← links)
- Von Neumann, Gödel and Complexity Theory (Q3067861) (← links)
- Models of true arithmetic are integer parts of models of real exponentation (Q4989722) (← links)
- VARIANTS OF KREISEL’S CONJECTURE ON A NEW NOTION OF PROVABILITY (Q5037515) (← links)
- Where pigeonhole principles meet Koenig lemmas (Q5158115) (← links)
- Real closed fields and models of Peano arithmetic (Q5190186) (← links)
- Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories (Q5404169) (← links)
- Frege proof system and TNC° (Q6064284) (← links)