Generalized Effective Reducibility
Logic
2026-05-19 v1
Abstract
We introduce two notions of effective reducibility for set-theoretical statements, based on computability with Ordinal Turing Machines (OTMs), one of which resembles Turing reducibility while the other is modelled after Weihrauch reducibility. We give sample applications by showing that certain (algebraic) constructions are not effective in the OTM-sense and considerung the effective equivalence of various versions of the axiom of choice.
Cite
@article{arxiv.1601.01899,
title = {Generalized Effective Reducibility},
author = {Merlin Carl},
journal= {arXiv preprint arXiv:1601.01899},
year = {2026}
}