Logical foundations of proof complexity

&
Bulletin of Symbolic Logic 17 (3):462-464 (2011)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2178/bsl/1309952322

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

Succinctness as a source of complexity in logical formalisms.Georg Gottlob, Nicola Leone & Helmut Veith - 1999 - Annals of Pure and Applied Logic 97 (1-3):231-260.
The Idea of a Proof-Theoretic Semantics and the Meaning of the Logical Operations.Heinrich Wansing - 2000 - Studia Logica 64 (1):3-20.
The proof complexity of linear algebra.Michael Soltys & Stephen Cook - 2004 - Annals of Pure and Applied Logic 130 (1-3):277-323.
Upper bounds on complexity of Frege proofs with limited use of certain schemata.Pavel Naumov - 2006 - Archive for Mathematical Logic 45 (4):431-446.
Proof Complexity and Textual Cohesion.Eli Dresner - 2015 - Journal of Logic, Language and Information 24 (1):53-64.
Quantified propositional calculus and a second-order theory for NC1.Stephen Cook & Tsuyoshi Morioka - 2005 - Archive for Mathematical Logic 44 (6):711-749.
Proof Theory and Logical Complexity. [REVIEW]Helmut Pfeifer - 1991 - Annals of Pure and Applied Logic 53 (4):197.
On meta complexity of propositional formulas and propositional proofs.Pavel Naumov - 2008 - Archive for Mathematical Logic 47 (1):35-52.
The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
Reinflating Logical Consequence.Owen Griffiths - 2012 - Journal of Philosophical Logic (1):1-9.
Continual Vision and Cosmopolitan Orthodoxy.Daniel H. Calhoun - 1979 - History and Theory 18 (3):257-286.
A Sound and Complete Proof Theory for Propositional Logical Contingencies.Charles Morgan, Alexander Hertel & Philipp Hertel - 2007 - Notre Dame Journal of Formal Logic 48 (4):521-530.
Proof Theory and Logical Complexity.Helmut Pfeifer & Jean-Yves Girard - 1989 - Journal of Symbolic Logic 54 (4):1493.
Early examples of resource-consciousness.Victor Pambuccian - 2004 - Studia Logica 77 (1):81 - 86.

Analytics

Added to PP
2017-02-21

Downloads
9 (#1,228,347)

6 months
2 (#1,240,909)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Phuong Tu Nguyen
University College London

Citations of this work

Justification as ignorance and logical omniscience.Daniel Waxman - 2022 - Asian Journal of Philosophy 1 (1):1-8.
Strict finitism, feasibility, and the sorites.Walter Dean - 2018 - Review of Symbolic Logic 11 (2):295-346.
Open induction in a bounded arithmetic for TC0.Emil Jeřábek - 2015 - Archive for Mathematical Logic 54 (3-4):359-394.
Real closures of models of weak arithmetic.Emil Jeřábek & Leszek Aleksander Kołodziejczyk - 2013 - Archive for Mathematical Logic 52 (1-2):143-157.
Induction rules in bounded arithmetic.Emil Jeřábek - 2020 - Archive for Mathematical Logic 59 (3-4):461-501.

View all 13 citations / Add more citations

References found in this work

No references found.

Add more references