The following pages link to (Q3476809):
Displaying 20 items.
- Preservation theorems and restricted consistency statements in bounded arithmetic (Q598285) (← links)
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem (Q647334) (← links)
- On truth-table reducibility to SAT (Q1173957) (← links)
- A general method of axiomatizing fragments (Q1176090) (← links)
- Arithmetizing uniform \(NC\) (Q1176198) (← links)
- Lifting independence results in bounded arithmetic (Q1283131) (← links)
- On induction-free provability (Q1353982) (← links)
- A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- \(S^ i_ 3\) and \(\overset\circ V^ i_ 2(BD)\) (Q1823242) (← links)
- Ordinal notations and well-orderings in bounded arithmetic (Q1861331) (← links)
- Unprovability of consistency statements in fragments of bounded arithmetic (Q1896613) (← links)
- Relating the bounded arithmetic and polynomial time hierarchies (Q1899144) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) (Q2388433) (← links)
- Models of replacement schemes (Q2573725) (← links)
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- Existentially Closed Models and Conservation Results in Bounded Arithmetic (Q3611724) (← links)
- Restricted polynomial induction versus ordinary induction (Q4565103) (← links)
- A new proof of the weak pigeonhole principle (Q5894824) (← links)
