- 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
Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds
Journal of Symbolic Logic 69 (1):265-286 (2004)
Abstract
This article has no associated abstract. (fix it)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
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.
The weak pigeonhole principle for function classes in S12.Norman Danner & Chris Pollett - 2006 - Mathematical Logic Quarterly 52 (6):575-584.
Lower Bounds for dnf-refutations of a relativized weak pigeonhole principle.Albert Atserias, Moritz Müller & Sergi Oliva - 2015 - Journal of Symbolic Logic 80 (2):450-476.
Fragments of approximate counting.Samuel R. Buss, Leszek Aleksander Kołodziejczyk & Neil Thapen - 2014 - Journal of Symbolic Logic 79 (2):496-525.
Provability of the pigeonhole principle and the existence of infinitely many primes.J. B. Paris, A. J. Wilkie & A. R. Woods - 1988 - Journal of Symbolic Logic 53 (4):1235-1244.
Dual weak pigeonhole principle, Boolean complexity, and derandomization.Emil Jeřábek - 2004 - Annals of Pure and Applied Logic 129 (1-3):1-37.
Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
Feasibly constructive proofs of succinct weak circuit lower bounds.Moritz Müller & Ján Pich - 2020 - Annals of Pure and Applied Logic 171 (2):102735.
Interpolation theorems, lower Bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
Polynomial size proofs of the propositional pigeonhole principle.Samuel R. Buss - 1987 - Journal of Symbolic Logic 52 (4):916-927.
Analytics
Added to PP
2010-08-24
Downloads
13 (#288,494)
6 months
3 (#1,723,834)
2010-08-24
Downloads
13 (#288,494)
6 months
3 (#1,723,834)
Historical graph of downloads
Citations of this work
Feasibly constructive proofs of succinct weak circuit lower bounds.Moritz Müller & Ján Pich - 2020 - Annals of Pure and Applied Logic 171 (2):102735.
On the proof complexity of the nisan–wigderson generator based on a hard np ∩ conp function.Jan Krajíček - 2011 - Journal of Mathematical Logic 11 (1):11-27.
On the correspondence between arithmetic theories and propositional proof systems – a survey.Olaf Beyersdorff - 2009 - Mathematical Logic Quarterly 55 (2):116-137.
Hardness assumptions in the foundations of theoretical computer science.Jan Krajíček - 2005 - Archive for Mathematical Logic 44 (6):667-675.
Information in propositional proofs and algorithmic proof search.Jan Krajíček - 2022 - Journal of Symbolic Logic 87 (2):852-869.
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-6686886f5-2nz2h uwo