Forcing and classes of $\mathsf{HYP}$-dominating functions
Logic
2026-05-12 v2
Abstract
We study the question, what computational power is sufficient to perform constructions using either Laver or Hechler forcing. As a result, we obtain a separation between three relativised non-lowness classes that are the computability-theoretic analogues of three of the cardinals in Cichon's diagram.
Keywords
Cite
@article{arxiv.2602.03391,
title = {Forcing and classes of $\mathsf{HYP}$-dominating functions},
author = {Noam Greenberg and Gian Marco Osso},
journal= {arXiv preprint arXiv:2602.03391},
year = {2026}
}
Comments
Reorganized and improved exposition