The Bulletin of Symbolic Logic
journal article
The Complexity of Propositional Proofs
Nathan Segerlind
The Bulletin of Symbolic Logic
Vol. 13, No. 4 (Dec., 2007), pp. 417-481 (65 pages)
Published By: Association for Symbolic Logic
The Bulletin of Symbolic Logic
https://www.jstor.org/stable/4500772
This is a preview. Log in through your library.
Preview