Recursion theory. Computational aspects of definability

DOI10.1515/9783110275643zbMath1334.03003OpenAlexW4239407195MaRDI QIDQ2260474

Chi Tat 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) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Related Items (15)

LUZIN’S (N) AND RANDOMNESS REFLECTION ⋮ RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY ⋮ Π11‐Martin‐Löf randomness and Π11‐Solovay completeness ⋮ SOME CONSEQUENCES OF AND ⋮ STRUCTURAL HIGHNESS NOTIONS ⋮ Turing invariant sets and the perfect set property ⋮ On the Reals Which Cannot Be Random ⋮ BASIS THEOREMS FOR -SETS ⋮ A complexity problem for Borel graphs ⋮ RANDOMNESS IN THE HIGHER SETTING ⋮ Unnamed Item ⋮ AN APPLICATION OF RECURSION THEORY TO ANALYSIS ⋮ Measure-theoretic applications of higher Demuth’s Theorem ⋮ Point Degree Spectra of Represented Spaces ⋮ Lawvere-Tierney topologies for computability theorists

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