•  1319
    The Modal Theory Of Pure Identity And Some Related Decision Problems
    Mathematical Logic Quarterly 30 (26-29): 415-423. 1984.
    Relative to any reasonable frame, satisfiability of modal quantificational formulae in which “= ” is the sole predicate is undecidable; but if we restrict attention to satisfiability in structures with the expanding domain property, satisfiability relative to the familiar frames (K, K4, T, S4, B, S5) is decidable. Furthermore, relative to any reasonable frame, satisfiability for modal quantificational formulae with a single monadic predicate is undecidable ; this improves the result of Kripke co…Read more
  • 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
  •  91
    Book Review. Abstract Objects. Bob Hale. (review)
    International Studies in Philosophy 24 (3): 146-48. 1992.
  •  815
    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
  •  150
    Ontological Reduction
    Philosophical Review 84 (3): 439. 1975.
  •  54
    Book Review. Reflections. Kurt Godel. (review)
    THe Journal for Symbolic Logic 54 (3): 1095-98. 1989.
  •  551
    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.
  •  751
    Well-behaved modal logics
    Journal of Symbolic Logic 49 (4): 1393-1402. 1984.
  •  1199
    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
  •  156
    Book Review. Basic Set Theory. Azriel Levy (review)
    Philosophical Review 90 (2): 298-300. 1981.
  • 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.
  •  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)
  •  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.
  •  91
    Book Review. The Lambda-Calculus. H. P. Barendregt( (review)
    Philosophical Review 97 (1): 132-7. 1988.
  •  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
  •  917
    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