•  16
    Peacocke argues for a ‘generalized rationalism’, holding that ‘all entitlement has a fundamentally a priori component.’ (2) But his rationalism ‘differs from those of Frege and Gödel, just as theirs differ from that of Leibniz.’ He requires both substantive theories of intentional content and of understanding, and systematic formal theories of referential semantics and truth. We need an externalist theory of content: ‘Only mental states with externally individuated contents can make judgements a…Read more
  •  117
    Ultimate Normal Forms for Parallelized Natural Deductions
    Logic Journal of the IGPL 10 (3): 299-337. 2002.
    The system of natural deduction that originated with Gentzen , and for which Prawitz proved a normalization theorem, is re-cast so that all elimination rules are in parallel form. This enables one to prove a very exigent normalization theorem. The normal forms that it provides have all disjunction-eliminations as low as possible, and have no major premisses for eliminations standing as conclusions of any rules. Normal natural deductions are isomorphic to cut-free, weakening-free sequent proofs. …Read more
  •  131
  •  86
    Jogtudományi Közlöny XXXII (1977) 6, 320–329 d
    with Aw Moore, John Allen Paulos, Ad Irvine, Brian Rotman, and Mark Steiner
  •  168
  •  26
    Revamping the restriction strategy
    In Joe Salerno (ed.), New Essays on the Knowability Paradox, Oxford University Press. 2008.
    This study continues the anti-realist’s quest for a principled way to avoid Fitch’s paradox. It is proposed that the Cartesian restriction on the anti-realist’s knowability principle ‘ϕ, therefore 3Kϕ’ should be formulated as a consistency requirement not on the premise ϕ of an application of the rule, but rather on the set of assumptions on which the relevant occurrence of ϕ depends. It is stressed, by reference to illustrative proofs, how important it is to have proofs in normal form before ap…Read more
  •  185
    Cut for core logic
    Review of Symbolic Logic 5 (3): 450-479. 2012.
    The motivation for Core Logic is explained. Its system of proof is set out. It is then shown that, although the system has no Cut rule, its relation of deducibility obeys Cut with epistemic gain.
  •  128
    Is every truth knowable? Reply to hand and Kvanvig
    Australasian Journal of Philosophy 79 (1). 2001.
    This Article does not have an abstract
  •  1
    Priest, G.-Beyond the Limits of Thought
    Philosophical Books 39 20-37. 1998.
  •  148
    Frege's content-principle and relevant deducibility
    Journal of Philosophical Logic 32 (3): 245-258. 2003.
    Given the harmony principle for logical operators, compositionality ought to ensure that harmony should obtain at the level of whole contents. That is, the role of a content qua premise ought to be balanced exactly by its role as a conclusion. Frege's contextual definition of propositional content happens to exploit this balance, and one appeals to the Cut rule to show that the definition is adequate. We show here that Frege's definition remains adequate even when one relevantizes logic by aband…Read more
  •  102
    On and exist
    Analysis 40 (1): 5-7. 1980.
  •  199
    A general theory of abstraction operators
    Philosophical Quarterly 54 (214): 105-133. 2004.
    I present a general theory of abstraction operators which treats them as variable-binding term- forming operators, and provides a reasonably uniform treatment for definite descriptions, set abstracts, natural number abstraction, and real number abstraction. This minimizing, extensional and relational theory reveals a striking similarity between definite descriptions and set abstracts, and provides a clear rationale for the claim that there is a logic of sets (which is ontologically non- committa…Read more
  •  131
    Were Those Disproofs I Saw before Me?
    Analysis 44 (3). 1984.
  •  176
    I clarify how the requirement of conservative extension features in the thinking of various deflationists, and how this relates to another litmus claim, that the truth-predicate stands for a real, substantial property. I discuss how the deflationist can accommodate the result, to which Cieslinski draws attention, that non-conservativeness attends even the generalization that all logical theorems in the language of arithmetic are true. Finally I provide a four-fold categorization of various forms…Read more
  •  465
  •  120
    On the Degeneracy of the Full AGM-Theory of Theory-Revision
    Journal of Symbolic Logic 71 (2). 2006.
    A general method is provided whereby bizarre revisions of consistent theories with respect to contingent sentences that they refute can be delivered by revision-functions satisfying both the basic and the supplementary postulates of the AGM-theory of theory-revision
  •  41
    The Realm of Reason (review)
    Journal of Philosophy 102 (3): 155-162. 2005.
  •  2
    Keith Devlin, Logic and Information
    Philosophia Mathematica 3 (2): 179-179. 1995.
  •  249
    The Emperor’s New Concepts
    Noûs 36 (s16): 345-377. 2002.
    Christopher Peacocke, in A Study of Concepts, motivates his account of possession conditions for concepts by means of an alleged parallel with the conditions under which numbers are abstracted to give the numerosity of a predicate. There are, however, logical mistakes in Peacocke
  •  1049
    This book is written so as to be ‘accessible to philosophers without a mathematical background’. The reviewer can assure the reader that this aim is achieved, even if only by focusing throughout on just one example of an arithmetical truth, namely ‘7+5=12’. This example’s familiarity will be reassuring; but its loneliness in this regard will not. Quantified propositions — even propositions of Goldbach type — are below the author’s radar.The author offers ‘a new kind of arithmetical epistemology’…Read more
  •  145
    We define a system IR of first-order intuitionistic relevant logic. We show that intuitionistic mathematics (on the assumption that it is consistent) can be relevantized, by virtue of the following metatheorem: any intuitionistic proof of A from a setX of premisses can be converted into a proof in IR of eitherA or absurdity from some subset ofX. Thus IR establishes the same inconsistencies and theorems as intuitionistic logic, and allows one to prove every intuitionistic consequence of any consi…Read more
  •  110
    Rule-Irredundancy and the Sequent Calculus for Core Logic
    Notre Dame Journal of Formal Logic 57 (1): 105-125. 2016.
    We explore the consequences, for logical system-building, of taking seriously the aim of having irredundant rules of inference, and a preference for proofs of stronger results over proofs of weaker ones. This leads one to reconsider the structural rules of REFLEXIVITY, THINNING, and CUT. REFLEXIVITY survives in the minimally necessary form $\varphi:\varphi$. Proofs have to get started. CUT is subject to a CUT-elimination theorem, to the effect that one can always make do without applications of …Read more
  •  49
    Beth’s Theorem and Reductionism
    Pacific Philosophical Quarterly 66 (3-4): 342-354. 2017.
  •  144
    Harmony in a sequent setting
    Analysis 70 (3): 462-468. 2010.
  •  268
    On the necessary existence of numbers
    Noûs 31 (3): 307-336. 1997.
    We examine the arguments on both sides of the recent debate (Hale and Wright v. Field) on the existence, and modal status, of the natural numbers. We formulate precisely, with proper attention to denotational commitments, the analytic conditionals that link talk of numbers with talk of numerosity and with counting. These provide conceptual controls on the concept of number. We argue, against Field, that there is a serious disanalogy between the existence of God and the existence of numbers. We g…Read more