Hostname: page-component-784d4fb959-pn44h Total loading time: 0 Render date: 2025-07-14T05:31:25.208Z Has data issue: true hasContentIssue false
  • English
  • Français

Definable structures in the lattice of recursively enumerable sets

Published online by Cambridge University Press:  12 March 2014

E. Herrmann
E. Herrmann*
Affiliation:
Humboldt-Universität, Berlin, DDR
Get access Rights & Permissions [Opens in a new window]

Abstract

It will be shown that in the lattice of recursively enumerable sets one can define elementarily with parameters a structure isomorphic to (), i.e. isomorphic to the lattice of sets together with a unary predicate selecting out exactly the sets.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 49 , Issue 4 , December 1984 , pp. 1190 - 1197
Copyright
Copyright © Association for Symbolic Logic 1984

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