Switch to: References

Add citations

You must login to add citations.
  1. Reliability of mathematical inference.Jeremy Avigad - 2020 - Synthese 198 (8):7377-7399.
    Of all the demands that mathematics imposes on its practitioners, one of the most fundamental is that proofs ought to be correct. It has been common since the turn of the twentieth century to take correctness to be underwritten by the existence of formal derivations in a suitable axiomatic foundation, but then it is hard to see how this normative standard can be met, given the differences between informal proofs and formal derivations, and given the inherent fragility and complexity of (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Mathematics and Set Theory:数学と集合論.Sakaé Fuchino - 2018 - Journal of the Japan Association for Philosophy of Science 46 (1):33-47.
    Download  
     
    Export citation  
     
    Bookmark  
  • Carroll’s Infinite Regress and the Act of Diagramming.John Mumma - 2019 - Topoi 38 (3):619-626.
    The infinite regress of Carroll’s ‘What the Tortoise said to Achilles’ is interpreted as a problem in the epistemology of mathematical proof. An approach to the problem that is both diagrammatic and non-logical is presented with respect to a specific inference of elementary geometry.
    Download  
     
    Export citation  
     
    Bookmark  
  • PROOF THEORY. Gödel and the metamathematical tradition.Jeremy Avigad - 2010 - In Kurt Gödel, Solomon Feferman, Charles Parsons & Stephen G. Simpson (eds.), Kurt Gödel: essays for his centennial. Ithaca, NY: Association for Symbolic Logic.
    At the turn of the nineteenth century, mathematics exhibited a style of argumentation that was more explicitly computational than is common today. Over the course of the century, the introduction of abstract algebraic methods helped unify developments in analysis, number theory, geometry, and the theory of equations; and work by mathematicians like Dedekind, Cantor, and Hilbert towards the end of the century introduced set-theoretic language and infinitary methods that served to downplay or suppress computational content. This shift in emphasis away (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Proof theory in philosophy of mathematics.Andrew Arana - 2010 - Philosophy Compass 5 (4):336-347.
    A variety of projects in proof theory of relevance to the philosophy of mathematics are surveyed, including Gödel's incompleteness theorems, conservation results, independence results, ordinal analysis, predicativity, reverse mathematics, speed-up results, and provability logics.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Hilbert's program then and now.Richard Zach - 2002 - In Dale Jacquette (ed.), Philosophy of Logic. Malden, Mass.: North Holland. pp. 411–447.
    Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,” Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, “finitary” means, one should give proofs of the consistency of these axiomatic systems. Although Gödel’s incompleteness theorems show that the program as originally conceived cannot be carried out, it had many partial (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • 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   2 citations  
  • What does it take to prove fermat's last theorem? Grothendieck and the logic of number theory.Colin McLarty - 2010 - Bulletin of Symbolic Logic 16 (3):359-377.
    This paper explores the set theoretic assumptions used in the current published proof of Fermat's Last Theorem, how these assumptions figure in the methods Wiles uses, and the currently known prospects for a proof using weaker assumptions.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Understanding, formal verification, and the philosophy of mathematics.Jeremy Avigad - 2010 - Journal of the Indian Council of Philosophical Research 27:161-197.
    The philosophy of mathematics has long been concerned with deter- mining the means that are appropriate for justifying claims of mathemat- ical knowledge, and the metaphysical considerations that render them so. But, as of late, many philosophers have called attention to the fact that a much broader range of normative judgments arise in ordinary math- ematical practice; for example, questions can be interesting, theorems important, proofs explanatory, concepts powerful, and so on. The as- sociated values are often loosely classied as (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Two arguments against the generic multiverse.Toby Meadows - forthcoming - Review of Symbolic Logic:1-33.
    This paper critically examines two arguments against the generic multiverse, both of which are due to W. Hugh Woodin. Versions of the first argument have appeared a number of times in print, while the second argument is relatively novel. We shall investigate these arguments through the lens of two different attitudes one may take toward the methodology and metaphysics of set theory; and we shall observe that the impact of these arguments depends significantly on which of these attitudes is upheld. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Critical study of Michael Potter’s Reason’s Nearest Kin. [REVIEW]Richard Zach - 2005 - Notre Dame Journal of Formal Logic 46 (4):503-513.
    Critical study of Michael Potter, Reason's Nearest Kin. Philosophies of Arithmetic from Kant to Carnap. Oxford University Press, Oxford, 2000. x + 305 pages.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The metamathematics of ergodic theory.Jeremy Avigad - 2009 - Annals of Pure and Applied Logic 157 (2-3):64-76.
    The metamathematical tradition, tracing back to Hilbert, employs syntactic modeling to study the methods of contemporary mathematics. A central goal has been, in particular, to explore the extent to which infinitary methods can be understood in computational or otherwise explicit terms. Ergodic theory provides rich opportunities for such analysis. Although the field has its origins in seventeenth century dynamics and nineteenth century statistical mechanics, it employs infinitary, nonconstructive, and structural methods that are characteristically modern. At the same time, computational concerns (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A New Psychologism in Logic? Reflections from the Point of View of Belief Revision.Hans Rott - 2008 - Studia Logica 88 (1):113-136.
    This paper addresses the question whether the past couple of decades of formal research in belief revision offers evidence of a new psychologism in logic. In the first part I examine five potential arguments in favour of this thesis and find them all wanting. In the second part of the paper I argue that belief revision research has climbed up a hierarchy of models for the change of doxastic states that appear to be clearly normative at the bottom, but are (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • More infinity for a better finitism.Sam Sanders - 2010 - Annals of Pure and Applied Logic 161 (12):1525-1540.
    Elementary Recursive Nonstandard Analysis, in short ERNA, is a constructive system of nonstandard analysis with a PRA consistency proof, proposed in around 1995 by Patrick Suppes and Richard Sommer. It is based on an earlier system developed by Rolando Chuaqui and Patrick Suppes. Here, we discuss the inherent problems and limitations of the classical nonstandard framework and propose a much-needed refinement of ERNA, called , in the spirit of Karel Hrbacek’s stratified set theory. We study the metamathematics of and its (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Sur la philosophie analytique de la logique et des mathématiques. À propos de Infini, logique, géométrie de Paolo Mancosu.Yvon Gauthier - 2016 - Dialogue 55 (1):193-201.
    I offer a critical analysis of a contemporary work in analytic philosophy applied to epistemology of logic and mathematics. I discuss the reach and limits of Paolo Mancosu’s work, as recently published in a French translation.
    Download  
     
    Export citation  
     
    Bookmark  
  • La théorie des nombres chez Herbrand et Lautman.Yvon Gauthier - 2010 - Philosophiques 37 (1):149-161.
    Dans cet article, je compare les vues de Lautman et Herbrand sur la théorie des nombres et la philosophie de l’arithmétique. Je montre que, bien que Lautman eût avoué avoir été marqué par l’influence de Herbrand, les postures fondationnelles des deux amis divergent considérablement. Alors que Lautman versait dans un réalisme platonicien, Herbrand est resté fidèle au finitisme hilbertien. Il est vrai que Lautman était philosophe et que Herbrand était avant tout arithméticien et logicien, mais il demeure que l’oeuvre de (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Fermat's last theorem and Catalan's conjecture in weak exponential arithmetics.Petr Glivický & Vítězslav Kala - 2017 - Mathematical Logic Quarterly 63 (3-4):162-174.
    We study Fermat's last theorem and Catalan's conjecture in the context of weak arithmetics with exponentiation. We deal with expansions of models of arithmetical theories (in the language ) by a binary (partial or total) function e intended as an exponential. We provide a general construction of such expansions and prove that it is universal for the class of all exponentials e which satisfy a certain natural set of axioms. We construct a model and a substructure with e total and (...)
    Download  
     
    Export citation  
     
    Bookmark