Higher randomness and genericity

DOI10.1017/FMS.2017.27MaRDI QIDQ4599263zbMATH OpenOpenAlexFDO

Authors Noam Greenberg, Benoit Monin

Publication date 19 December 2017

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

Copyright license Creative Commons Attribution 4.0 International

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

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)

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

Cites work

• scientific article; zbMATH DE number 4008384 (Why is no real title available?)
• scientific article; zbMATH DE number 3715539 (Why is no real title available?)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 3411033 (Why is no real title available?)
• A formal theory of inductive inference. Part I
• Bad oracles in higher computability and randomness
• Computability and randomness
• Continuous higher randomness
• Cupping with random sets
• Defining the Turing jump
• Degrees joining to 0′
• Descriptive set theory
• Difference randomness
• Higher Kurtz randomness
• Higher randomness and forcing with closed sets
• Higher randomness and lim-sup forcing within and beyond hyperarithmetic
• Limits to joining with generics and randoms
• Low for random reals and positive-measure domination
• Lowness and nullsets
• Lowness for Kurtz randomness
• Lowness for genericity
• Lowness of higher randomness notions
• Notions of weak genericity
• Randomness in the higher setting
• Randomness via effective descriptive set theory
• Some applications of the notions of forcing and generic sets
• Some measure theoretic results in effective descriptive set theory
• The Theory of Countable Analytical Sets
• The definition of random sequences
• Theory and Applications of Models of Computation
• Two more characterizations of \(K\)-triviality

Cited in

(11)

• Genericity, Randomness, and Polynomial-Time Approximations
• scientific article; zbMATH DE number 7204368 (Why is no real title available?)
• THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
• On the interplay between effective notions of randomness and genericity
• Higher randomness and lim-sup forcing within and beyond hyperarithmetic
• Genericity and randomness with ITTMs
• The weakness of the pigeonhole principle under hyperarithmetical reductions
• Randomness in the higher setting
• Lowness of higher randomness notions
• 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)