Philosophia Mathematica 4 (2):184-189 (1996)
|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|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Harold T. Hodes (1983). A Minimal Upper Bound on a Sequence of Turing Degrees Which Represents That Sequence. Pacific Journal of Mathematics 108 (1):115-119.
Marco Molinari & Laura Petrosini (1997). Is Sequence-in/Sequence-Out a Cerebellar Mode of Operation in Cognition Too? Behavioral and Brain Sciences 20 (2):259-260.
T. E. Forster & J. K. Truss (2003). Non-Well-Foundedness of Well-Orderable Power Sets. Journal of Symbolic Logic 68 (3):879-884.
Ludomir Newelski (1999). Flat Morley Sequences. Journal of Symbolic Logic 64 (3):1261-1279.
Muriel Vandenberghe, Nicolas Schmidt, Patrick Fery & Axel Cleeremans (2006). Can Amnesic Patients Learn Without Awareness? New Evidence Comparing Deterministic and Probabilistic Sequence Learning. Neuropsychologia 44 (10):1629-1641.
V. Michele Abrusci, Jean-Yves Girard & Jacques Van De Wiele (1990). Some Uses of Dilators in Combinatorial Problems. II. Journal of Symbolic Logic 55 (1):32-40.
Added to index2009-01-28
Total downloads69 ( #12,582 of 549,013 )
Recent downloads (6 months)5 ( #15,082 of 549,013 )
How can I increase my downloads?