Hobson’s Conception of Definable Numbers
Bibliographic Data
| ID | 21451200 |
|---|---|
| Authors | Zhao Fan (0000-0002-8683-2873, University of Canterbury, corresponding author) |
| Year | 2020 |
| Volume | 41 |
| Issue | 2 |
| Pages | 128-139 |
| Publication date | 2020-04-02 |
| Open Access | No |
| Type | ARTICLE |
| Venue | History and Philosophy of Logic (JOURNAL) |
| Journal identifiers | ISSN: 0144-5340 • E-ISSN: 1464-5149 |
| Publisher | Informa UK Limited (PUBLISHER • GB) |
| DOI | 10.1080/01445340.2020.1731784 |
| OpenAlex | W3011255931 |
| Language | EN |
| References cited | 19 |
In this paper, I explore an intriguing view of definable numbers proposed by a Cambridge mathematician Ernest Hobson, and his solution to the paradoxes of definability. Reflecting on König’s paradox and Richard’s paradox, Hobson argues that an unacceptable consequence of the paradoxes of definability is that there are numbers that are inherently incapable of finite definition. Contrast to other interpreters, Hobson analyses the problem of the paradoxes of definability lies in a dichotomy between finitely definable numbers and not finitely definable numbers. To bypass this predicament, Hobson proposes a language dependent analysis of definable numbers, where the diagonal argument is employed as a means to generate more and more definable numbers. This paper examines Hobson’s work in its historical context, and articulates his argument in detail. It concludes with a remark on Hobson’s analysis of definability and Alan Turing’s analysis of computability
Argument (complex analysis) · Computability · Context (archaeology) · Diagonal · Discrete mathematics · Epistemology · Turing · Benford’s Law and Fraud Detection · Computability, Logic, AI Algorithms · Computer Science · History · Logic, programming, and type systems · Mathematics · Philosophy
| Highly cited | No |
|---|