Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T15:39:23.515Z Has data issue: false hasContentIssue false

Generalized r-cohesiveness and the arithmetical hierarchy: a correction to “Generalized cohesiveness”

Published online by Cambridge University Press:  12 March 2014

Carl G. Jockusch Jr.
Affiliation:
Department of Mathematics, University of Illinois, 1409 W. Green St., Urbana, IL 61801, USA, E-mail: jockusch@math.uiuc.edu
Tamara J. Lakins
Affiliation:
Department of Mathematics, Allegheny College, 520 N. Main St., Meadville, PA 16335, USA, E-mail: tlakins@allegheny.edu

Abstract

For X ⊆ ω, let [X]n denote the class of all n-element subsets of X. An infinite set A ⊆ ω is called n-r-cohesive if for each computable function f: [ω]n → {0, 1} there is a finite set F such that f is constant on [A − F]n. We show that for each n > 2 there is no Πn0 set A ⊆ ω which is n-r-cohesive. For n = 2 this refutes a result previously claimed by the authors, and for n ≥ 3 it answers a question raised by the authors.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2002

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