Effectivity and reducibility with ordinal Turing machines

DOI10.3233/COM-210307zbMath1500.03015arXiv1811.11630OpenAlexW3166492996MaRDI QIDQ5037207

Merlin Carl

Publication date: 28 February 2022

Published in: Computability (Search for Journal in Brave)

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

zbMATH Keywords

effective reducibilityordinal computability

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 (1)

Realisability for infinitary intuitionistic set theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Fine structure and class forcing
• Recognizable sets and Woodin cardinals: computation beyond the constructible universe
• Ordinal computability. An introduction to infinitary machines
• Towards computable analysis on the generalised real line
• Generalized Effective Reducibility
• Turing Computations On Ordinals
• On the Effectivity of Some Field Constructions
• ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS
• Tree Representations via Ordinal Machines
• Effective Mathematics of the Uncountable
• Provident sets and rudimentary set forcing
• Weihrauch Complexity in Computable Analysis
• The axiom of choice

This page was built for publication: Effectivity and reducibility with ordinal Turing machines