Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-05T17:04:23.908Z Has data issue: false hasContentIssue false
  • English
  • Français

Robert W. Robinson. Simplicity of recursively enumerable sets. The journal of symbolic logic, vol. 32 (1967), pp. 162–172. - Robert W. Robinson. Two theorems on hyperhypersimple sets. Transactions of the American Mathematical Society, vol. 128 (1967), pp. 531–538. - A. H. Lachlan. On the lattice of recursively enumerable sets. Transactions of the American Mathematical Society, vol. 130 (1968), pp. 1–37. - A. H. Lachlan. The elementary theory of recursively enumerable sets. Duke mathematical journal, vol. 35 (1968), pp. 123–146.

Review products

Robert W. Robinson. Simplicity of recursively enumerable sets. The journal of symbolic logic, vol. 32 (1967), pp. 162–172.
Robert W. Robinson. Two theorems on hyperhypersimple sets. Transactions of the American Mathematical Society, vol. 128 (1967), pp. 531–538.
A. H. Lachlan. On the lattice of recursively enumerable sets. Transactions of the American Mathematical Society, vol. 130 (1968), pp. 1–37.

Show more reviewed productsShow more reviewed products

Published online by Cambridge University Press:  12 March 2014

James C. Owings Jr.
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 35 , Issue 1 , March 1970 , pp. 153 - 155
Copyright
Copyright © Association for Symbolic Logic 1970

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