The limits of tractability in Resolution-based propositional proof systems

Annals of Pure and Applied Logic 163 (6):656-668 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Quantum deduction rules.Pavel Pudlák - 2009 - Annals of Pure and Applied Logic 157 (1):16-29.
Dynamic extensions of arrow logic.Philippe Balbiani & Dimiter Vakarelov - 2004 - Annals of Pure and Applied Logic 127 (1-3):1-15.
Proof-theoretical analysis: weak systems of functions and classes.L. Gordeev - 1988 - Annals of Pure and Applied Logic 38 (1):1-121.
Propositional consistency proofs.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 52 (1-2):3-29.

Analytics

Added to PP
2013-10-27

Downloads
16 (#934,417)

6 months
6 (#588,512)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Add more references