Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-25T19:45:30.970Z Has data issue: false hasContentIssue false
  • English
  • Français

Michael O. Rabin. On recursively enumerable and arithmetic models of set theory. The Journal of symbolic logic, vol. 23 no. 4 (for 1958, pub. 1959), pp. 408–416.

Review products

Michael O. Rabin. On recursively enumerable and arithmetic models of set theory. The Journal of symbolic logic, vol. 23 no. 4 (for 1958, pub. 1959), pp. 408–416.

Published online by Cambridge University Press:  12 March 2014

J. C. Shepherdson
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 28 , Issue 2 , June 1963 , pp. 167 - 168
Copyright
Copyright © Association for Symbolic Logic 1964

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