Recursion theory. Computational aspects of definability

DOI10.1515/9783110275643MaRDI QIDQ2260474zbMATH OpenOpenAlexFDO

Authors C. T. Chong, Liang Yu

Publication date 10 March 2015

Published in De Gruyter Series in Logic and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/9783110275643

zbMATH Keywords

algorithmic randomnesshigher randomnessadmissible setshigher recursion theorybiinterpretabilityhyperarithmetic degreesrecursion-theoretic forcing

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Higher recursion theory
• scientific article; zbMATH DE number 1955470
• Recursion-theoretic hierarchies
• scientific article; zbMATH DE number 194101
• scientific article; zbMATH DE number 478433

Cited in

(27)

• Basis theorem for \(\Sigma_2^1\)-sets
• scientific article; zbMATH DE number 702378 (Why is no real title available?)
• SOME CONSEQUENCES OF AND
• STRUCTURAL HIGHNESS NOTIONS
• Lawvere-Tierney topologies for computability theorists
• Measure-theoretic applications of higher Demuth's theorem
• Π11‐Martin‐Löf randomness and Π11‐Solovay completeness
• scientific article; zbMATH DE number 7204368 (Why is no real title available?)
• Turing invariant sets and the perfect set property
• Elementary descent recursion and proof theory
• scientific article; zbMATH DE number 3914314 (Why is no real title available?)
• Computability and Recursion
• Randomness in the higher setting
• Recursion theory on the reals and continuous-time computation
• Power set recursion
• On the Reals Which Cannot Be Random
• Some recent developments in higher recursion theory
• Recursion-theoretic hierarchies
• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
• An application of recursion theory to analysis
• scientific article; zbMATH DE number 65747 (Why is no real title available?)
• scientific article; zbMATH DE number 6863850 (Why is no real title available?)
• Rigidity and biinterpretability in the hyperdegrees
• Point Degree Spectra of Represented Spaces
• Higher recursion theory
• LUZIN’S (N) AND RANDOMNESS REFLECTION
• A complexity problem for Borel graphs

This page was built for publication: Recursion theory. Computational aspects of definability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2260474)