Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Journals
  3. Bulletin of Symbolic Logic
  4. Volume 13 Issue 4
Journal Home
Refine listing

Refine listing

Access:
Publication date:

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×
< Back to all issues

Volume 13 - Issue 4 - December 2007

Contents

Articles

  • The Complexity of Propositional Proofs

  • Nathan Segerlind
  • Published online by Cambridge University Press:
    15 January 2014, pp. 417-481

  • Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms. This is article includes a broad survey of the field, and a technical exposition of some recently developed techniques for proving lower bounds on proof sizes.

Reviews

Meeting Report

Other

Front matter

  • BSL volume 13 issue 4 Cover and Front matter

  • Published online by Cambridge University Press:
    05 July 2016, pp. f1-f7
    • Article
      • You have access
    • PDF
    • Export citation

Back matter

  • BSL volume 13 issue 4 Cover and Back matter

  • Published online by Cambridge University Press:
    05 July 2016, pp. b1-b3
    • Article
      • You have access
    • PDF
    • Export citation