Neil Tennant

This is Part I of a two-part study of the foundations of mathematics through the lenses of (i) apriority and analyticity, and (ii) the resources supplied by Core Logic. Here we explain what is meant by apriority, as the notion applies to knowledge and possibly also to truths in general. We distinguish grounds for knowledge from grounds of truth, in light of our recent work on truthmakers. We then examine the role of apriority in the realism/anti-realism debate. We raise a hitherto unnoticed problem for any Orthodox Realist who attempts to explain the a priori

I present a general theory of abstraction operators which treats them as variable-binding term- forming operators, and provides a reasonably uniform treatment for definite descriptions, set abstracts, natural number abstraction, and real number abstraction. This minimizing, extensional and relational theory reveals a striking similarity between definite descriptions and set abstracts, and provides a clear rationale for the claim that there is a logic of sets (which is ontologically non- committal). The theory also treats both natural and real numbers as answering to a two-fold process of abstraction. The first step, of conceptual abstraction, yields the object occupying a particular position within an ordering of a certain kind. The second step, of objectual abstraction, yields the number sui generis, as the position itself within any ordering of the kind in question.

We explore the consequences, for logical system-building, of taking seriously the aim of having irredundant rules of inference, and a preference for proofs of stronger results over proofs of weaker ones. This leads one to reconsider the structural rules of REFLEXIVITY, THINNING, and CUT. REFLEXIVITY survives in the minimally necessary form $\varphi:\varphi$. Proofs have to get started. CUT is subject to a CUT-elimination theorem, to the effect that one can always make do without applications of CUT. So CUT is redundant, and should not be a rule of the system. CUT-elimination, however, in the context of the usual forms of logical rules, requires the presence, in the system, of THINNING. But THINNING, it turns out, is not really necessary. Provided only that one liberalizes the statement of certain logical rules in an appropriate way, one can make do without CUT or THINNING. From the methodological point of view of this study, the logical rules ought to be framed in this newly liberalized form. These liberalized logical rules determine the system of core logic. Given any intuitionistic Gentzen proof of $\Delta:\varphi$, one can determine from it a Core proof of some subsequent of $\Delta:\varphi$. Given any classical Gentzen proof of $\Delta:\varphi$, one can determine from it a classical Core proof of some subsequent of $\Delta:\varphi$. In both cases the Core proof is of a result at least as strong as that of the Gentzen proof; and the only structural rule used is $\varphi:\varphi$.

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.

Christopher Peacocke, in A Study of Concepts, motivates his account of possession conditions for concepts by means of an alleged parallel with the conditions under which numbers are abshacted to give the numerosity of a predicate. There are, however, logical mistakes in Peacocke's treatment of numbers, which undermine his intended analogy. Nevertheless Peacocke's account of possession conditions for concepts is not rendered inadequate simply by virtue of being deprived of the intended analogy and the motivation it was supposed to afford. His account of concepts deserves still to be considered on its own merits, even if it is more idiosyncratic for being isolated from the paradigm case of numerical abstraction. Peacocke's own account of concepts as abstract objects turns out, though, not to have the logical form that he himself was seeking for it. We show how to re-cast it in an equivalent form of the kind he requires. Then we re-formulate it so as to achieve complete generality. This exercise helps to clarify the central theses in Peacocke's account of concepts. It invites the conclusion that his account of content-determination is rather platitudinous and unoriginal — except for a claim of 'doxastic sufficiency' for content-determination, which emerges at the end of the discussion.

I use the Corcoran–Smiley interpretation of Aristotle's syllogistic as my starting point for an examination of the syllogistic from the vantage point of modern proof theory. I aim to show that fresh logical insights are afforded by a proof-theoretically more systematic account of all four figures. First I regiment the syllogisms in the Gentzen–Prawitz system of natural deduction, using the universal and existential quantifiers of standard first-order logic, and the usual formalizations of Aristotle's sentence-forms. I explain how the syllogistic is a fragment of my system of Core Logic. Then I introduce my main innovation: the use of binary quantifiers, governed by introduction and elimination rules. The syllogisms in all four figures are re-proved in the binary system, and are thereby revealed as all on a par with each other. I conclude with some comments and results about grammatical generativity, ecthesis, perfect validity, skeletal validity and Aristotle's chain principle.

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 applying the proposed restriction. A similar restriction is proposed for the converse inference, the so-called Rule of Factiveness ‘3Kϕ therefore ϕ’. The proposed restriction appears to block another Fitch-style derivation that uses the KK -thesis in order to get around..

Any 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.

Using a quantified propositional logic involving the operators it is known that and it is possible to know that, we formalize various interesting philosophical claims involved in the realism debate. We set out inferential rules for the epistemic modalities, ranging from ones that are obviously analytic, to ones that are epistemologically more substantive or even controversial. Then we investigate various aporias for the realism debate. These are constructively inconsistent triads of claims from our list: a claim expressing some sort of common ground in the debate; a characteristically anti-realist thesis about truth and knowability; and a characteristically realist thesis about determinacy of truth value. Various patterns of reductio proof for these inconsistent triads are generated, so as to display their variety. The reductio proofs use only the inferential rules set out earlier. The philosophical utility of each aporia for the anti-realist is then assessed. This involves consideration of the acceptability of the premiss expressing common ground; the strength and plausibility of the anti-realist premiss; the strength of the realist premiss that is the ultimate target of the reductio; and the analytic status of the inferential rules applied within the proof.

Written for any readers interested in better harnessing philosophy's real value, this book covers a broad range of fundamental philosophical problems and certain intellectual techniques for addressing those problems. In Introducing Philosophy: God, Mind, World, and Logic, Neil Tennant helps any student in pursuit of a 'big picture' to think independently, question received dogma, and analyse problems incisively. It also connects philosophy to other areas of study at the university, enabling all students to employ the concepts and techniques of this millennia-old discipline throughout their college careers - and beyond. KEY FEATURES AND BENEFITS: -- Investigates the philosophy of various subjects, helping students contextualize philosophy and view it as an interdisciplinary pursuit; also helps students with majors outside of philosophy to see the relationship between philosophy and their own focused academic pursuits -- Author comes from a distinguished background in Logic and Philosophy of Language, which gives the book a level of rigor, balance, and analytic focus sometimes missing from primers to philosophy -- Introduces students to various important philosophical distinctions providing skills that are important for undergraduates to develop in order to inform their study at higher levels. They are essential for further work in philosophy but they are also very beneficial for students pursuing most other disciplines -- Is much more methodologically comprehensive than competing introductions, giving the student the ability to address a wide range of philosophical problems - and not just the ones reviewed in the book -- Offers a companion website with links to apt primary sources, organized chapter-by-chapter, making unnecessary a separate Reader/Anthology of primary sources - thus providing students with all reading material necessary for the course -- Provides five to ten discussion questions for each chapter, helping instructors and students better interact with the ideas and concepts in the text.

This paper rebuts criticisms by Hintikka of the author's account of game-theoretic semantics for classical logic. At issue are (i) the role of the axiom of choice in proving the equivalence of the game-theoretic account with the standard truth-theoretic account; (ii) the alleged need for quantification over strategies when providing a game-theoretic semantics; and (iii) the role of Tarski's Convention T. As a result of the ideas marshalled in response to Hintikka, the author puts forward a new conjecture concerning the relationship among truth, meaning and translation