-
369Anti-realism and logic: truth as eternalOxford University Press. 1987.Anti-realism is a doctrine about logic, language, and meaning that is based on the work of Wittgenstein and Frege. In this book, Professor Tennant clarifies and develops Dummett's arguments for anti-realism and ultimately advocates a radical reform of our logical practices.
-
71What might logic and methodology have offered the Dover School Board, had they been willing to listen?Public Affairs Quarterly 21 (2): 149-167. 2007.
-
192Logic, Mathematics, and the A Priori, Part II: Core Logic as Analytic, and as the Basis for Natural LogicismPhilosophia Mathematica 22 (3): 321-344. 2014.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
-
278Deflationism and the Gödel phenomena: Reply to KetlandMind 114 (453): 89-96. 2005.I am not a deflationist. I believe that truth and falsity are substantial. The truth of a proposition consists in its having a constructive proof, or truthmaker. The falsity of a proposition consists in its having a constructive disproof, or falsitymaker. Such proofs and disproofs will need to be given modulo acceptable premisses. The choice of these premisses will depend on the discourse in question.
-
1Jaakko Hintikka, The Principles of Mathematics RevisitedPhilosophia Mathematica 6 (1): 90-115. 1998.
-
46Theories, concepts and rationality in an evolutionary account of scienceBiology and Philosophy 3 (2): 224-231. 1988.
-
86Contracting Intuitionistic TheoriesStudia 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.
-
169Inferentialism 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.
-
239Rule-Circularity and the Justification of DeductionPhilosophical 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
-
249On Turing machines knowing their own gödel-sentencesPhilosophia 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
-
365Natural deduction and sequent calculus for intuitionistic relevant logicJournal of Symbolic Logic 52 (3): 665-680. 1987.
-
117Ultimate Normal Forms for Parallelized Natural DeductionsLogic 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
-
16Peacocke 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
-
168The Law of Excluded Middle Is Synthetic A Priori, If ValidPhilosophical Topics 24 (1): 205-229. 1996.
-
96Games some people would have all of us play: A critical study of J. Hintikka, The Principles of Mathematics Revisited (review)Philosophia Mathematica 6 (1): 226-241. 1998.
-
31Inferential semantics for first-order logic : motivating rules of inference from rules of evaluationIn Jonathan Lear & Alex Oliver (eds.), The Force of Argument: Essays in Honor of Timothy Smiley, Routledge. pp. 223--257. 2015.
-
26Revamping the restriction strategyIn 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
-
185Cut for core logicReview 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.
-
128Is every truth knowable? Reply to hand and KvanvigAustralasian Journal of Philosophy 79 (1). 2001.This Article does not have an abstract
Columbus, Ohio, United States of America