Hostname: page-component-8448b6f56d-wq2xx Total loading time: 0 Render date: 2024-04-25T00:06:36.150Z Has data issue: false hasContentIssue false
  • English
  • Français

Reviews - Alfred Tarski. Preface. Undecidable theories, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1953, pp. VIII–IX. - Alfred Tarski. A general method in proofs of undecidability. Undecidable theories, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1953, pp. 3–35. - Andrzej Mostowski, Raphael M. Robinson, and Alfred Tarski. Undecidability and essential undecidability in arithmetic. Undecidable theories, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1953, pp. 39–74. - Alfred Tarski. Undecidability of the elementary theory of groups. Undecidable theories, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1953, pp. 77–87. - Bibliography. Undecidable theories, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1953, pp. 89–91. - Index. Undecidable theories, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1953, pp. 93–98.

Published online by Cambridge University Press:  12 March 2014

Martin Davis
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
The Journal of Symbolic Logic , Volume 24 , Issue 2 , June 1959 , pp. 167 - 169
Copyright
Copyright © Association for Symbolic Logic 1959

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.)