Recursion theory. Computational aspects of definability

DOI10.1515/9783110275643zbMATH Open1334.03003OpenAlexW4239407195MaRDI QIDQ2260474FDOQ2260474

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

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

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)

Cited In (27)

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

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)