Higher randomness and genericity

DOI10.1017/FMS.2017.27zbMATH Open1385.03042OpenAlexW2772321267MaRDI QIDQ4599263FDOQ4599263

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

Recommendations

• Randomness in the higher setting
• Continuous higher randomness
• Lowness of higher randomness notions
• On the interplay between effective notions of randomness and genericity
• Higher Kurtz randomness

zbMATH Keywords

forcinggenericityrandomnesseffectiveness

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Genericity, Randomness, and Polynomial-Time Approximations
• GENERICITY AND RANDOMNESS WITH ITTMS
• Title not available (Why is that?)
• THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
• The weakness of the pigeonhole principle under hyperarithmetical reductions
• Coding in the automorphism group of a computably categorical structure
• Continuous higher randomness

This page was built for publication: Higher randomness and genericity

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