• Paul Benacerraf (1996). Recantation or Any Old W-Sequence Would Do After All. Philosophia Mathematica 4 (2).
    What Numbers Could Not Be’) that an adequate account of the numbers and our arithmetic practice must satisfy not only the conditions usually recognized to be necessary: (a) identify some w-sequence as the numbers, and (b) correctly characterize the cardinality relation that relates a set to a member of that sequence as its cardinal number—it must also satisfy a third condition: the ‘<’ of the sequence must be recursive. This paper argues that adding this further condition was a mistake—any w-sequence would do, no matter how undecidable its ‘<’ relation.
    In my reading list   |  Edit  |  Categorize  |  
     
    My bibliography  |
     
    Export citation | Scholar
    13 downloads  |  Added to index:2009-01-27  |  Mark as duplicate |  Delete from index