Mass problems and measure-theoretic regularity (2009)

by Stephen G. Simpson
Citations:4 - 3 self

Documents Related by Co-Citation

8 Extracting information is hard – Joseph Miller - 2008
5 Mass problems and intuitionism, Notre Dame – Stephen G Simpson
22 An extension of the recursively enumerable Turing degrees – Stephen G. Simpson - 2006
2 0 (α) ≤ LR z ⇐⇒ every Σ 0 α+2 set includes a Σ0,z set of the same measure. Moreover, letting bα = deg({z | 0 (α) ≤ LR z}) we have inf(bα,1) ∈ Ew and inf(bα,1) < inf(b α+1,1). 19 ,1) 1 = deg (CPA) w k REC k k r k = d C = d s g C REC d inf(a,1) inf(b ,1) α+ – Theorem - 2009
94 Computability and Randomness – André Nies
3 Mass problems and initial segment complexity – W M Phillip Hudelson
107 Metamathematics of First-Order Arithmetic – Hájek, P Pudlák - 1993
18 Π 0 1 -classes and complete extensions of PA, in: Recursion Theory Week (Oberwolfach – Antonín Kučera, Measure - 1984
25 Uniform almost everywhere domination – Peter Cholak, Noam Greenberg, Joseph, S. Miller - 2006
10 Computability on the Probability Measures on the Borel Sets of the Unit Interval – Klaus Weihrauch - 1996
4 Riesz representation theorem, Borel measures and subsystems of second-order arithmetic – Xiaokang Yu - 1993
5 Lebesgue convergence theorems and reverse mathematics – Xiaokang Yu - 1994
4 Measure theory and weak König’s lemma – Xiaokang Yu, Stephen G Simpson - 1990
5 Factorization of polynomials and – Stephen G Simpson, Rick Smith - 1986
2 THE STRENGTH OF THE RAINBOW RAMSEY THEOREM – Barbara F. Csima, Joseph R. Mileti - 2009
2 Subsystems of Second-Order Arithmetic, second edition – Stephen G Simpson - 1999
9 Applications of Martin–Löf randomness to effective probability theory – Mathieu Hoyrup, Cristóbal Rojas - 2009
3 A computational aspect of the Lebesgue differentiation theorem – Noopur Pathak - 2009
1 Hoyrup, Cristóbal Rojas, Dynamical systems, simulation, abstract computation – Stefano Galatolo, Mathieu