Pages that link to "Item:Q1125060"
From MaRDI portal
The following pages link to Structure and definability in general bounded arithmetic theories (Q1125060):
Displaying 23 items.
- Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\) (Q535152) (← links)
- Preservation theorems and restricted consistency statements in bounded arithmetic (Q598285) (← links)
- Bootstrapping. I (Q636291) (← links)
- On the computational complexity of cut-reduction (Q636310) (← links)
- \(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly (Q937909) (← links)
- A note on sharply bounded arithmetic (Q1325055) (← links)
- Separations of theories in weak bounded arithmetic (Q1344280) (← links)
- Multifunction algebras and the provability of \(PH\downarrow\) (Q1577486) (← links)
- Well-behaved principles alternative to bounded induction (Q1885028) (← 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)
- A Characterisation of the Relations Definable in Presburger Arithmetic (Q3502652) (← links)
- (Q3581788) (← links)
- POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC (Q3583040) (← links)
- A Characterisation of Definable NP Search Problems in Peano Arithmetic (Q3638270) (← links)
- Restricted polynomial induction versus ordinary induction (Q4565103) (← links)
- Constructivizable and non-constructivizable formal arithmetic structures (Q4722049) (← links)
- Generalized r-cohesiveness and the arithmetical hierarchy: a correction to “Generalized cohesiveness” (Q4779652) (← links)
- On the finite axiomatizability of (Q5109206) (← links)
- Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i> (Q5444705) (← links)
- A list of arithmetical structures complete with respect to the first-order definability (Q5941257) (← links)
