Effective Reducibility for Statements of Arbitrary Quantifier Complexity with Ordinal Turing Machines
Year: 2024
Type: preprint
Abstract: This paper is an extended version of our work in \cite{Ca2025}. We extend the concept of effective reducibility between statements of set theory with ordinal Turing machines (OTMs) explored in \cite{Ca2018} for $Π_{2}$-statements to statements of arbitrary quantifier complexity in prenex normal form and use this to compare various fundamental set-theoretical principles, including the power set axiom, the separation scheme, the collection scheme and the replacement scheme and various principles related to the notion of cardinality, with respect to effective reducibility. This notion of reducibility is both different from (i.e., strictly weaker than) classical truth and from the OTM-realizability of the corresponding implications. Along the way, we obtain a computational characterization of HOD as the class of sets that are OTM-computable relative to every effectivizer of $Σ_{2}$-separation. We also consider an associated variant or Weihrauch reducibility.
Source: arXiv (Cornell University)
Author: Carl, Merlin
Institution: Europa-Universität Flensburg
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4405030467