Generalized Effective Reducibility

DOI10.1007/978-3-319-40189-8_23zbMath1436.03224arXiv1601.01899OpenAlexW2237532345MaRDI QIDQ3188260

Merlin Carl

Publication date: 17 August 2016

Published in: Pursuit of the Universal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.01899

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10) Axiom of choice and related propositions (03E25)

Related Items (4)

Effectivity and reducibility with ordinal Turing machines ⋮ Polynomial-time axioms of choice and polynomial-time cardinality ⋮ Towards computable analysis on the generalised real line ⋮ Weihrauch Complexity in Computable Analysis

Cites Work

• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• What is the theory without power set?
• On notions of computability-theoretic reduction between Π21 principles
• Turing Computations On Ordinals
• On the Effectivity of Some Field Constructions
• Infinite time Turing machines

This page was built for publication: Generalized Effective Reducibility