Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-19T05:51:21.962Z Has data issue: false hasContentIssue false
  • English
  • Français

A. Ehrenfeucht and S. Feferman. Representability of recursively enumerable sets informal theories. Archiv für mathematische Logik und Grundlagenforschung, vol. 5 no. 1–2 (1959), pp. 37–41.

Review products

A. Ehrenfeucht and S. Feferman. Representability of recursively enumerable sets informal theories. Archiv für mathematische Logik und Grundlagenforschung, vol. 5 no. 1–2 (1959), pp. 37–41.

Published online by Cambridge University Press:  12 March 2014

R. A. DiPaola
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 32 , Issue 4 , February 1968 , pp. 530
Copyright
Copyright © Association for Symbolic Logic 1968

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