Hostname: page-component-7c8c6479df-7qhmt Total loading time: 0 Render date: 2024-03-28T22:55:32.983Z Has data issue: false hasContentIssue false

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 (2000), pp. 1338–1346.

Published online by Cambridge University Press:  15 January 2014

Arnold Beckmann*
Affiliation:
Institut für Algebra und Computermathematik, Technische Universität Wien, Wiedner Hauptstraße 8–10, A-1040 Vienna, Austria. beckmann@logic.at.

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Copyright
Copyright © Association for Symbolic Logic 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)