Effective localization number: Building k-surviving degrees

DOI10.3233/COM-180199zbMath1480.03045arXiv1804.05041WikidataQ128508868 ScholiaQ128508868MaRDI QIDQ5211072

Noah Schweber, Iván Ongay-Valverde

Publication date: 17 January 2020

Published in: Computability (Search for Journal in Brave)

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

zbMATH Keywords

forcingcomputability theorycardinal characteristicsCichon diagram

Mathematics Subject Classification ID

Consistency and independence results (03E35) Cardinal characteristics of the continuum (03E17) Other degrees and reducibilities in computability and recursion theory (03D30) Other aspects of forcing and Boolean-valued models (03E40) Other Turing degree structures (03D28)

Related Items (1)

Evasion and prediction. V: Unsymmetric game ideals, constant prediction, and strong porosity ideals

This page was built for publication: Effective localization number: Building k-surviving degrees