Switch to: Citations

Add references

You must login to add references.
  1. Hindman's theorem: An ultrafilter argument in second order arithmetic.Henry Towsner - 2011 - Journal of Symbolic Logic 76 (1):353 - 360.
    Hindman's Theorem is a prototypical example of a combinatorial theorem with a proof that uses the topology of the ultrafilters. We show how the methods of this proof, including topological arguments about ultrafilters, can be translated into second order arithmetic.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Non-principal ultrafilters, program extraction and higher-order reverse mathematics.Alexander P. Kreuzer - 2012 - Journal of Mathematical Logic 12 (1):1250002-.
    We investigate the strength of the existence of a non-principal ultrafilter over fragments of higher-order arithmetic. Let [Formula: see text] be the statement that a non-principal ultrafilter on ℕ exists and let [Formula: see text] be the higher-order extension of ACA0. We show that [Formula: see text] is [Formula: see text]-conservative over [Formula: see text] and thus that [Formula: see text] is conservative over PA. Moreover, we provide a program extraction method and show that from a proof of a strictly (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Formalizing non-standard arguments in second-order arithmetic.Keita Yokoyama - 2010 - Journal of Symbolic Logic 75 (4):1199-1210.
    In this paper, we introduce the systems ns-ACA₀ and ns-WKL₀ of non-standard second-order arithmetic in which we can formalize non-standard arguments in ACA₀ and WKL₀, respectively. Then, we give direct transformations from non-standard proofs in ns-ACA₀ or ns-WKL₀ into proofs in ACA₀ or WKL₀.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Hindman’s theorem, ultrafilters, and reverse mathematics.Jeffry L. Hirst - 2004 - Journal of Symbolic Logic 69 (1):65-72.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Forcing in proof theory.Jeremy Avigad - 2004 - Bulletin of Symbolic Logic 10 (3):305-333.
    Paul Cohen’s method of forcing, together with Saul Kripke’s related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mathematical logic, from set theory and model theory to constructive and categorical logic. Here, I argue that forcing also has a place in traditional Hilbert-style proof theory, where the goal is to formalize portions of ordinary mathematics in restricted axiomatic theories, and study those theories in constructive or syntactic terms. I will discuss the aspects (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Ultrafilters and types on models of arithmetic.L. A. S. Kirby - 1984 - Annals of Pure and Applied Logic 27 (3):215-252.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • An effective proof that open sets are Ramsey.Jeremy Avigad - 1998 - Archive for Mathematical Logic 37 (4):235-240.
    Solovay has shown that if $\cal{O}$ is an open subset of $P(\omega)$ with code $S$ and no infinite set avoids $\cal{O}$ , then there is an infinite set hyperarithmetic in $S$ that lands in $\cal{O}$ . We provide a direct proof of this theorem that is easily formalizable in $ATR_0$.
    Download  
     
    Export citation  
     
    Bookmark   8 citations