{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:00Z","timestamp":1742913960953,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540875307"},{"type":"electronic","value":"9783540875314"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87531-4_15","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T08:40:53Z","timestamp":1220085653000},"page":"184-198","source":"Crossref","is-referenced-by-count":1,"title":["Proving Infinitude of Prime Numbers Using Binomial Coefficients"],"prefix":"10.1007","author":[{"given":"Phuong","family":"Nguyen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Bennett, J.: On Spectra. PhD thesis, Princeton University, Department of Mathematics (1962)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0049-237X(98)80017-7","volume-title":"Handbook of Proof Theory","author":"S. Buss","year":"1998","unstructured":"Buss, S.: First\u2013Order Proof Theory of Arithmetic. In: Buss, S. (ed.) Handbook of Proof Theory, pp. 79\u2013147. Elsevier, Amsterdam (1998)"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01270626","volume":"33","author":"C. Cornaros","year":"1994","unstructured":"Cornaros, C., Dimitracopoulos, C.: The Prime Number Theorem and Fragments of PA. Archive for Mathematical Logic\u00a033, 265\u2013281 (1994)","journal-title":"Archive for Mathematical Logic"},{"key":"15_CR4","unstructured":"Cook, S., Nguyen, P.: Foundations of Proof Complexity: Bounded Arithmetic and Propositional Translations (Book in progress, 2006)"},{"key":"15_CR5","unstructured":"Cook, S.: Bounded Reverse Mathematics. In: Plenary Lecture for CiE 2007 (2007)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(94)00029-3","volume":"74","author":"C. Cornaros","year":"1995","unstructured":"Cornaros, C.: On Grzegorczyk Induction. Annals of Pure and Applied Logic\u00a074, 1\u201321 (1995)","journal-title":"Annals of Pure and Applied Logic"},{"key":"15_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22156-3","volume-title":"Metamathematics of First-Order Arithmetic","author":"P. H\u00e1jek","year":"1993","unstructured":"H\u00e1jek, P., Pudl\u00e1k, P.: Metamathematics of First-Order Arithmetic. Springer, Heidelberg (1993)"},{"key":"15_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511529948","volume-title":"Bounded Arithmetic, Propositional Logic, and Complexity Theory","author":"J. Kraj\u00ed\u010dek","year":"1995","unstructured":"Kraj\u00ed\u010dek, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press, Cambridge (1995)"},{"issue":"9","key":"15_CR9","doi-asserted-by":"publisher","first-page":"624","DOI":"10.2307\/2304733","volume":"56","author":"L. Moser","year":"1949","unstructured":"Moser, L.: A theorem on the distribution of primes. American Mathematical Monthly\u00a056(9), 624\u2013625 (1949)","journal-title":"American Mathematical Monthly"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Nguyen, P., Cook, S.: Theory for TC 0and Other Small Complexity Classes. Logical Methods in Computer Science\u00a02 (2005)","DOI":"10.2168\/LMCS-2(1:3)2006"},{"key":"15_CR11","unstructured":"Nguyen, P.: Bounded Reverse Mathematics. PhD thesis, University of Toronto (2008), http:\/\/www.cs.toronto.edu\/~pnguyen\/"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen, P.: Proving Infinitude of Prime Numbers Using Binomial Coefficients (submitted, 2008), http:\/\/www.cs.toronto.edu\/~pnguyen\/","DOI":"10.1007\/978-3-540-87531-4_15"},{"issue":"4","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.2307\/2274618","volume":"53","author":"J.B. Paris","year":"1988","unstructured":"Paris, J.B., Wilkie, A.J., Woods, A.R.: Provability of the pigeonhole principle and the existence of infinitely many primes. Journal of Symbolic Logic\u00a053(4), 1235\u20131244 (1988)","journal-title":"Journal of Symbolic Logic"},{"key":"15_CR14","unstructured":"Woods, A., Cornaros, C.: On bounded arithmetic augmented by the ability to count certain sets of primes (unpublished, 2007)"},{"key":"15_CR15","unstructured":"Woods, A.: Some Problems in Logic and Number Theory and Their Connections. PhD thesis, University of Manchester (1981)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87531-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T19:04:44Z","timestamp":1738350284000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87531-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540875307","9783540875314"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87531-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}