•  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
  •  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.
  •  1
    Priest, G.-Beyond the Limits of Thought
    Philosophical Books 39 20-37. 1998.
  •  128
    Is every truth knowable? Reply to hand and Kvanvig
    Australasian Journal of Philosophy 79 (1). 2001.
    This Article does not have an abstract