Forcing and classes of $\mathsf{HYP}$-dominating functions

Noam Greenberg; Gian Marco Osso

doi:10.48550/arxiv.2602.03391

Forcing and classes of $\mathsf{HYP}$-dominating functions

arXiv (Cornell University) 2026 Preprint Open access

Read full text

Authors: Noam Greenberg, Gian Marco Osso

DOI: 10.48550/arxiv.2602.03391

Cited by: 0

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.

Fields of Study & Subjects

Computability Logic AI Algorithms Advanced Topology and Set Theory Mathematical Dynamics and Fractals

Publication details

Journal / source: arXiv (Cornell University)
Publication date: 3 February 2026
Document type: Preprint