On needed reals

DOI10.1007/BF02772209MaRDI QIDQ1885646zbMATH OpenFDO

Authors Heike Mildenberger, S. Shelah

Publication date 11 November 2004

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0104276

zbMATH Keywords

cardinal invariants dominating families needed reals Turing computable reals

Mathematics Subject Classification ID

Cardinal characteristics of the continuum (03E17) Turing machines and related notions (03D10)

Abstract: Following Blass, we call a real a ``needed for a binary relation R on the reals if in every R-adequate set we find an element from which a is Turing computable. We show that every real needed for Cof(N) is hyperarithmetic. Replacing ``R-adequate by ``R-adequate with minimal cardinality we get related notion of being ``weakly needed. We show that is is consistent that the two notions do not coincide for the reaping relation. (They coincide in many models.) We show that not all hyperarithmetical reals are needed for the reaping relation. This answers some questions asked by Blass at the Oberwolfach conference in December 1999.

Recommendations

Cites work

Cited in

(1)

Needed reals and recursion in generic reals

This page was built for publication: On needed reals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885646)