The Taming of the True poses a broad challenge to realist views of meaning and truth that have been prominent in recent philosophy. Neil Tennant argues compellingly that every truth is knowable, and that an effective logical system can be based on this principle. He lays the foundations for global semantic anti-realism and extends its consequences from the philosophy of mathematics and logic to the theory of meaning, metaphysics, and epistemology.

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.

Neil Tennant presents an original logical system with unusual philosophical, proof-theoretic, metalogical, computational, and revision-theoretic virtues. Core Logic is the first system that ensures both relevance and adequacy for the formalization of all mathematical and scientific reasoning.

This book develops Tennant's Natural Logicist account of the foundations of the natural, rational, and real numbers. Tennant uses this framework to distinguish the logical from the intuitive aspects of the basic elements of arithmetic.

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. (shrink)

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. (shrink)

Williamson argues for the contention that substructural logics are ‘ill-suited to acting as background logics for science’. That contention, if true, would be very important, but it is refutable, given what is already known about certain substructural logics. Classical Core Logic is a substructural logic, for it eschews the structural rules of Thinning and Cut and has Reflexivity as its only structural rule. Yet it suffices for classical mathematics, and it furnishes all the proofs and disproofs one needs for the (...) hypothetico-deductive method in science. We explain exactly what Classical Core Logic is, why it is a substructural logic par excellence, and what the basic requirements would be for a logic to be ‘suited to acting as [a] background logic for science’. We also explain how Classical Core Logic meets all these requirements. We end by examining Williamson’s argument in order to expose where its error lies. (shrink)

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.

We examine the arguments on both sides of the recent debate (Hale and Wright v. Field) on the existence, and modal status, of the natural numbers. We formulate precisely, with proper attention to denotational commitments, the analytic conditionals that link talk of numbers with talk of numerosity and with counting. These provide conceptual controls on the concept of number. We argue, against Field, that there is a serious disanalogy between the existence of God and the existence of numbers. We give (...) stronger reasons than those advanced by Wright for resisting Field's analogy. We argue that the rules governing the basic numerical notions commit us to the natural numbers as necessary existents. We also show that the latest twist in the debate involving 'surdons' leaves both sides in a stalemate. (shrink)

Shows how to program on a computer (in Prolog) the effective skills taught in introductory and intermediate logic courses. The topics include the relevance of relevance, representing formulae and proofs, avoiding loops and blind alleys, and other aspects. Of interest to computational logicians, proof-theorists, cognitive scientists, and workers in artificial intelligence. Distributed by Columbia U. Press. Annotation copyright by Book News, Inc., Portland, OR.

The naive anti-realist holds the following principle: (◊K) All truths are knowable. This unrestricted generalization (◊K), as is now well known, falls prey to Fitch’s Paradox (Fitch 1963: 38, Theorem 1). It can be used as the only suspect principle, alongside others that cannot be impugned, to prove quite generally, and constructively, that the set {p, ¬Kp} is inconsistent (Tennant 1997: 261). From this it would follow, intuitionistically, that any proposition that is never actually known to be true (by anyone, (...) at any time) is false; and it would follow, classically, that every truth is known (by someone, at some time). (shrink)

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.. (shrink)

The Theory of theory change has contraction and revision as its central notions. Of these, contraction is the more fundamental. The best-known theory, due to Alchourrón, Gärdenfors, and Makinson, is based on a few central postulates. The most fundamental of these is the principle of recovery: if one contracts a theory with respect to a sentence, and then adds that sentence back again, one recovers the whole theory. Recovery is demonstrably false. This paper shows why, and investigates how one can (...) nevertheless characterize contraction in a theoretically fruitful way. The theory proposed lends itself to implementation, which in turn could yield new theoretical insights. The Main proposal is a ‘staining algorithm’ which identifies which sentences to reject when contracting a theory. The algorithm requires one to be clear about the structure of reasons one has for including sentences within one's theory. (shrink)

This is a reply to the considerations advanced by Schroeder-Heister and Tranchini as prima facie problematic for the proof-theoretic criterion of paradoxicality, as originally presented in Tennant and subsequently amended in Tennant. Countering these considerations lends new importance to the parallelized forms of elimination rules in natural deduction.

The rules for Core Logic are stated, and various important results about the system are summarized. We describe its relationship to other systems, such as Classical Logic, Intuitionistic Logic, Minimal Logic, and the Anderson–Belnap relevance logicR. A precise, positive explication is offered of what it is for the premises of a proof to connect relevantly with its conclusion. This characterization exploits the notion of positive and negative occurrences of atoms in sentences. It is shown that all Core proofs are relevant (...) in this precisely defined sense. We survey extant results about variable-sharing in rival systems of relevance logic, and find that the variable-sharing conditions established for them are weaker than the one established here for Core Logic (and for its classical extension). Proponents of other systems of relevance logic (such asRand its subsystems) are challenged to formulate a stronger variable-sharing condition, and to prove thatRor any of its subsystems satisfies it, but that Core Logic does not. We give reasons for pessimism about the prospects for meeting this challenge. (shrink)

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. (shrink)

This study examines how the Gödel phenomena are to be treated in core logic. We show in formal detail how one can use core logic in the metalanguage to prove Gödel’s incompleteness theorems for arithmetic even when classical logic is used for logical closure in the object language.

We begin with a brief explanation of our proof-theoretic criterion of paradoxicality—its motivation, its methods, and its results so far. It is a proof-theoretic account of paradoxicality that can be given in addition to, or alongside, the more familiar semantic account of Kripke. It is a question for further research whether the two accounts agree in general on what is to count as a paradox. It is also a question for further research whether and, if so, how the so-called Ekman (...) problem bears on the investigations here of the intensional paradoxes. Possible exceptions to the proof-theoretic criterion are Prior’s Theorem and Russell’s Paradox of Propositions—the two best-known ‘intensional’ paradoxes. We have not yet addressed them. We do so here. The results are encouraging. §1 studies Prior’s Theorem. In the literature on the paradoxes of intensionality, it does not enjoy rigorous formal proof of a Gentzenian kind—the kind that lends itself to proof-theoretic analysis of recondite features that might escape the attention of logicians using non-Gentzenian systems of logic. We make good that lack, both to render the criterion applicable to the formal proof, and to see whether the criterion gets it right. Prior’s Theorem is a theorem in an unfree, classical, quantified propositional logic. But if one were to insist that the logic employed be free, then Prior’s Theorem would not be a theorem at all. Its proof would have an undischarged assumption—the ‘existential presupposition’ that the proposition $$\forall p(Qp\!\rightarrow \!\lnot p)$$ ∀ p ( Q p → ¬ p ) exists. Call this proposition $$\vartheta$$ ϑ. §2 focuses on $$\vartheta$$ ϑ. We analyse a Priorean reductio of $$\vartheta$$ ϑ along with the possibilitate $$\Diamond \forall q(Qq\!\leftrightarrow \!(\vartheta \!\leftrightarrow \! q))$$ ◊ ∀ q ( Q q ↔ ( ϑ ↔ q ) ). The attempted reductio of this premise-pair, which is constructive, cannot be brought into normal form. The criterion says we have not straightforward inconsistency, but rather genuine paradoxicality. §3 turns to problems engendered by the proposition $$\exists p(Qp\wedge \lnot p)$$ ∃ p ( Q p ∧ ¬ p ) (call it $$\eta$$ η ) for the similar possibilitate $$\Diamond \forall q(Qq\!\leftrightarrow \!(\eta \!\leftrightarrow \! q))$$ ◊ ∀ q ( Q q ↔ ( η ↔ q ) ). The attempted disproof of this premise-pair—again, a constructive one—cannot succeed. It cannot be brought into normal form. The criterion says the premise-pair is a genuine paradox. In §4 we show how Russell’s Paradox of Propositions, like the Priorean intensional paradoxes, is to be classified as a genuine paradox by the proof-theoretic criterion of paradoxicality. (shrink)

AGM-theory, named after its founders Carlos Alchourrón, Peter Gärdenfors and David Makinson, is the leading contemporary paradigm in the theory of belief-revision. The theory is reformulated here so as to deal with the central relational notions 'J is a contraction of K with respect to A' and 'J is a revision of K with respect to A'. The new theory is based on a principal-case analysis of the domains of definition of the three main kinds of theory-change (expansion, contraction and (...) revision). The new theory is stated by means of introduction and elimination rules for the relational notions. In this new setting one can re-examine the relationship between contraction and revision, using the appropriate versions of the so-called Levi and Harper identities. Among the positive results are the following. One can derive the extensionality of contraction and revision, rather than merely postulating it. Moreover, one can demonstrate the existence of revision-functions satisfying a principle of monotonicity. The full set of AGM-postulates for revision-functions allow for completely bizarre revisions. This motivates a Principle of Minimal Bloating, which needs to be stated as a separate postulate for revision. Moreover, contractions obtained in the usual way from the bizarre revisions, by using the Harper identity, satisfy Recovery. This provides a new reason (in addition to several others already adduced in the literature) for thinking that the contraction postulate of Recovery fails to capture the Principle of Minimal Mutilation. So the search is still on for a proper explication of the notion of minimal mutilation, to do service in both the theory of contraction and the theory of revision. The new relational formulation of AGM-theory, based on principal-case analysis, shares with the original, functional form of AGM-theory the idealizing assumption that the belief-sets of rational agents are to be modelled as consistent, logically closed sets of sentences. The upshot of the results presented here is that the new relational theory does a better job of making important matters clear than does the original functional theory. A new setting has been provided within which one can profitably address two pressing questions for A GM-theory: (1) how is the notion of minimal mutilation (by both contractions and revisions) best analyzed? and (2) how is one to rule out unnecessary bloating by revisions? (shrink)

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

A general method is provided whereby bizarre revisions of consistent theories with respect to contingent sentences that they refute can be delivered by revision-functions satisfying both the basic and the supplementary postulates of the AGM-theory of theory-revision.

I investigate the problem of contracting a dependency-network with respect to any of its nodes. The resulting contraction must not contain the node in question, but must also be a minimal mutilation of the original network. Identifying successful and minimally mutilating contractions of dependency-networks is non-trivial, especially when non-well-founded networks are to be taken into account. I prove that the contraction problem is NP-complete.1.

We explore the problems that confront any attempt to explain or explicate exactly what a primitive logical rule of inferenceis, orconsists in. We arrive at a proposed solution that places a surprisingly heavy load on the prospect of being able to understand and deal with specifications of rules that are essentiallyself-referring. That is, any rule$\rho $is to be understood via a specification that involves, embedded within it, reference to rule$\rho $itself. Just how we arrive at this position is explained by (...) reference to familiar rules as well as less familiar ones with unusual features. An inquiry of this kind is surprisingly absent from the foundations of inferentialism—the view that meanings of expressions (especially logical ones) are to be characterized by the rules of inference that govern them. (shrink)

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. (shrink)

An account of how a rational agent should revise beliefs in the light of new evidence.

The aim here is to describe how to complete the constructive logicist program, in the author’s book Anti-Realism and Logic, of deriving all the Peano-Dedekind postulates for arithmetic within a theory of natural numbers that also accounts for their applicability in counting finite collections of objects. The axioms still to be derived are those for addition and multiplication. Frege did not derive them in a fully explicit, conceptually illuminating way. Nor has any neo-Fregean done so.

We compare Fregean theorizing about sets with the theorizing of an ontologically non-committal, natural-deduction based, inferentialist. The latter uses free Core logic, and confers meanings on logico-mathematical expressions by means of rules for introducing them in conclusions and eliminating them from major premises. Those expressions (such as the set-abstraction operator) that form singular terms have their rules framed so as to deal with canonical identity statements as their conclusions or major premises. We extend this treatment to pasigraphs as well, in (...) the case of set theory. These are defined expressions (such as ‘subset of’, or ‘power set of’) that are treated as basic in the lingua franca of informal set theory. Employing pasigraphs in accordance with their own natural-deduction rules enables one to ‘atomicize’ rigorous mathematical reasoning. (shrink)

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.

All parties to the proceedings that follow concur with DS. The question is whether there is anything more to truth than can be gleaned from DS alone. Deflationism holds that there is nothing more to truth than this. Now it would appear that 'warrantedly assertible' can play the role of T in DS. Hence it would appear that the deflationist would be able to identify truth with warranted assertibility.

Berry’s Paradox, like Russell’s Paradox, is a ‘paradox’ in name only. It differs from genuine logico-semantic paradoxes such as the Liar Paradox, Grelling’s Paradox, the Postcard Paradox, Yablo’s Paradox, the Knower Paradox, Prior’s Intensional Paradoxes, and their ilk. These latter arise from semantic closure. Their genuine paradoxicality manifests itself as the non-normalizability of the formal proofs or disproofs associated with them. The Russell, the Berry, and the Burali-Forti ‘paradoxes’, by contrast, simply reveal the straightforward inconsistency of their respective existential claims—that (...) the Russell set exists; that the Berry number exists; and that the ordinal of the well-ordering of all ordinals exists. The disproofs of these existential claims are in free logic and are in normal form. They show that certain complex singular terms do not—indeed, cannot—denote. All this counsels reconsideration of Ramsey’s famous division of paradoxes and contradictions into his Group A and Group B. The proof-theoretic criterion of genuine paradoxicality formally explicates an informal and occasionally confused notion. The criterion should be allowed to reform our intuitions about what makes for genuine paradoxicality, as opposed to straightforward (albeit surprising) inconsistency. (shrink)

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. This form of normalization theorem renders (...) unnecessary Gentzen's resort to sequent calculi in order to establish the desired metalogical properties of his logical system.Ultimate normal forms are well-adapted to the needs of the computational logician, affording valuable constraints on proof-search. They also provide an analysis of deductive relevance. There is a deep isomorphism between natural deductions and sequent proofs in the relevantized system. (shrink)

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 that the rules of Disquotation and (...) of Semantic Ascent cannot be derived for sentences with tonk dominant. These considerations deprive Boghossian's scepticism of its support. (shrink)

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 serve as the basis for a foundational program that could (...) be called Natural Logicism, an exposition of which will build on the (meta)logical ideas explained here. (shrink)

Peter Milne (2007) poses two challenges to the inferential theorist of meaning. This study responds to both. First, it argues that the method of natural deduction idealizes the essential details of correct informal deductive reasoning. Secondly, it explains how rules of inference in free logic can determine unique senses for the existential quantifier and the identity predicate. The final part of the investigation brings out an underlying order in a basic family of free logics.

1Certain developments in recent philosophy of mind that contemporary philosophers would regard as both novel and important were fully anticipated by writers in (or reacting to) the tradition of Nat...

This is a reply to Timothy Williamson ’s paper ‘Tennant’s Troubles’. It defends against Williamson ’s objections the anti-realist’s knowability principle based on the author’s ‘local’ restriction strategy involving Cartesian propositions, set out in The Taming of the True. Williamson ’s purported Fitchian reductio, involving the unknown number of books on his table, is analyzed in detail and shown to be fallacious. Williamson ’s attempt to cause problems for the anti-realist by means of a supposed rigid designator generates a contradiction (...) with arithmetic right away, upon instantiating the obviously relevant theorem that every natural number is provably odd or provably even. The paper also explains and formulates a globally restricted knowability principle, which likewise blocks the attempted reductio. (shrink)

We define a system IR of first-order intuitionistic relevant logic. We show that intuitionistic mathematics (on the assumption that it is consistent) can be relevantized, by virtue of the following metatheorem: any intuitionistic proof of A from a setX of premisses can be converted into a proof in IR of eitherA or absurdity from some subset ofX. Thus IR establishes the same inconsistencies and theorems as intuitionistic logic, and allows one to prove every intuitionistic consequence of any consistent set of (...) premisses. (shrink)