Switch to: References

Add citations

You must login to add citations.
  1. Limit spaces with approximations.Iosif Petrakis - 2016 - Annals of Pure and Applied Logic 167 (9):737-752.
  • Choice principles and constructive logics.David Dedivi - 2004 - Philosophia Mathematica 12 (3):222-243.
    to constructive systems is significant for contemporary metaphysics. However, many are surprised by these results, having learned that the Axiom of Choice (AC) is constructively valid. Indeed, even among specialists there were, until recently, reasons for puzzlement-rival versions of Intuitionistic Type Theory, one where (AC) is valid, another where it implies classical logic. This paper accessibly explains the situation, puts the issues in a broader setting by considering other choice principles, and draws philosophical morals for the understanding of quantification, choice (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Semigroups with apartness.Siniša Crvenković, Melanija Mitrović & Daniel Abraham Romano - 2013 - Mathematical Logic Quarterly 59 (6):407-414.
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Mathematical Method and Proof.Jeremy Avigad - 2006 - Synthese 153 (1):105-159.
    On a traditional view, the primary role of a mathematical proof is to warrant the truth of the resulting theorem. This view fails to explain why it is very often the case that a new proof of a theorem is deemed important. Three case studies from elementary arithmetic show, informally, that there are many criteria by which ordinary proofs are valued. I argue that at least some of these criteria depend on the methods of inference the proofs employ, and that (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   27 citations  
  • 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.
    Direct download (16 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  • Bishop's Mathematics: a Philosophical Perspective.Laura Crosilla - forthcoming - In Handbook of Bishop's Mathematics. CUP.
    Errett Bishop's work in constructive mathematics is overwhelmingly regarded as a turning point for mathematics based on intuitionistic logic. It brought new life to this form of mathematics and prompted the development of new areas of research that witness today's depth and breadth of constructive mathematics. Surprisingly, notwithstanding the extensive mathematical progress since the publication in 1967 of Errett Bishop's Foundations of Constructive Analysis, there has been no corresponding advances in the philosophy of constructive mathematics Bishop style. The aim of (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Philosophy of mathematics and computer science.Kazimierz Trzęsicki - 2010 - Studies in Logic, Grammar and Rhetoric 22 (35).
    No categories
     
    Export citation  
     
    Bookmark   1 citation  
  • “Clarifying the nature of the infinite”: The development of metamathematics and proof theory.Jeremy Avigad - manuscript
    We discuss the development of metamathematics in the Hilbert school, and Hilbert’s proof-theoretic program in particular. We place this program in a broader historical and philosophical context, especially with respect to nineteenth century developments in mathematics and logic. Finally, we show how these considerations help frame our understanding of metamathematics and proof theory today.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations