Bounded arithmetic and truth definition

Annals of Pure and Applied Logic 39 (1):75-104 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(88)90046-2

Other Versions

No versions found

Links

PhilArchive

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

BLASS. A., A game semantics for linear logic CENZER, D. and REMMEL, J., Polynomial-time Abehan groups CLOTE, P. and TAKEUTI, G., Bounded arithmetic for NC, ALogTIME, L and NL. [REVIEW]P. Lincoln, J. Mitchell & A. Scedrov - 1992 - Annals of Pure and Applied Logic 56:365.
Jan Krajíček, Pavel Pudlák, and Gaisi Takeuti. Bounded arithmetic and the polynomial hierarchy. Ibid., vol. 52, pp. 143–153. - Samuel R. Buss. Relating the bounded arithmetic and polynomial time hierarchies. Ibid., vol. 75, pp. 67–77. - Domenico Zambella. Notes on polynomially bounded arithmetic. The journal of symbolic logic, vol. 61, pp. 942–966.Stephen Cook - 1999 - Journal of Symbolic Logic 64 (4):1821-1823.
Separations of theories in weak bounded arithmetic.Gaisi Takeuti - 1995 - Annals of Pure and Applied Logic 71 (1):47-67.
On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
Gaisi Takeuti. Incompleteness theorems and versus. Logic Colloquium '96, Proceedings of the colloquium held in San Sebastián, Spain, July 9–15, 1996, edited by J. M. Larrazabal, D. Lascar, and G. Mints, Lecture notes in logic, no. 12, Springer, Berlin, Heidelberg, New York, etc., 1998, pp. 247–261. - Gaisi Takeuti. Gödel sentences of bounded arithmetic. The journal of symbolic logic, vol. 65, pp. 1338–1346.Arnold Beckmann - 2002 - Bulletin of Symbolic Logic 8 (3):433-435.
Takeuti Gaisi. Remarks on the truth definition. Journal of the Mathematical Society of Japan, vol. 13 , pp. 207–209.Gebhard Fuhrken - 1962 - Journal of Symbolic Logic 27 (1):110-110.
Bounded arithmetic, proof complexity and two papers of Parikh.Samuel R. Buss - 1999 - Annals of Pure and Applied Logic 96 (1-3):43-55.
Alternating minima and maxima, Nash equilibria and Bounded Arithmetic.Pavel Pudlák & Neil Thapen - 2012 - Annals of Pure and Applied Logic 163 (5):604-614.
Unprovability of consistency statements in fragments of bounded arithmetic.Samuel R. Buss & Aleksandar Ignjatović - 1995 - Annals of Pure and Applied Logic 74 (3):221-244.
Review: Gaisi Takeuti, On the Inductive Definition with Quantifiers of Second Order. [REVIEW]Kurt Schutte - 1964 - Journal of Symbolic Logic 29 (3):147-147.

Analytics

Added to PP
2014-01-16

Downloads
75 (#776,053)

6 months
15 (#809,700)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The formalization of interpretability.Albert Visser - 1991 - Studia Logica 50 (1):81 - 105.
Exponentiation and second-order bounded arithmetic.Jan Krajíček - 1990 - Annals of Pure and Applied Logic 48 (3):261-276.
A small reflection principle for bounded arithmetic.Rineke Verbrugge & Albert Visser - 1994 - Journal of Symbolic Logic 59 (3):785-812.
S 3 i andV 2 i.Gaisi Takeuti - 1990 - Archive for Mathematical Logic 29 (3):149-169.

View all 11 citations / Add more citations

References found in this work

On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.

Add more references