Structure and Randomness in Computability and Set Theory

DOI10.1142/10661MaRDI QIDQ5221604zbMATH OpenOpenAlexFDO

Authors

Publication date 2 April 2020

Full work available at URL https://doi.org/10.1142/10661

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computability and recursion theory (03Dxx) Set theory (03Exx)

Recommendations

• scientific article; zbMATH DE number 1531917
• Computable Measure Theory and Algorithmic Randomness
• Randnomness, computability, and algebraic specifications
• Set-theoretic structure of computable sets
• Publication:3033326
• Computability, algorithmic randomness and complexity
• Computability and Randomness
• Computability and randomness
• scientific article; zbMATH DE number 2204767
• scientific article; zbMATH DE number 2047478

Cited in

(3)

• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
• Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
• Sets and computations

This page was built for publication: Structure and Randomness in Computability and Set Theory

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