HIGHER RANDOMNESS AND GENERICITY

DOI10.1017/fms.2017.27zbMath1385.03042OpenAlexW2772321267MaRDI QIDQ4599263

Noam Greenberg, Benoit Monin

Publication date: 19 December 2017

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/fms.2017.27

zbMATH Keywords

forcingeffectivenessgenericityrandomness

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Other aspects of forcing and Boolean-valued models (03E40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Algorithmic randomness and dimension (03D32)

Related Items (6)

THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH ⋮ The weakness of the pigeonhole principle under hyperarithmetical reductions ⋮ GENERICITY AND RANDOMNESS WITH ITTMS ⋮ Unnamed Item ⋮ Coding in the automorphism group of a computably categorical structure ⋮ Continuous higher randomness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Higher Kurtz randomness
• Lowness for genericity
• Lowness of higher randomness notions
• Descriptive set theory
• Some measure theoretic results in effective descriptive set theory
• Defining the Turing jump
• Two more characterizations of \(K\)-triviality
• Bad oracles in higher computability and randomness
• RANDOMNESS IN THE HIGHER SETTING
• Higher randomness and forcing with closed sets
• Difference randomness
• Kolmogorov complexity and the Recursion Theorem
• Cupping with random sets
• Notions of weak genericity
• Lowness and nullsets
• Lowness for Kurtz randomness
• Degrees joining to 0′
• The Theory of Countable Analytical Sets
• HIGHER RANDOMNESS AND LIM-SUP FORCING WITHIN AND BEYOND HYPERARITHMETIC
• Continuous higher randomness
• Randomness via effective descriptive set theory
• Low for random reals and positive-measure domination
• Some applications of the notions of forcing and generic sets
• The definition of random sequences
• A formal theory of inductive inference. Part I
• Limits to joining with generics and randoms
• Theory and Applications of Models of Computation

This page was built for publication: HIGHER RANDOMNESS AND GENERICITY