Samuel R. Buss. The undecidability of k-provability. Annals of pure and applied logic, vol. 53 , pp. 75–102

Journal of Symbolic Logic 62 (4):1480-1481 (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275653

Links

PhilArchive



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

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

The undecidability of k-provability.Samuel Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.
The undecidability of k-provability.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.
Review: Samuel R. Buss, The Undecidability of $k$-Provability. [REVIEW]Alessandra Carbone - 1997 - Journal of Symbolic Logic 62 (4):1480-1481.
ALLEN, B., Arithmetizing Uniform NC BASARAB, SA, Relative elimination of quantifiers for Hen-selian valued fields BUSS, SR, The undecidability of k-provability GALLIER, JH, What's so special about Kruskal's theorem and.A. Nesin, A. Pillay & V. Razenj - 1991 - Annals of Pure and Applied Logic 53:297.
Erratum to “Ordinal notations and well-orderings in bounded arithmetic” [Annals of Pure and Applied Logic 120 (2003) 197–223]. [REVIEW]Arnold Beckmann, Samuel R. Buss & Chris Pollett - 2003 - Annals of Pure and Applied Logic 123 (1-3):291.
Towards NP – P via proof complexity and search.Samuel R. Buss - 2012 - Annals of Pure and Applied Logic 163 (7):906-917.
On the provability logic of bounded arithmetic.Rineke Verbrugge & Alessandro Berarducci - 1991 - Annals of Pure and Applied Logic 61 (1-2):75-93.
Lower complexity bounds in justification logic.Samuel R. Buss & Roman Kuznets - 2012 - Annals of Pure and Applied Logic 163 (7):888-905.
Bounded arithmetic, proof complexity and two papers of Parikh.Samuel R. Buss - 1999 - Annals of Pure and Applied Logic 96 (1-3):43-55.
Propositional proofs and reductions between NP search problems.Samuel R. Buss & Alan S. Johnson - 2012 - Annals of Pure and Applied Logic 163 (9):1163-1182.
Preface.Samuel R. Buss, S. Barry Cooper, Benedikt Löwe & Andrea Sorbi - 2009 - Annals of Pure and Applied Logic 160 (3):229-230.
The modal logic of pure provability.Samuel R. Buss - 1990 - Notre Dame Journal of Formal Logic 31 (2):225-231.
Beckmann, A., Buss, SR and Pollett, C., Erratum to ''Ordinal.S. R. Buss - 2003 - Annals of Pure and Applied Logic 123:293.
Beckmann, A., Pollett, C. and Buss, SR, Ordinal notations.S. R. Buss - 2003 - Annals of Pure and Applied Logic 120:285.
Computability in Europe 2009.Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss & Benedikt Löwe - 2012 - Annals of Pure and Applied Logic 163 (5):483-484.

Analytics

Added to PP
2016-06-30

Downloads
12 (#1,068,950)

6 months
2 (#1,221,975)

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

No references found.

Add more references