Neil Tennant

consistent and sufficiently strong system of first-order formal arithmetic fails to decide some independent Gödel sentence. We examine consistent first-order extensions of such systems. Our purpose is to discover what is minimally required by way of such extension in order to be able to prove the Gödel sentence in a non-trivial fashion. The extended methods of formal proof must capture the essentials of the so-called ‘semantical argument’ for the truth of the Gödel sentence. We are concerned to show that the deflationist has at his disposal such extended methods—methods which make no use or mention of a truth-predicate. This consideration leads us to reassess arguments recently advanced—one by Shapiro and another by Ketland—against the deflationist's account of truth. Their main point of agreement is this: they both adduce the Gödel phenomena as motivating a ‘thick’ notion of truth, rather than the deflationist's ‘thin’ notion. But the so-called ‘semantical argument’, which appears to involve a ‘thick’ notion of truth, does not really have to be semantical at all. It is, rather, a reflective argument. And the reflections upon a system that are contained therein are deflationarily licit, expressible without explicit use or mention of a truth-predicate. Thus it would appear that this anti-deflationist objection fails to establish that there has to be more to truth than mere conformity to the disquotational T-schema.

This study is in two parts. In the first part, various important principles of classical extensional mereology are derived on the basis of a nice axiomatization involving ‘part of’ and fusion. All results are proved here with full Fregean rigor. They are chosen because they are needed for the second part. In the second part, this natural-deduction framework is used in order to regiment David Lewis’s justification of his Division Thesis, which features prominently in his combination of mereology with class theory. The Division Thesis plays a crucial role in Lewis’s informal argument for his Second Thesis in his book Parts of Classes. In order to present Lewis’s argument in rigorous detail, an elegant new principle is offered for the theory that combines class theory and mereology. The new principle is called the Canonical Decomposition Thesis. It secures Lewis’s Division Thesis on the strong construal required in order for his argument to go through. The exercise illustrates how careful one has to be when setting up the details of an adequate foundational theory of parts and classes. The main aim behind this investigation is to determine whether an anti-realist, inferentialist theorist of meaning has the resources to exhibit Lewis’s argument for his Second Thesis—which is central to his marriage of class theory with mereology—as a purely conceptual one. The formal analysis shows that Lewis’s argument, despite its striking appearance to the contrary, can be given in the constructive, relevant logic IR. This is the logic that the author has argued, elsewhere, to be the correct logic from an anti-realist point of view. The anti-realist is therefore in a position to regard Lewis’s argument as purely conceptual.

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’, one which ‘respects certain important intuitions’ 1 : apriorism, realism, and empiricism. The book contains some clarification of these ‘isms’, and some thoughtful critiques of major positions regarding them, as espoused by such representative figures as Boghossian, Bealer, Peacocke, Field, Bostock, Maddy, Locke, Kant, C.I. Lewis, Ayer, Quine, Fodor, and McDowell. The philosophical reader will find some interest and value in these wider-ranging discussions. Our concern in this review, however, is to examine closely the original positive proposal on offer.Arithmetical truths, the author maintains, are conceptual truths. Knowing truths like 7+5=12 involves no ‘epistemic reliance on any empirical evidence’; but that, she says, is not to claim ‘epistemic independence of the senses altogether’. She wants to show that "experience grounds our concepts … and then mere conceptual examination enables us to learn arithmetical truths ." Concepts that are ‘appropriately sensitive’ to ‘the nature of [an independent] reality’ she calls grounded. Because of the role of grounded concepts, ‘arithmetical truths explain our arithmetical beliefs in the right sort of way for those beliefs to count as knowledge’ .In the context of her concentration on the special nature of arithmetical knowledge, the author offers what could strike some bystanders as an unnecessarily over-ambitious account of knowledge tout court. Knowledge, for the author, is "true belief which … "

‘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, computational approach. This paper replies as comprehensively as space allows

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 unsatisfiable set is Provably inconsistent. Every logical consequence of a satisfiable set is Provable therefrom. Thus our system is adequate for ordinary mathematical practice. Moreover, transitivity of Proof fails upon accumulation of Proofs only when the newly combined premisses are inconsistent anyway, or the conclusion is a logical truth. In either case Proofs that show this can be effectively determined from the Proofs given. Thus transitivity fails where it least matters — arguably, where it ought to fail! We show also that entailments hold by virtue of logical form insufficient either to render the premisses inconsistent or to render the conclusion logically true. The Lewis paradoxes are not Provable. Our system is distinct from Anderson and Belnap''s system of first degree entailments, and Johansson''s minimal logic. Although the Curry set paradox is still Provable within naive set theory, our system offers the prospect of a more sensitive paraconsistent reconstruction of mathematics. It may also find applications within the logic of knowledge and belief.