Harold Hodes: Bibliography
| Abstract | An Exact Pair for the Arithmetic Degrees whose join is not a Weak Uniform Upper Bound, in the Recursive Function Theory-Newsletters, No. 28, August-September 1982. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,711 |
| External links |
|
| Through your library | Only published papers are available at libraries |
Harold T. Hodes (1990). Where Do the Natural Numbers Come From? Synthese 84 (3):347-407.
Harold T. Hodes (2006). Structural Proof Theory. Philosophical Review 115 (2):255-258.
Harold T. Hodes (1981). Upper Bounds on Locally Countable Admissible Initial Segments of a Turing Degree Hierarchy. Journal of Symbolic Logic 46 (4):753-760.
Harold T. Hodes (1976). Book Review. Logic and Arithmetic, Volume I. D Bostock. [REVIEW] Journal of Philosophy 73 (6):149-57.
Harold T. Hodes (1984). Logicism and the Ontological Commitments of Arithmetic. Journal of Philosophy 81 (3):123-149.
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.
Harold T. Hodes (1978). Uniform Upper Bounds on Ideals of Turing Degrees. Journal of Symbolic Logic 43 (3):601-612.
Harold T. Hodes (1982). Jumping to a Uniform Upper Bound. Proceedings of the American Mathematical Society 85 (4):600-602.
Harold T. Hodes (1983). More About Uniform Upper Bounds on Ideals of Turing Degrees. Journal of Symbolic Logic 48 (2):441-457.
Harold T. Hodes (1982). An Exact Pair for the Arithmetic Degrees Whose Join is Not a Weak Uniform Upper Bound. Recursive Function Theory-Newsletters 28.
Monthly downloads |
Added to index2009-01-28Total downloads8 ( #123,255 of 551,007 )Recent downloads (6 months)0How can I increase my downloads? |

