Recantation or any old w-sequence would do after all

Philosophia Mathematica 4 (2):184-189 (1996)
  Copy   BIBTEX

Abstract

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,245

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Derivatives of Computable Functions.Ning Zhong - 1998 - Mathematical Logic Quarterly 44 (3):304-316.
Patterns, Rules, and Inferences.Achille C. Varzi - 2008 - In Jonathan Eric Adler & Lance J. Rips (eds.), Reasoning: Studies of Human Inference and its Foundations. New York: Cambridge University Press. pp. 282-290.
A Note on Triple Repetition Sequence of Domination Number in Graphs.Leomarich Casinillo, Emily Casinillo & Lanndon Ocampo - 2022 - Inprime: Indonesian Journal of Pure and Applied Mathematics 4 (2):72-81.
Ordinal sequence in short-term retention of numbers.Herman Buschke & Richard Lenon - 1969 - Journal of Experimental Psychology 81 (1):201.
Cardinal sequences.István Juhász & William Weiss - 2006 - Annals of Pure and Applied Logic 144 (1-3):96-106.

Analytics

Added to PP
2009-01-28

Downloads
201 (#113,005)

6 months
6 (#746,535)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references