• PhilPapers
  • PhilPeople
  • PhilArchive
  • PhilEvents
  • PhilJobs
  • Sign in
PhilPeople
 
  • Sign in
  • News Feed
  • Find Philosophers
  • Departments
  • Radar
  • Help
 
profile-cover
Drag to reposition
profile picture

Harold Hodes

Cornell University
  •  Home
  •  Publications
    60
    • Most Recent
    • Most Downloaded
    • Topics
  •  Events
    3
  •  News and Updates
    6

 More details
  • Cornell University
    Sage School of Philosophy
    Regular Faculty
Ithaca, New York, United States of America
Areas of Specialization
Science, Logic, and Mathematics
Areas of Interest
Logic and Philosophy of Logic
Philosophy of Mathematics
Epistemology
Philosophy of Language
Science, Logic, and Mathematics
  • All publications (60)
  •  1127
    On modal logics which enrich first-order S5
    Journal of Philosophical Logic 13 (4). 1984.
    Quantified Modal LogicModal LogicSemantics for Modal Logic
  •  960
    Individual-actualism and three-valued modal logics, part 1: Model-theoretic semantics
    Journal of Philosophical Logic 15 (4). 1986.
    Modal and Intensional Logic
  • Book Review. Language and Philosophical Problems. Soren Stenland. (review)
    History and Philosophy of Logic 253-6. 1993.
    Stewart Shapiro, Foundations without foundationalism: A case for second-order logic. Oxford: Clarendon Press, 1991. xvii + 277 pp. £35.00 A. Diaz, J, Echeverria and A. Ibarra (eds.), Structures in mathematical theories: Reports of the San Sebastian International Symposium, September 25‐29, 1990. Erandio (Vizcaya): Universidad del Pais Vasco, 1990, 492 pp. No price stated J. Echeverria, A. Ibarra, and T, Mormann (eds.), The space of mathematics: philosophical, epistemological, and historical expl…Read more
    Stewart Shapiro, Foundations without foundationalism: A case for second-order logic. Oxford: Clarendon Press, 1991. xvii + 277 pp. £35.00 A. Diaz, J, Echeverria and A. Ibarra (eds.), Structures in mathematical theories: Reports of the San Sebastian International Symposium, September 25‐29, 1990. Erandio (Vizcaya): Universidad del Pais Vasco, 1990, 492 pp. No price stated J. Echeverria, A. Ibarra, and T, Mormann (eds.), The space of mathematics: philosophical, epistemological, and historical explorations, Berlin and New York: Walter de Gruyter, 1992. xvii + 422 pp., DM 228.00 Jean-Michel Salanskis and Hourya Sinaceur (eds.) Le labyrinthe du continu. Paris: Springer‐Verlag France, 1992. xi + 452 pp. No price stated J. Largeault (ed.) Intuitionisme et théorie de la démonstration. Textes de Bernays, Brouwer, Gentzen, Gödel, Hubert, Kreisel, Weyl. Paris: Vrin, 1992. 556 pp. FF 320 Claude Panaccio, Les mots, les concepts et les choses. La sémantique de Guillaume d’Occam et le nominalisme d’aujourd’hui (Collection Analytiques, volume 3.) Montréal, Bellarmin; Paris, Vrin: 1991. 288 pp. 29,95 Can.$ Desmond Paul Henry, Medieval mereology. (Bochumer Studien zur Philosophie, volume 16.) Amsterdam and Philadelphia: B. R. Grüner, 1991. xxv + 609 pp. Dfl. 240/$130 Stefano Besoli, Il valore della verità, Studio sulla ‘logica della validità’ nelpensiero di Lotze, Firenze: Ponte alle Grazie, 1992, 238 pp. 35000 Lire The Essential Peirce, Selected Philosophical Writings. Volume 1 (1867‐1893). Edited by Nathan Houser and Christian Kloesel. Bloomington and Indian‐apolis: Indiana University Press, 1992. xli + 399 pp. £33.50 (cloth)/£15.99 (paper) Joseph Brent, Charles Sanders Peirce, A Life, Foreword by Thomas Sebeok. Bloomington and Indianapolis: Indiana University Press, 1993. xvi + 386 pp. £28.50 The Collected Papers of Bertrand Russell, Volume 6, Logical and Philosophical Papers 1909‐13, Edited by John G. Slater with the assistance of Bernd Frohmann, London and New York: Routledge, 1992, lxix + 562 pp. £100.00 Francisco Rodriguez‐Consuegra, The mathematical philosophy of Bertrand Russell: Origins and Development. Basel: Birkhäuser Verlag 1991. xiv + 236pp. SFr 98.00 J. Alberto Coffa, The semantic tradition from Kant to Carnap: to the Vienna station, Cambridge: Cambridge University Press, 1991. xi + 445 pp. No price stated Peter Simons. Philosophy and logic in central Europe from Bolzano to Tar ski: selected essays. Dordrecht, Kluwer, 1992. xiv + 441 pp. DA230, $139.00/£79.00 Imre Ruzsa, Intensional logic revisited, Budapest: 1991. viii + 146pp. No price stated W. T. Parry and E. A. Hacker, Aristotelian logic. Albany, NY: State University of New York Press, 1991. x + 545 pp. $49,50 (boards)/$16.95 (paper) P. Bailhache, Essai de logique déontique. Paris: Vrin, 1991. 224 pp. 168F G. Sher, The bounds of logic, A generalized viewpoint, Cambridge, Massachusetts and London, England: The MIT Press, 1991. xv + 178 pp Julian Roberts, The logic of reflection. New Haven and London: Yale University Press, 1992. vii + 307 pp, £25.00 S. Stenlund, Language and Philosophical Problems. London: Routledge, 1990. 231 pp. £35.00 G. Corsi, M, L, Dalla Chiara and G. C, Ghirardi (eds,), Bridging the gap: philosophy, mathematics, and physics, Dordrecht: Kluwer, 1993, xi + 320pp, Dfl. 175/£60.00 Katalin G. Havas, Thought, Language and Reality in Logic. Budapest: Akadémiai Kiadö, 1992. 211 pp. $22.00 K. Devlin, Logic and Information. Cambridge: Cambridge University Press, 1991. xii + 308 pp. £17.95 Bernard Bolzano, Les paradoxes de l’infini, Introduction and translation by Hourya Sinaceur. Paris: Seuil, 1993. 192pp. 140 Ffr Denis Vernant, La philosophie mathématique de Russell. Paris: Vrin, 1993. 509pp. 174 Ffr Anita Burdman Feferman, Politics, logic, and love: The life of Jean van Heijenoort. London: Jones and Bartlett, 1993. xv + 415pp. $29.95.
    Philosophy of Language, General WorksLogic and Philosophy of LogicLogic and Philosophy of Logic, Mis…Read more
    Philosophy of Language, General WorksLogic and Philosophy of LogicLogic and Philosophy of Logic, MiscellaneousLogics
  •  73
    Wang Hao. Reflections on Kurt Gödel. Bradford books. The MIT Press, Cambridge, Mass., and London, 1987, xxvi + 336 pp (review)
    Journal of Symbolic Logic 54 (3): 1095-1098. 1989.
    Logic and Philosophy of LogicLogic and Philosophy of Logic, Miscellaneous
  •  148
    Annual meeting of the Association for Symbolic Logic, New York City, December 1987
    with Nicholas Goodman, Carl G. Jockusch, and Kenneth McAloon
    Journal of Symbolic Logic 53 (4): 1287-1299. 1988.
    Logic and Philosophy of LogicLogic and Philosophy of Logic, MiscNelson Goodman
  •  175
    Review: Jaakko Hintikka, The Principles of Mathematics Revisited (review)
    Journal of Symbolic Logic 63 (4): 1615-1623. 1998.
    Philosophy of Mathematics, MiscEpistemic Logic
  •  1635
    Logicism and the ontological commitments of arithmetic
    Journal of Philosophy 81 (3): 123-149. 1984.
    Logicism in MathematicsPhilosophy of LanguageNumbers
  •  896
    Corrections to "where do sets come from?"
    Journal of Symbolic Logic 56 (4): 1486. 1991.
    Logic and Philosophy of Logic, MiscellaneousOntology of Sets
  •  91
    Book Review. Abstract Objects. Bob Hale. (review)
    International Studies in Philosophy 24 (3): 146-48. 1992.
    Abstract ObjectsScience, Logic, and Mathematics
  •  818
    Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy
    Journal of Symbolic Logic 46 (4): 753-760. 1981.
    Where AR is the set of arithmetic Turing degrees, 0 (ω ) is the least member of { $\mathbf{\alpha}^{(2)}|\mathbf{a}$ is an upper bound on AR}. This situation is quite different if we examine HYP, the set of hyperarithmetic degrees. We shall prove (Corollary 1) that there is an a, an upper bound on HYP, whose hyperjump is the degree of Kleene's O. This paper generalizes this example, using an iteration of the jump operation into the transfinite which is based on results of Jensen and is detailed …Read more
    Where AR is the set of arithmetic Turing degrees, 0 (ω ) is the least member of { $\mathbf{\alpha}^{(2)}|\mathbf{a}$ is an upper bound on AR}. This situation is quite different if we examine HYP, the set of hyperarithmetic degrees. We shall prove (Corollary 1) that there is an a, an upper bound on HYP, whose hyperjump is the degree of Kleene's O. This paper generalizes this example, using an iteration of the jump operation into the transfinite which is based on results of Jensen and is detailed in [3] and [4]. In $\S1$ we review the basic definitions from [3] which are needed to state the general results
    Logic and Philosophy of Logic, MiscellaneousMathematical Logic
  •  150
    Ontological Reduction
    Philosophical Review 84 (3): 439. 1975.
    ReductionOntology
  •  1300
    Individual-actualism and three-valued modal logics, part 2: Natural-deduction formalizations
    Journal of Philosophical Logic 16 (1). 1987.
    Modal and Intensional LogicNonclassical Logics
  •  54
    Book Review. Reflections. Kurt Godel. (review)
    THe Journal for Symbolic Logic 54 (3): 1095-98. 1989.
  •  754
    Well-behaved modal logics
    Journal of Symbolic Logic 49 (4): 1393-1402. 1984.
    Modal and Intensional Logic
  •  554
    An Exact Pair for the Arithmetic Degrees Whose Join is Not a Weak Uniform Upper Bound
    Recursive Function Theory-Newsletters 28. 1982.
    Proof uses forcing on perfect trees for 2-quantifier sentences in the language of arithmetic. The result extends to exact pairs for the hyperarithmetic degrees.
    Mathematical Logic
  •  921
    Some theorems on the expressive limitations of modal languages
    Journal of Philosophical Logic 13 (1). 1984.
    Quantified Modal LogicModal Logic
  •  1202
    More about uniform upper Bounds on ideals of Turing degrees
    Journal of Symbolic Logic 48 (2): 441-457. 1983.
    Let I be a countable jump ideal in $\mathscr{D} = \langle \text{The Turing degrees}, \leq\rangle$ . The central theorem of this paper is: a is a uniform upper bound on I iff a computes the join of an I-exact pair whose double jump a (1) computes. We may replace "the join of an I-exact pair" in the above theorem by "a weak uniform upper bound on I". We also answer two minimality questions: the class of uniform upper bounds on I never has a minimal member; if ∪ I = L α [ A] ∩ ω ω for α admissible …Read more
    Let I be a countable jump ideal in $\mathscr{D} = \langle \text{The Turing degrees}, \leq\rangle$ . The central theorem of this paper is: a is a uniform upper bound on I iff a computes the join of an I-exact pair whose double jump a (1) computes. We may replace "the join of an I-exact pair" in the above theorem by "a weak uniform upper bound on I". We also answer two minimality questions: the class of uniform upper bounds on I never has a minimal member; if ∪ I = L α [ A] ∩ ω ω for α admissible or a limit of admissibles, the same holds for nice uniform upper bounds. The central technique used in proving these theorems consists in this: by trial and error construct a generic sequence approximating the desired object; simultaneously settle definitely on finite pieces of that object; make sure that the guessing settles down to the object determined by the limit of these finite pieces
    Logic and Philosophy of Logic, MiscellaneousMathematical Logic
  •  859
    Finite level borel games and a problem concerning the jump hierarchy
    Journal of Symbolic Logic 49 (4): 1301-1318. 1984.
    Logic and Philosophy of Logic, MiscellaneousSet Theory
  •  156
    Book Review. Basic Set Theory. Azriel Levy (review)
    Philosophical Review 90 (2): 298-300. 1981.
    Set TheoryEthics
  •  1020
    Uniform Upper Bounds on Ideals of Turing Degrees
    Journal of Symbolic Logic 43 (3): 601-612. 1978.
    Logic and Philosophy of Logic, MiscellaneousMathematical Logic
  • Association for Symbolic Logic
    with Jon Barwise, Howard S. Becker, Chi Tat Chong, Herbert B. Enderton, Michael Hallett, C. Ward Henson, Neil Immerman, Phokion Kolaitis, and Alistair Lachlan
    Bulletin of Symbolic Logic 4 (4): 465-510. 1998.
    Science, Logic, and MathematicsLogic and Philosophy of Logic, Misc
  •  170
    On some concepts associated with finite cardinal numbers
    Behavioral and Brain Sciences 31 (6): 657-658. 2008.
    I catalog several concepts associated with finite cardinals, and then invoke them to interpret and evaluate several passages in Rips et al.'s target article. Like the literature it discusses, the article seems overly quick to ascribe the possession of certain concepts to children (and of set-theoretic concepts to non-mathematicians)
    Number TheoryPhilosophy of PsychologyConcepts
  •  55
    Jumping to a Uniform Upper Bound
    Proceedings of the American Mathematical Society 85 (4): 600-602. 1982.
    A uniform upper bound on a class of Turing degrees is the Turing degree of a function which parametrizes the collection of all functions whose degree is in the given class. I prove that if a is a uniform upper bound on an ideal of degrees then a is the jump of a degree c with this additional property: there is a uniform bound b<a so that b V c < a.
    Mathematics
  •  91
    Book Review. The Lambda-Calculus. H. P. Barendregt( (review)
    Philosophical Review 97 (1): 132-7. 1988.
    Mathematics
  •  1223
    Why Ramify?
    Notre Dame Journal of Formal Logic 56 (2): 379-415. 2015.
    This paper considers two reasons that might support Russell’s choice of a ramified-type theory over a simple-type theory. The first reason is the existence of purported paradoxes that can be formulated in any simple-type language, including an argument that Russell considered in 1903. These arguments depend on certain converse-compositional principles. When we take account of Russell’s doctrine that a propositional function is not a constituent of its values, these principles turn out to be too …Read more
    This paper considers two reasons that might support Russell’s choice of a ramified-type theory over a simple-type theory. The first reason is the existence of purported paradoxes that can be formulated in any simple-type language, including an argument that Russell considered in 1903. These arguments depend on certain converse-compositional principles. When we take account of Russell’s doctrine that a propositional function is not a constituent of its values, these principles turn out to be too implausible to make these arguments troubling. The second reason is conditional on a substitutional interpretation of quantification over types other than that of individuals. This reason stands up to investigation: a simple-type language will not sustain such an interpretation, but a ramified-type language will. And there is evidence that Russell was tacitly inclined towards such an interpretation. A strong construal of that interpretation opens a way to make sense of Russell’s simultaneous repudiation of propositions and his willingness to quantify over them. But that way runs into trouble with Russell’s commitment to the finitude of human understanding.
    Logic and Philosophy of LogicHigher-Order MetaphysicsType Theory in MathematicsRussell: Theory of Ty…Read more
    Logic and Philosophy of LogicHigher-Order MetaphysicsType Theory in MathematicsRussell: Theory of Types
  •  724
    Axioms for actuality
    Journal of Philosophical Logic 13 (1). 1984.
    Indexicals and DemonstrativesQuantified Modal LogicModal LogicSemantics for Modal Logic
  •  964
    The composition of Fregean thoughts
    Philosophical Studies 41 (2). 1982.
    Fregean and Russellian ContentsFrege: Thoughts
  •  929
    Ontological Commitments, Thick and Thin
    In George Boolos (ed.), Method, Reason and Language: Essays in Honor of Hilary Putnam, Cambridge University Press. pp. 235-260. 1990.
    Discourse carries thin commitment to objects of a certain sort iff it says or implies that there are such objects. It carries a thick commitment to such objects iff an account of what determines truth-values for its sentences say or implies that there are such objects. This paper presents two model-theoretic semantics for mathematical discourse, one reflecting thick commitment to mathematical objects, the other reflecting only a thin commitment to them. According to the latter view, for example,…Read more
    Discourse carries thin commitment to objects of a certain sort iff it says or implies that there are such objects. It carries a thick commitment to such objects iff an account of what determines truth-values for its sentences say or implies that there are such objects. This paper presents two model-theoretic semantics for mathematical discourse, one reflecting thick commitment to mathematical objects, the other reflecting only a thin commitment to them. According to the latter view, for example, the semantic role of number-words is not designation but rather the encoding of cardinality-quantifiers. I also present some reasons for preferring this view.
    Aspects of ReferenceScience, Logic, and Mathematics
  •  320
    Harold Hodes: Bibliography
    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.
    Mathematical Logic
  • Book Review. Logic and Its Limits. P Shaw. (review)
    History and Philosophy of Logic 5 (2): 251. 1984.
    Logic and Philosophy of LogicLogic and Philosophy of Logic, MiscellaneousLogic and Philosophy of Log…Read more
    Logic and Philosophy of LogicLogic and Philosophy of Logic, MiscellaneousLogic and Philosophy of Logic, General Works
  • Prev.
  • 1
  • 2
  • Next
PhilPeople logo

On this site

  • Find a philosopher
  • Find a department
  • The Radar
  • Index of professional philosophers
  • Index of departments
  • Help
  • Acknowledgments
  • Careers
  • Contact us
  • Terms and conditions

Brought to you by

  • The PhilPapers Foundation
  • The American Philosophical Association
  • Centre for Digital Philosophy, Western University
PhilPeople is currently in Beta Sponsored by the PhilPapers Foundation and the American Philosophical Association
Feedback