•  13
    The dominated convergence theorem implies that if is a sequence of functions on a probability space taking values in the interval [0, 1], and converges pointwise a.e., then converges to the integral of the pointwise limit. Tao [26] has proved a quantitative version of this theorem: given a uniform bound on the rates of metastable convergence in the hypothesis, there is a bound on the rate of metastable convergence in the conclusion that is independent of the sequence and the underlying space. We…Read more
  •  39
    Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
    with Jeremy Avigad and Jason Rute
    Annals of Pure and Applied Logic 163 (12): 1854-1864. 2012.
    We analyze the pointwise convergence of a sequence of computable elements of L1 in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA0, each is equivalent to the assertion that every Gδ subset of Cantor space with positive measure has an element. This last statement is, in turn, equivalent to weak weak Königʼs lemma relativized to the Turing jump of any set. It is also equivalent to the conjunction of the …Read more
  •  14
    We present a translation of §§160-166 of Dedekind's Supplement XI to Dirichlet's Vorlesungen über Zahlentheorie, which contain an investi- gation of the sub-fields of C. In particular, Dedekind explores the lattice structure of these sub-fields, by studying isomorphisms between them. He also indicates how his ideas apply to Galois theory. After a brief introduction, we summarize the translated excerpt, emphasizing its Galois-theoretic highlights. We then take issue with Kiernan's characterizatio…Read more
  •  329
    A formal system for euclid’s elements
    Review of Symbolic Logic 2 (4): 700--768. 2009.
    We present a formal system, E, which provides a faithful model of the proofs in Euclid's Elements, including the use of diagrammatic reasoning.