Neil Tennant

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.

I propose an anti-realist account of truth and paradox according to which the logico-semantic paradoxes are not genuine inconsistencies. The ‘global’ proofs of absurdity associated with these paradoxes cannot be brought into normal form. The account combines epistemicism about truth with a proof-theoretic diagnosis of paradoxicality. The aim is to combine a substantive philosophical account of truth with a more rigorous and technical diagnosis of the source of paradox for further consideration by logicians. Core Logic plays a central role in the account on offer. It is shown that the account is not prey to the problem of revenge paradox