A. Atserias, Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms, manuscript, 2001. Google Scholar.
In this paper, we present a new proof: we show that the the weak pigeonhole principle has quasipolynomial-size proofs where every for- mula consists of a ...
People also ask
What is the weak pigeonhole principle?
What is the prove of pigeonhole principle?
What is the solution to the pigeonhole principle?
What is the pigeonhole paradox?
Atserias A(2019)Improved bounds on the Weak Pigeonhole Principle and infinitely many primes from weaker axioms ; Krajíček J · (2014)Tautologies from Pseudo-Random ...
A new proof of the weak pigeonhole principle · Alexis MacielT. PitassiAlan R. Woods. Mathematics. Symposium on the Theory of Computing. 2000. TLDR. It is shown ...
A. Atserias, Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms, manuscript, 2001. Crossref · Google Scholar.
Year: 2000 ; Type: article ; Authors Alexis Maciel, Toniann Pitassi, Alan R. Woods ; Institutions Clarkson University, University of Arizona, University of Western ...
T 2 2 is the weakest fragment of Peano's arithmetic known to be able to use counting arguments such as the weak pigeonhole principle [25] . On the other hand, ...
Abstract: We give new upper bounds for resolution proofs of the weak pigeonhole principle. We also give lower bounds for tree-like resolution proofs. We ...
Abstract. We give new upper bounds for resolution proofs of the weak pigeonhole principle. We also give lower bounds for tree-like resolution proofs.
In this paper, we present a new proof: we show that the the weak pigeonhole principle has quasipolynomial-size LK proofs where every formula consists of a ...