5 research outputs found
The cohesive principle and the Bolzano-Weierstra{\ss} principle
The aim of this paper is to determine the logical and computational strength
of instances of the Bolzano-Weierstra{\ss} principle (BW) and a weak variant of
it.
We show that BW is instance-wise equivalent to the weak K\"onig's lemma for
-trees (-WKL). This means that from every bounded
sequence of reals one can compute an infinite -0/1-tree, such that
each infinite branch of it yields an accumulation point and vice versa.
Especially, this shows that the degrees d >> 0' are exactly those containing an
accumulation point for all bounded computable sequences.
Let BW_weak be the principle stating that every bounded sequence of real
numbers contains a Cauchy subsequence (a sequence converging but not
necessarily fast). We show that BW_weak is instance-wise equivalent to the
(strong) cohesive principle (StCOH) and - using this - obtain a classification
of the computational and logical strength of BW_weak. Especially we show that
BW_weak does not solve the halting problem and does not lead to more than
primitive recursive growth. Therefore it is strictly weaker than BW. We also
discuss possible uses of BW_weak.Comment: corrected typos, slightly improved presentatio
Generalized cohesiveness
We study some generalized notions of cohesiveness which arise naturally in
connection with effective versions of Ramsey's Theorem. An infinite set of
natural numbers is --cohesive (respectively, --r--cohesive) if is
almost homogeneous for every computably enumerable (respectively, computable)
--coloring of the --element sets of natural numbers. (Thus the
--cohesive and --r--cohesive sets coincide with the cohesive and
r--cohesive sets, respectively.) We consider the degrees of unsolvability and
arithmetical definability levels of --cohesive and --r--cohesive sets.
For example, we show that for all , there exists a
--cohesive set. We improve this result for by showing that there is
a --cohesive set. We show that the --cohesive and
--r--cohesive degrees together form a linear, non--collapsing hierarchy of
degrees for . In addition, for we characterize the jumps
of --cohesive degrees as exactly the degrees {\bf \geq \jump{0}{(n+1)}}
and show that each --r--cohesive degree has jump {\bf > \jump{0}{(n)}}
Low sets without subsets of higher many-one degree
Given a reducibility , we say that an infinite set is -introimmune if is not -reducible to any of its subsets with .
We consider the many-one reducibility and we prove the existence of a low -introimmune set in and the existence of a low bi--introimmune set