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

forcing; computability theory; cardinal characteristics; Cichon diagram

Mathematics Subject Classification ID

03E35: Consistency and independence results

03E17: Cardinal characteristics of the continuum

03D30: Other degrees and reducibilities in computability and recursion theory

03E40: Other aspects of forcing and Boolean-valued models

03D28: Other Turing degree structures

Related Items

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