-
1An Anti-Realist Critique of DialetheismIn Graham Priest, J. C. Beall & Bradley Armour-Garb (eds.), The Law of Non-Contradiction, Clarendon Press. 2004.
-
73Discussion. Changing the theory of theory change: reply to my criticsBritish Journal for the Philosophy of Science 48 (4): 569-586. 1997.‘Changing the Theory of Theory Change: Towards a Computational Approach’ (Tennant [1994]; henceforth CTTC) claimed that the AGM postulate of recovery is false, and that AGM contractions of theories can be more than minimally mutilating. It also described an alternative, computational method for contracting theories, called the Staining Algorithm. Makinson [1995] and Hansson and Rott [1995] criticized CTTC's arguments against AGM-theory, and its specific proposals for an alternative, computationa…Read more
-
49Perfect validity, entailment and paraconsistencyStudia Logica 43 (1-2). 1984.This paper treats entailment as a subrelation of classical consequence and deducibility. Working with a Gentzen set-sequent system, we define an entailment as a substitution instance of a valid sequent all of whose premisses and conclusions are necessary for its classical validity. We also define a sequent Proof as one in which there are no applications of cut or dilution. The main result is that the entailments are exactly the Provable sequents. There are several important corollaries. Every un…Read more
-
98What is naturalism in mathematics, really?: A critical study of P. Maddy, Naturalism in Mathematics (review)Philosophia Mathematica 8 (3): 316-338. 2000.Review of PENELOPE MADDY. Naturalism in Mathematics. Oxford: Clarendon Press, 1997
-
31Inferential semantics for first-order logic : motivating rules of inference from rules of evaluationIn T. J. Smiley, Jonathan Lear & Alex Oliver (eds.), The Force of Argument: Essays in Honor of Timothy Smiley, Routledge. pp. 223--257. 2010.
-
77On 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
-
54Is 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