Generalized R-Cohesiveness and the Arithmetical Hierarchy: A Correction to "Generalized Cohesiveness"

Journal of Symbolic Logic 67 (3):1078 - 1082 (2002)
  Copy   BIBTEX

Abstract

For $X \subseteq \omega$ , let $\lbrack X \rbrack^n$ denote the class of all n-element subsets of X. An infinite set $A \subseteq \omega$ is called n-r-cohesive if for each computable function $f: \lbrack \omega \rbrack^n \rightarrow \lbrace 0, 1 \rbrace$ there is a finite set F such that f is constant on $\lbrack A - F \rbrack^n$ . We show that for each n ≥ 2 there is no $\prod_n^0$ set $A \subseteq \omega$ 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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Generalized cohesiveness.Tamara Hummel & Carl G. Jockusch - 1999 - Journal of Symbolic Logic 64 (2):489-516.
Countable structures, Ehrenfeucht strategies, and wadge reductions.Tom Linton - 1991 - Journal of Symbolic Logic 56 (4):1325-1348.
A cardinality version of biegel's nonspeedup theorem.James C. Owings - 1989 - Journal of Symbolic Logic 54 (3):761-767.
Amoeba-absoluteness and projective measurability.Jörg Brendle - 1993 - Journal of Symbolic Logic 58 (4):1284-1290.
An ordinal partition avoiding pentagrams.Jean A. Larson - 2000 - Journal of Symbolic Logic 65 (3):969-978.

Analytics

Added to PP
2009-01-28

Downloads
44 (#362,779)

6 months
13 (#198,663)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Ramsey's theorem and recursion theory.Carl G. Jockusch - 1972 - Journal of Symbolic Logic 37 (2):268-280.
Ramsey's Theorem for Computably Enumerable Colorings.Tamara Hummel & Carl Jockusch - 2001 - Journal of Symbolic Logic 66 (2):873-880.

Add more references