Predicative foundations of arithmetic

Journal of Philosophical Logic 24 (1):1 - 17 (1995)
Abstract Predicative mathematics in the sense originating with Poincar´ e and Weyl begins by taking the natural number system for granted, proceeding immediately to real analysis and related fields. On the other hand, from a logicist or set-theoretic standpoint, this appears problematic, for, as the story is usually told, impredicative principles seem to play an essential role in the foundations of arithmetic itself.1 It is the main purpose of this paper to show that this appearance is illusory: as will emerge, a predicatively acceptable axiomatization of the natural number system can be formulated, and both the existence of structures of the relevant type and the categoricity of the relevant axioms can be proved in a predicatively acceptable way.
Keywords No keywords specified (fix it)
Categories
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,653
External links
  •   Try with proxy.
  • Through your library Configure

    Similar books and articles

    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    20 ( #61,410 of 548,979 )

    Recent downloads (6 months)

    1 ( #63,511 of 548,979 )

    How can I increase my downloads?


    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.

    Other forums