- 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)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
Count(q) versus the pigeon-hole principle.Søren Riis - 1997 - Archive for Mathematical Logic 36 (3):157-188.
Monotone Proofs of the Pigeon Hole Principle.R. Gavalda, A. Atserias & N. Galesi - 2001 - Mathematical Logic Quarterly 47 (4):461-474.
Pool resolution is NP-hard to recognize.Samuel R. Buss - 2009 - Archive for Mathematical Logic 48 (8):793-798.
The Complexity of Resolution Refinements.Joshua Buresh-Oppenheim & Toniann Pitassi - 2007 - Journal of Symbolic Logic 72 (4):1336 - 1352.
A Hobbesian Derivation of the Principle of Universalization.Michael Moehler - 2012 - Philosophical Studies 158 (1):83-107.
Lower Bounds for cutting planes proofs with small coefficients.Maria Bonet, Toniann Pitassi & Ran Raz - 1997 - Journal of Symbolic Logic 62 (3):708-728.
Complexity, Natural Selection and the Evolution of Life and Humans.Börje Ekstig - 2015 - Foundations of Science 20 (2):175-187.
The Complexity of Analytic Tableaux.Noriko H. Arai, Toniann Pitassi & Alasdair Urquhart - 2006 - Journal of Symbolic Logic 71 (3):777 - 790.
Logical Complexity of Some Classes of Tree Languages Generated by Multiple‐Tree‐Automata.Wojciech Buszkowski - 1980 - Mathematical Logic Quarterly 26 (1‐6):41-49.
Weak Measurement and Weak Information.Boaz Tamir & Sergei Masis - 2012 - Foundations of Physics 42 (4):531-543.
Dual weak pigeonhole principle, Boolean complexity, and derandomization.Emil Jeřábek - 2004 - Annals of Pure and Applied Logic 129 (1-3):1-37.
The relative complexity of analytic tableaux and SL-resolution.André Vellino - 1993 - Studia Logica 52 (2):323 - 337.
Analytics
Added to PP
2014-03-25
Downloads
32 (#513,753)
6 months
1 (#1,508,411)
2014-03-25
Downloads
32 (#513,753)
6 months
1 (#1,508,411)
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-8fb5884b9-srv9n uwo