Review: Peter Clote, Jan Krajicek, Arithmetic, proof theory, and computational complexity [Book Review]

Journal of Symbolic Logic 60 (3):1014-1017 (1995)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275774

Links

PhilArchive



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

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

Review: Jan Krajicek, Bounded Arithmetic, Propositional Logic, and Complexity Theory. [REVIEW]P. Clote - 1999 - Journal of Symbolic Logic 64 (3):1357-1362.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
Tautologies from pseudo-random generators.Jan Krajíček - 2001 - Bulletin of Symbolic Logic 7 (2):197-212.
A saturation property of structures obtained by forcing with a compact family of random variables.Jan Krajíček - 2013 - Archive for Mathematical Logic 52 (1-2):19-28.
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
The equivalence of theories that characterize ALogTime.Phuong Nguyen - 2009 - Archive for Mathematical Logic 48 (6):523-549.
Review: Wilfried Sieg, Fragments of Arithmetic. [REVIEW]Peter G. Clote - 1987 - Journal of Symbolic Logic 52 (4):1054-1055.
The Computational Content of Classical Arithmetic to Appear in a Festschrift for Grigori Mints.Jeremy Avigad - unknown
On some formalized conservation results in arithmetic.P. Clote, P. Hájek & J. Paris - 1990 - Archive for Mathematical Logic 30 (4):201-218.
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.
Propositional Proof Systems and Fast Consistency Provers.Joost J. Joosten - 2007 - Notre Dame Journal of Formal Logic 48 (3):381-398.
Harrington’s conservation theorem redone.Fernando Ferreira & Gilda Ferreira - 2008 - Archive for Mathematical Logic 47 (2):91-100.
NP Search Problems in Low Fragments of Bounded Arithmetic.Jan Krajíček, Alan Skelley & Neil Thapen - 2007 - Journal of Symbolic Logic 72 (2):649 - 672.
Proofs and computations.Helmut Schwichtenberg - 2012 - New York: Cambridge University Press. Edited by S. S. Wainer.
Implicit Proofs.Jan Krajíček - 2004 - Journal of Symbolic Logic 69 (2):387 - 397.

Analytics

Added to PP
2013-11-22

Downloads
14 (#968,362)

6 months
2 (#1,240,909)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references