Switch to: References

Add citations

You must login to add citations.
  1. Szemerédi’s theorem: An exploration of impurity, explanation, and content.Patrick J. Ryan - 2023 - Review of Symbolic Logic 16 (3):700-739.
    In this paper I argue for an association between impurity and explanatory power in contemporary mathematics. This proposal is defended against the ancient and influential idea that purity and explanation go hand-in-hand (Aristotle, Bolzano) and recent suggestions that purity/impurity ascriptions and explanatory power are more or less distinct (Section 1). This is done by analyzing a central and deep result of additive number theory, Szemerédi’s theorem, and various of its proofs (Section 2). In particular, I focus upon the radically impure (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.
    is a fragment of first-order aritlimetic so weak that it cannot prove the totality of an iterated exponential fimction. Surprisingly, however, the theory is remarkably robust. I will discuss formal results that show that many theorems of number theory and combinatorics are derivable in elementary arithmetic, and try to place these results in a broader philosophical context.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • On Interpretations of Arithmetic and Set Theory.Richard Kaye & Tin Lok Wong - 2007 - Notre Dame Journal of Formal Logic 48 (4):497-510.
    This paper starts by investigating Ackermann's interpretation of finite set theory in the natural numbers. We give a formal version of this interpretation from Peano arithmetic (PA) to Zermelo-Fraenkel set theory with the infinity axiom negated (ZF−inf) and provide an inverse interpretation going the other way. In particular, we emphasize the precise axiomatization of our set theory that is required and point out the necessity of the axiom of transitive containment or (equivalently) the axiom scheme of ∈-induction. This clarifies the (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • On interpretations of bounded arithmetic and bounded set theory.Richard Pettigrew - 2009 - Notre Dame Journal of Formal Logic 50 (2):141-152.
    In 'On interpretations of arithmetic and set theory', Kaye and Wong proved the following result, which they considered to belong to the folklore of mathematical logic.

    THEOREM 1 The first-order theories of Peano arithmetic and Zermelo-Fraenkel set theory with the axiom of infinity negated are bi-interpretable.

    In this note, I describe a theory of sets that is bi-interpretable with the theory of bounded arithmetic IDelta0 + exp. Because of the weakness of this theory of sets, I cannot straightforwardly adapt Kaye and Wong's (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Logic in the Tractatus.Max Weiss - 2017 - Review of Symbolic Logic 10 (1):1-50.
    I present a reconstruction of the logical system of the Tractatus, which differs from classical logic in two ways. It includes an account of Wittgenstein’s “form-series” device, which suffices to express some effectively generated countably infinite disjunctions. And its attendant notion of structure is relativized to the fixed underlying universe of what is named. -/- There follow three results. First, the class of concepts definable in the system is closed under finitary induction. Second, if the universe of objects is countably (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Finite mathematics.Shaughan Lavine - 1995 - Synthese 103 (3):389 - 420.
    A system of finite mathematics is proposed that has all of the power of classical mathematics. I believe that finite mathematics is not committed to any form of infinity, actual or potential, either within its theories or in the metalanguage employed to specify them. I show in detail that its commitments to the infinite are no stronger than those of primitive recursive arithmetic. The finite mathematics of sets is comprehensible and usable on its own terms, without appeal to any form (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Finitary Set Theory.Laurence Kirby - 2009 - Notre Dame Journal of Formal Logic 50 (3):227-244.
    I argue for the use of the adjunction operator (adding a single new element to an existing set) as a basis for building a finitary set theory. It allows a simplified axiomatization for the first-order theory of hereditarily finite sets based on an induction schema and a rigorous characterization of the primitive recursive set functions. The latter leads to a primitive recursive presentation of arithmetical operations on finite sets.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Digraph parameters and finite set arithmetic.Laurence Kirby - 2015 - Mathematical Logic Quarterly 61 (4-5):250-262.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the Concept of Finitism.Luca Incurvati - 2015 - Synthese 192 (8):2413-2436.
    At the most general level, the concept of finitism is typically characterized by saying that finitistic mathematics is that part of mathematics which does not appeal to completed infinite totalities and is endowed with some epistemological property that makes it secure or privileged. This paper argues that this characterization can in fact be sharpened in various ways, giving rise to different conceptions of finitism. The paper investigates these conceptions and shows that they sanction different portions of mathematics as finitistic.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Independence and large cardinals.Peter Koellner - 2010 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • On Logical and Scientific Strength.Luca Incurvati & Carlo Nicolai - manuscript
    The notion of strength has featured prominently in recent debates about abductivism in the epistemology of logic. Following Williamson and Russell, we distinguish between logical and scientific strength and discuss the limits of the characterizations they employ. We then suggest understanding logical strength in terms of interpretability strength and scientific strength as a special case of logical strength. We present applications of the resulting notions to comparisons between logics in the traditional sense and mathematical theories.
    Download  
     
    Export citation  
     
    Bookmark   1 citation