Switch to: References

Add citations

You must login to add citations.
  1. A model-theoretic approach to ordinal analysis.Jeremy Avigad & Richard Sommer - 1997 - Bulletin of Symbolic Logic 3 (1):17-52.
    We describe a model-theoretic approach to ordinal analysis via the finite combinatorial notion of an α-large set of natural numbers. In contrast to syntactic approaches that use cut elimination, this approach involves constructing finite sets of numbers with combinatorial properties that, in nonstandard instances, give rise to models of the theory being analyzed. This method is applied to obtain ordinal analyses of a number of interesting subsystems of first- and second-order arithmetic.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Bootstrapping, part I.Sedki Boughattas & J. -P. Ressayre - 2010 - Annals of Pure and Applied Logic 161 (4):511-533.
    We construct models of the integers, to yield: witnessing, independence and separation results for weak systems of bounded induction.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The Contribution of Zygmunt Ratajczyk to the Foundations of Arithmetic.Roman Murawski - 1995 - Notre Dame Journal of Formal Logic 36 (4):502-504.
    Zygmunt Ratajczyk was a deep and subtle mathematician who, with mastery, used sophisticated and technically complex methods, in particular combinatorial and proof-theoretic ones. Walking always along his own paths and being immune from actual trends and fashions he hesitated to publish his results, looking endlessly for their improvement.
    Download  
     
    Export citation  
     
    Bookmark  
  • Some variations of the Hardy hierarchy.Henryk Kotlarski - 2005 - Mathematical Logic Quarterly 51 (4):417.
    We study some variations of the so-called Hardy hierarchy of quickly growing functions, known from the literature, and obtain analogues of Ratajczyk's approximation lemma for them.
    Download  
     
    Export citation  
     
    Bookmark  
  • More on lower bounds for partitioning α-large sets.Henryk Kotlarski, Bożena Piekart & Andreas Weiermann - 2007 - Annals of Pure and Applied Logic 147 (3):113-126.
    Continuing the earlier research from [T. Bigorajska, H. Kotlarski, Partitioning α-large sets: some lower bounds, Trans. Amer. Math. Soc. 358 4981–5001] we show that for the price of multiplying the number of parts by 3 we may construct partitions all of whose homogeneous sets are much smaller than in [T. Bigorajska, H. Kotlarski, Partitioning α-large sets: some lower bounds, Trans. Amer. Math. Soc. 358 4981–5001]. We also show that the Paris–Harrington independent statement remains unprovable if the number of colors is (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency.Dan E. Willard - 2005 - Journal of Symbolic Logic 70 (4):1171-1209.
    This article will study a class of deduction systems that allow for a limited use of the modus ponens method of deduction. We will show that it is possible to devise axiom systems α that can recognize their consistency under a deduction system D provided that: (1) α treats multiplication as a 3-way relation (rather than as a total function), and that (2) D does not allow for the use of a modus ponens methodology above essentially the levels of Π1 (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations