scientific article; zbMATH DE number 7056231

MaRDI QIDQ5376658

Robert S. Lubarsky, Cameron E. Freer, Nathanael Leedom Ackerman

Publication date: 17 May 2019

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Borel functionscomputable model theoryfeedback computability

Mathematics Subject Classification ID

Descriptive set theory (03E15) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordinal machines and admissible recursion theory
• Reflection and forcing in E-recursion theory
• Another extension of Van de Wiele's theorem
• Forcing in admissible sets
• A Survey of Mučnik and Medvedev Degrees
• COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS
• Σ₁ definitions with parameters
• Uncountable Gandy Ordinals
• Infinite time Turing machines
• Feedback Turing Computability, and Turing Computability as Feedback

This page was built for publication: