Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T07:35:01.007Z Has data issue: false hasContentIssue false

Simplicity of recursively enumerable sets

Published online by Cambridge University Press:  12 March 2014

Robert W. Robinson*
Affiliation:
Cornell University and Institute for Advanced Study

Extract

In §1 is given a characterization of strongly hypersimple sets in terms of weak arrays which is in appearance more restrictive than the original definition. §1 also includes a new characterization of hyperhypersimple sets. This one is interesting because in §2 a characterization of dense simple sets is shown which is identical in all but the use of strong arrays instead of weak arrays. Another characterization of hyperhypersimple sets, in terms of descending sequences of sets, is given in §3. Also a theorem showing strongly contrasting behavior for simple sets is presented. In §4 a r-maximal set which is not contained in any maximal set is constructed.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1967

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

Article purchase

Temporarily unavailable