- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Provability of the pigeonhole principle and the existence of infinitely many primes
Journal of Symbolic Logic 53 (4):1235-1244 (1988)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
An induction principle and pigeonhole principles for k-finite sets.Andreas Blass - 1995 - Journal of Symbolic Logic 60 (4):1186-1193.
Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds.Jan Kraj�?Ek - 2004 - Journal of Symbolic Logic 69 (1):265-286.
Isols and the pigeonhole principle.J. C. E. Dekker & E. Ellentuck - 1989 - Journal of Symbolic Logic 54 (3):833-846.
Geometric cardinal invariants, maximal functions and a measure theoretic pigeonhole principle.Juris Steprāns - 2005 - Bulletin of Symbolic Logic 11 (4):517-525.
On strong provability predicates and the associated modal logics.Konstantin N. Ignatiev - 1993 - Journal of Symbolic Logic 58 (1):249-290.
On Tao's “finitary” infinite pigeonhole principle.Jaime Gaspar & Ulrich Kohlenbach - 2010 - Journal of Symbolic Logic 75 (1):355-371.
Polynomial size proofs of the propositional pigeonhole principle.Samuel R. Buss - 1987 - Journal of Symbolic Logic 52 (4):916-927.
Analytics
Added to PP
2009-01-28
Downloads
32 (#487,332)
6 months
9 (#290,637)
2009-01-28
Downloads
32 (#487,332)
6 months
9 (#290,637)
Historical graph of downloads
Author's Profile
Citations of this work
Bounded arithmetic and the polynomial hierarchy.Jan Krajíček, Pavel Pudlák & Gaisi Takeuti - 1991 - Annals of Pure and Applied Logic 52 (1-2):143-153.
Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.
Dual weak pigeonhole principle, Boolean complexity, and derandomization.Emil Jeřábek - 2004 - Annals of Pure and Applied Logic 129 (1-3):1-37.
Combinatorial principles in elementary number theory.Alessandro Berarducci & Benedetto Intrigila - 1991 - Annals of Pure and Applied Logic 55 (1):35-50.
Combinatorics with definable sets: Euler characteristics and grothendieck rings.Jan Krajíček & Thomas Scanlon - 2000 - Bulletin of Symbolic Logic 6 (3):311-330.
References found in this work
On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-pp8v9 uwo