Generalized effective reducibility
From MaRDI portal
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.
Recommendations
Cites work
Cited in
(7)- Towards computable analysis on the generalised real line
- scientific article; zbMATH DE number 1337728 (Why is no real title available?)
- Weihrauch Complexity in Computable Analysis
- Effectivity and reducibility with ordinal Turing machines
- Algebra and Coalgebra in Computer Science
- Polynomial-time axioms of choice and polynomial-time cardinality
- Full generalized effective reducibility
This page was built for publication: Generalized effective reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188260)