- 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
Tree-Resolution complexity of the Weak Pigeon-Hole Principle а
Complexity (forthcoming)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
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
Degree complexity for a modified pigeonhole principle.Maria Luisa Bonet & Nicola Galesi - 2003 - Archive for Mathematical Logic 42 (5):403-414.
Monotone Proofs of the Pigeon Hole Principle.R. Gavalda, A. Atserias & N. Galesi - 2001 - Mathematical Logic Quarterly 47 (4):461-474.
On the strength of several versions of Dirichlet's (“pigeon-hole”-)principle in the sense of first-order logic.T. Twer - 1981 - Archive for Mathematical Logic 21 (1):69-76.
Complexity, Natural Selection and the Evolution of Life and Humans.Börje Ekstig - 2015 - Foundations of Science 20 (2):175-187.
Complexity Measures and Decision Tree Complexity: A Survey.Harry Buhrman & Ronald de Wolf - 2002 - Theoretical Computer Science 288 (1):21–43.
The Complexity of Analytic Tableaux.Noriko H. Arai, Toniann Pitassi & Alasdair Urquhart - 2006 - Journal of Symbolic Logic 71 (3):777 - 790.
Modeling complexity in musical rhythm.Cheng-Yuan Liou, Tai-Hei Wu & Chia-Ying Lee - 2010 - Complexity 15 (4):NA-NA.
Pool resolution is NP-hard to recognize.Samuel R. Buss - 2009 - Archive for Mathematical Logic 48 (8):793-798.
String Rewriting and Proof Complexity: an interpretation of Resolution.Stefano Cavagnetto - 2009 - Reports on Mathematical Logic:167-200.
Count(q) versus the pigeon-hole principle.Søren Riis - 1997 - Archive for Mathematical Logic 36 (3):157-188.
Analytics
Added to PP
2014-03-25
Downloads
35 (#653,582)
6 months
3 (#1,486,845)
2014-03-25
Downloads
35 (#653,582)
6 months
3 (#1,486,845)
Historical graph of downloads
References found in this work
Generating hard tautologies using predicate logic and the symmetric group.S. Riis & M. Sitharam - 2000 - Logic Journal of the IGPL 8 (6):787-795.
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-667477cd97-wmc4m dc2