Pages that link to "Item:Q4206725"

The following pages link to Provability of the pigeonhole principle and the existence of infinitely many primes (Q4206725):

Displaying 50 items.

• Quadratic forms in models of \(I\Delta_0 + \Omega_1\). II: Local equivalence (Q639651) (← links)
• Exponential lower bounds for the pigeonhole principle (Q687506) (← links)
• Independence results for variants of sharply bounded induction (Q716498) (← links)
• Resolution proofs of generalized pigeonhole principles (Q920967) (← links)
• Bounded arithmetic and the polynomial hierarchy (Q1177041) (← links)
• Combinatorial principles in elementary number theory (Q1182430) (← links)
• The prime number theorem and fragments of PA (Q1337499) (← links)
• Binary models generated by their tally part (Q1337500) (← links)
• The complexity of the pigeonhole principle (Q1343166) (← links)
• Toward the limits of the Tennenbaum phenomenon (Q1377555) (← links)
• Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
• \(\text{Count}(q)\) does not imply \(\text{Count}(p)\) (Q1377601) (← links)
• End extensions of models of linearly bounded arithmetic (Q1377910) (← links)
• Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
• Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms (Q1401230) (← links)
• Non-standard finite fields over \(I\Delta_0+\Omega_1\) (Q1567349) (← links)
• Multifunction algebras and the provability of \(PH\downarrow\) (Q1577486) (← links)
• Towards a unified complexity theory of total functions (Q1745728) (← links)
• A model-theoretic characterization of the weak pigeonhole principle (Q1849868) (← links)
• Lower bounds for the weak pigeonhole principle and random formulas beyond resolution (Q1854546) (← links)
• Dual weak pigeonhole principle, Boolean complexity, and derandomization (Q1887654) (← links)
• On Grzegorczyk induction (Q1892940) (← links)
• \(\Delta_ 0\)-complexity of the relation \(y= \prod_{i\leq n} F(i)\) (Q1899142) (← links)
• Pell equations and exponentiation in fragments of arithmetic (Q1919524) (← links)
• Iterated multiplication in \(VTC^0\) (Q2155497) (← links)
• Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
• On subrecursive complexity of integration (Q2291373) (← links)
• Quasipolynomial size proofs of the propositional pigeonhole principle (Q2344736) (← links)
• Quadratic forms in models of \(I\Delta _{0}+\Omega _{1}\). I (Q2382276) (← links)
• Circuit principles and weak pigeonhole variants (Q2383589) (← links)
• Upper and lower Ramsey bounds in bounded arithmetic (Q2488271) (← links)
• Structures interpretable in models of bounded arithmetic (Q2570136) (← links)
• Tautologies from pseudo-random generators (Q2736584) (← links)
• Fragments of approximate counting (Q2921008) (← links)
• Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
• Approximate counting by hashing in bounded arithmetic (Q3399180) (← links)
• Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989 (Q3478380) (← links)
• The polynomial and linear hierarchies in models where the weak pigeonhole principle fails (Q3503756) (← links)
• Abelian groups and quadratic residues in weak arithmetic (Q3566945) (← links)
• A form of feasible interpolation for constant depth Frege systems (Q3570172) (← links)
• On bounded arithmetic augmented by the ability to count certain sets of primes (Q3630574) (← links)
• Local behaviour of the Chebyshev theorem in models of <i>I</i>⊿₀ (Q4008743) (← links)
• Solving Pell equations locally in models of <i>I</i>Δ₀ (Q4212910) (← links)
• Witnessing functions in bounded arithmetic and search problems (Q4227882) (← links)
• Lower bounds to the size of constant-depth propositional proofs (Q4292593) (← links)
• Forcing in Finite Structures (Q4351930) (← links)
• Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic (Q4358049) (← links)
• Lower bounds for cutting planes proofs with small coefficients (Q4372903) (← links)
• Lower bounds for resolution and cutting plane proofs and monotone computations (Q4372917) (← links)
• Combinatorics with Definable Sets: Euler Characteristics and Grothendieck Rings (Q4527935) (← links)