•  192
    We examine the sense in which logic is a priori, and explain how mathematical theories can be dichotomized non-trivially into analytic and synthetic portions. We argue that Core Logic contains exactly the a-priori-because-analytically-valid deductive principles. We introduce the reader to Core Logic by explaining its relationship to other logical systems, and stating its rules of inference. Important metatheorems about Core Logic are reported, and its important features noted. Core Logic can ser…Read more
  •  86
    Contracting Intuitionistic Theories
    Studia Logica 80 (2-3): 369-391. 2005.
    I reformulate the AGM-account of contraction (which would yield an account also of revision). The reformulation involves using introduction and elimination rules for relational notions. Then I investigate the extent to which the two main methods of partial meet contraction and safe contraction can be employed for theories closed under intuitionistic consequence.
  •  1
    Jaakko Hintikka, The Principles of Mathematics Revisited
    Philosophia Mathematica 6 (1): 90-115. 1998.
  •  239
    Rule-Circularity and the Justification of Deduction
    Philosophical Quarterly 55 (221). 2005.
    I examine Paul Boghossian's recent attempt to argue for scepticism about logical rules. I argue that certain rule- and proof-theoretic considerations can avert such scepticism. Boghossian's 'Tonk Argument' seeks to justify the rule of tonk-introduction by using the rule itself. The argument is subjected here to more detailed proof-theoretic scrutiny than Boghossian undertook. Its sole axiom, the so-called Meaning Postulate for tonk, is shown to be false or devoid of content. It is also shown tha…Read more
  •  21
    Book Reviews (review)
    Philosophia Mathematica 3 (2): 179-207. 1995.
  •  169
    Inferentialism is explained as an attempt to provide an account of meaning that is more sensitive (than the tradition of truth-conditional theorizing deriving from Tarski and Davidson) to what is learned when one masters meanings.
  •  249
    On Turing machines knowing their own gödel-sentences
    Philosophia Mathematica 9 (1): 72-79. 2001.
    Storrs McCall appeals to a particular true but improvable sentence of formal arithmetic to argue, by appeal to its irrefutability, that human minds transcend Turing machines. Metamathematical oversights in McCall's discussion of the Godel phenomena, however, render invalid his philosophical argument for this transcendentalist conclusion
  •  67
  •  2
    Philosophy, Evolution & Human Nature
    with Florian von Schilcher
    Synthese 70 (3): 459-462. 1987.
  •  2
    Games some people would have all of us play
    Philosophia Mathematica 6 (3): 90-115. 1998.
  •  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
  •  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
  •  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
  •  131