Mass problems and measure-theoretic regularity

Mass problems and measure-theoretic regularity (2009)

Cached

Download Links

by Stephen G. Simpson

Citations:

BibTeX

@MISC{Simpson09massproblems,
    author = {Stephen G. Simpson},
    title = {Mass problems and measure-theoretic regularity},
    year = {2009}
}

Bookmark

OpenURL

Abstract

Research supported by NSF grants DMS-0600823 and DMS-0652637.

Citations

914	On computable numbers, with an application to the ”Entscheidungsproblem - Turing - 1936
714	Theory of recursive functions and effective computability, McGraw-Hill - Rogers - 1967
593	Introduction to Metamathematics - Kleene - 1971
411	Recursively Enumerable Sets and Degrees - Soare - 1987
294	The definition of random sequences - Martin-Löf
195	Mathematical Logic - Shoenfield - 1967
136	Subsystems of Second Order Arithmetic - Simpson - 1999
123	Algorithmic randomness and complexity - Downey, Hirschfeldt - 2010
106	Recursively enumerable sets of positive integers and their decision problems - Post - 1944
68	Computability and Randomness - Nies - 2009
67	Lowness properties and randomness - Nies - 2005
66	Degrees of Unsolvability - Lerman - 1983
38	Computable structures and the hyperarithmetical hierarchy - Ash, Knight
37	Degrees of Random Sets - Kautz - 1991
31	The upper semi-lattice of degrees of recursive unsolvability - Kleene, Post - 1954
27	Mass problems and randomness - Simpson - 2005
26	A splitting theorem for the Medvedev and Muchnik lattices. Mathematical Logic Quarterly - Binns - 2003
26	Reals which compute little - Nies - 2006
25	Almost everywhere domination - Dobrinen, Simpson - 2004
19	On a conjecture of Dobrinen and Simpson concerning almost everywhere domination - Binns, Kjos-Hanssen, et al. - 2005
19	On strong and weak reducibility of algorithmic problems - Muchnik - 1963
18	Mass problems and hyperarithmeticity - Cole, Simpson
18	Low for random reals and positive-measure domination - Kjos-Hanssen
17	Uniform almost everywhere domination - Cholak, Greenberg, et al.
16	Zur Deutung der intuitionistischen Logik - Kolmogoroff - 1932
16	An extension of the recursively enumerable Turing degrees - Simpson - 2007
15	Degrees of difficulty of the mass problem - Medvedev - 1955
15	Subsystems of second order arithmetic. Perspectives in Mathematical Logic - Simpson - 1999
11	Almost everywhere domination and superhighness - Simpson
11	Mass problems and almost everywhere domination - Simpson - 2007
10	Medvedev degrees of 2-dimensional subshifts of finite type. Ergodic Theory and Dynamical Systems - Simpson
8	Some fundamental issues concerning degrees of unsolvability, preprint - Simpson - 2006
4	editors. Logic Colloquium ’02 - Chatzidakis, Koepke, et al.
4	Degrees of Unsolvability. Number 55 in Annals of Mathematics Studies - Sacks - 1966
4	FOM: natural r.e. degrees; Pi01 classes. FOM e-mail list [13 - Simpson - 1999
4	The Gödel hierarchy and reverse mathematics - Simpson
4	Measure theory in weak subsystems of second order arithmetic - Yu - 1987
3	Classical Recursion Theory. Number 125 - Odifreddi - 1989
3	Classical Recursion Theory, Volume 2. Number 143 - Odifreddi - 1999
3	Mass problems and intuitionism - Simpson - 2007
3	Lebesgue convergence theorems and reverse mathematics - Yu - 1994
2	Set existence. Bulletin de l’Academie Polonaise des - Gandy, Kreisel, et al. - 1960
2	Logic and Computation. Contemporary Mathematics - Sieg, editor - 1990
2	FOM: priority arguments; Kleene-r.e. degrees; Pi01 classes. FOM e-mail list [13 - Simpson - 1999
2	Martin-Löf random and PA-complete sets - Stephan - 2006
2	Radon-Nikodym theorem is equivalent to arithmetical comprehension - Yu - 1990
2	Riesz representation theorem, Borel measures, and subsystems of second order arithmetic - Yu - 1993
2	A study of singular points and supports of measures in reverse mathematics - Yu - 1996
2	Measure theory and weak König’s lemma - Yu, Simpson - 1990
1	Degrees of Unsolvability, volume 2 of North-Holland Mathematics Studies - Shoenfield - 1971