Lower complexity bounds in justification logic

&
Annals of Pure and Applied Logic 163 (7):888-905 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2011.09.010

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

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

Through your library

My notes

Similar books and articles

Sharpened lower bounds for cut elimination.Samuel R. Buss - 2012 - Journal of Symbolic Logic 77 (2):656-668.
Some upper and lower bounds on decision procedures in logic.Jeanne Ferrante - 1974 - Cambridge: Project MAC, Massachusetts Institute of Technology.
Lower Bounds for cutting planes proofs with small coefficients.Maria Bonet, Toniann Pitassi & Ran Raz - 1997 - Journal of Symbolic Logic 62 (3):708-728.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
2-Exp Time lower bounds for propositional dynamic logics with intersection.Martin Lange & Carsten Lutz - 2005 - Journal of Symbolic Logic 70 (4):1072-1086.
Interpolation theorems, lower Bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
The complexity of oddan.Richard Beigel, William Gasarch, Martin Kummer, Georgia Martin, Timothy McNicholl & Frank Stephan - 2000 - Journal of Symbolic Logic 65 (1):1 - 18.
On the complexity of proof deskolemization.Matthias Baaz, Stefan Hetzl & Daniel Weller - 2012 - Journal of Symbolic Logic 77 (2):669-686.
Complexity of interpolation and related problems in positive calculi.Larisa Maksimova - 2002 - Journal of Symbolic Logic 67 (1):397-408.
Lower Bounds for resolution and cutting plane proofs and monotone computations.Pavel Pudlák - 1997 - Journal of Symbolic Logic 62 (3):981-998.
On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines.Wolfgang Maass - 1988 - Journal of Symbolic Logic 53 (4):1098-1109.
Simplified Lower Bounds for Propositional Proofs.Alasdair Urquhart & Xudong Fu - 1996 - Notre Dame Journal of Formal Logic 37 (4):523-544.
Lower Bounds for Modal Logics.Pavel Hrubeš - 2007 - Journal of Symbolic Logic 72 (3):941 - 958.

Analytics

Added to PP
2013-10-27

Downloads
46 (#338,714)

6 months
5 (#638,139)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Explicit provability and constructive semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
The logic of justification.Sergei Artemov - 2008 - Review of Symbolic Logic 1 (4):477-513.
The logic of proofs, semantically.Melvin Fitting - 2005 - Annals of Pure and Applied Logic 132 (1):1-25.
Justifications for common knowledge.Samuel Bucheli, Roman Kuznets & Thomas Studer - 2011 - Journal of Applied Non-Classical Logics 21 (1):35-60.
Derivability in certain subsystems of the Logic of Proofs is-complete.Robert Milnikel - 2007 - Annals of Pure and Applied Logic 145 (3):223-239.

View all 7 references / Add more references