Skip to main content Accesibility Help
×
×
Home

FRAGMENTS OF APPROXIMATE COUNTING

  • SAMUEL R. BUSS (a1), LESZEK ALEKSANDER KOŁODZIEJCZYK (a2) and NEIL THAPEN (a3)
Abstract

We study the long-standing open problem of giving $\forall {\rm{\Sigma }}_1^b$ separations for fragments of bounded arithmetic in the relativized setting. Rather than considering the usual fragments defined by the amount of induction they allow, we study Jeřábek’s theories for approximate counting and their subtheories. We show that the $\forall {\rm{\Sigma }}_1^b$ Herbrandized ordering principle is unprovable in a fragment of bounded arithmetic that includes the injective weak pigeonhole principle for polynomial time functions, and also in a fragment that includes the surjective weak pigeonhole principle for FPNP functions. We further give new propositional translations, in terms of random resolution refutations, for the consequences of $T_2^1$ augmented with the surjective weak pigeonhole principle for polynomial time functions.

Copyright
References
Hide All
[1]Beckmann, A. and Buss, S., Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic, Journal of Mathematical Logic, vol. 9 (2009), pp. 103138.
[2]Beckmann, A. and Buss, S., Characterization of definable search problems in bounded arithmetic via proof notations, Ways of Proof Theory, Ontos Verlag, Frankfurt 2010, pp. 65134.
[3]Ben-Sasson, E. and Wigderson, A., Short proofs are narrow—resolution made simple, Journal of the ACM, vol. 48 (2001), pp. 149169.
[4]Boughattas, S. and Kołodziejczyk, L. A., The strength of sharply bounded induction requires MSP, Annals of Pure and Applied Logic, vol. 161 (2010), pp. 504510.
[5]Buss, S., Bounded Arithmetic, Bibliopolis, Napoli 1986.
[6]Buss, S., Axiomatizations and conservation results for fragments of bounded arithmetic, In Logic and Computation, Proceedings of a workshop held at Carnegie Mellon University, American Mathematical Society, 1990, pp. 5784.
[7]Buss, S., First-order proof theory of arithmetic, In Handbook of Proof Theory (Buss, S., editor), Elsevier, Amsterdam 1998, pp. 79147.
[8]Buss, S. and Krajíček, J., An application of Boolean complexity to separation problems in bounded arithmetic, Proceedings of the London Mathematical Society, vol. 69 (1994), pp. 121.
[9]Chiari, M. and Krajíček, J., Witnessing functions in bounded arithmetic and search problems, this Journal, vol. 63 (1998), pp. 10951115.
[10]Chiari, M. and Krajíček, J., Lifting independence results in bounded arithmetic, Archive for Mathematical Logic, vol. 38 (1999), pp. 123138.
[11]Hájek, P. and Pudlák, P., The Metamathematics of First Order Arithmetic, Springer, Berlin 1993.
[12]Jeřábek, E., Dual weak pigeonhole principle, Boolean complexity, and derandomization, Annals of Pure and Applied Logic, vol. 129 (2004), pp. 137.
[13]Jeřábek, E., The strength of sharply bounded induction, Mathematical Logic Quarterly, vol. 52 (2006), pp. 613624.
[14]Jeřábek, E., Approximate counting in bounded arithmetic, this Journal, vol. 72 (2007), pp. 959993.
[15]Jeřábek, E., On independence of variants of the weak pigeonhole principle, Journal of Logic and Computation, vol. 17 (2007), pp. 587604.
[16]Jeřábek, E., Approximate counting by hashing in bounded arithmetic, this Journal, vol. 74 (2009), pp. 829860.
[17]Kołodziejczyk, L. A., Nguyen, P., and Thapen, N., The provably total NP search problems of weak second-order bounded arithmetic, Annals of Pure and Applied Logic, vol. 162 (2011), pp. 419446.
[18]Krajíček, J., No counter-example interpretation and interactive computation, In Logic from Computer Science (Moschovakis, Y., editor), vol. 21 (1992), Mathematical Sciences Research Institute Publications, Springer, Berlin pp. 287293.
[19]Krajíček, J., Lower bounds to the size of constant-depth propositional proofs, this Journal, vol. 59 (1994), pp. 7386.
[20]Krajíček, J., Bounded Arithmetic, Propositional Logic and Computational Complexity, Cambridge University Press, 1995.
[21]Krajíček, J., On the weak pigeonhole principle, Fundamenta Mathematicae, vol. 170 (2001),pp. 123140.
[22]Krajíček, J., Pudlák, P., and Takeuti, G., Bounded arithmetic and the polynomial hierarchy, Annals of Pure and Applied Logic, vol. 52 (1991), pp. 143153.
[23]Lauria, M., Short Res*(polylog) refutations if and only if narrow Res refutations, 2011, available at arXiv:1310.5714.
[24]Maciel, A., Pitassi, T., and Woods, A., A new proof of the weak pigeonhole principle, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 368377.
[25]Parikh, R., Existence and feasibility in arithmetic, this Journal, vol. 36 (1971), pp. 494508.
[26]Paris, J., Wilkie, A., and Woods, A., Provability of the pigeonhole principle and the existence of infinitely many primes, this Journal, vol. 53 (1988), pp. 12351244.
[27]Pudlák, P., Ramsey’s theorem in bounded arithmetic, In Computer Science Logic: Proceedings of the 4th Workshop, CSL ’90 (Börger, E., Büning, H. Kleine, Richter, M., and Schönfeld, W., editors), Springer, Berlin 1991, pp. 308317.
[28]Pudlák, P., Some relations between subsystems of arithmetic and the complexity of computations, Logic From Computer Science: Proceedings of a Workshop held November 13-17, 1989, Mathematical Sciences Research Institute Publication #21, Springer-Verlag, Berlin 1992, pp. 499519.
[29]Pudlák, P., Consistency and games—in search of new combinatorial principles, In Logic Colloquium ’03 (Stoltenberg-Hansen, V. and Väänänen, J., editors), Lecture Notes in Logic, no. 24, Association of Symbolic Logic, 2006, pp. 244281.
[30]Pudlák, P. and Thapen, N., Alternating minima and maxima, Nash equilibria and bounded arithmetic, Annals of Pure and Applied Logic, vol. 163 (2012), pp. 604614.
[31]Riis, S., Making infinite structures finite in models of second order bounded arithmetic, In Arithmetic, Proof Theory, and Computational Complexity (Clote, P. and Krajíček, J., editors), Oxford University Press, Oxford 1993, pp. 289319.
[32]Segerlind, N., Buss, S., and Impagliazzo, R., A switching lemma for small restrictions and lower bounds for k-DNF resolution, SIAM Journal on Computing, vol. 33 (2004), pp. 11711200.
[33]Skelley, A. and Thapen, N., The provably total search problems of bounded arithmetic, Proceedings of the London Mathematical Society, vol. 103 (2011), pp. 106138.
[34]Thapen, N., A model-theoretic characterization of the weak pigeonhole principle, Annals of Pure and Applied Logic, vol. 118 (2002), pp. 175195.
[35]Thapen, N., Structures interpretable in models of bounded arithmetic, Annals of Pure and Applied Logic, vol. 136 (2005), pp. 247266.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed