Neil Tennant

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

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.

‘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

SummaryI defend a conventionalist view of logical and mathematical truths against the criticisms of Quine and Stroud. Conventionalism is best formulated by appealing to sense‐conferring rules governing important logical and mathematical expressions. Conventional necessity can be understood as arising from these rules in a way that is immune to Quine's and Stroud's criticisms of the earlier formulation of conventionalism, in which stress was incorrectly laid on axiomatic systems of logic.RésuméJe soutiens, en dépit des critiques de Quine et de Stroud, une conception conventionnaliste des vérités logiques et de vérités mathématiques. La meilleure façon de formuler le conventionnalisme est de faire appel à des règies conférant un sens à?on;importantes expressions logiques et mathématiques. La nécessité conventionnelle peut être comprise comme provenant de ces règies par des voies qui ne donnent pas prise aux critiques de Quine et de Stroud ag ľégard de ľancienne formulation du conventionnalisme, dans laquelle ľaccent était mis, a tort, sur les systèmes axiomatiques de la logique.ZusammenfassungGegen Quines und Strouds Kritiken verteidige ich eine konventionalistische Auffassung der logischen und mathematischer Wahrheiten. Der Konventionalismus wird am besten durch Berufung auf bedeutungsstiftende Regeln, die den Gebrauch wichtiger logischer und mathematischer Ausdrücke bestimmen, formuliert. Konventionelle Notwendigkeit kann als von diesen Regeln hervorgebracht verstanden werden – und das zwar auf eine Art, die sie vor Quines und Strouds Anfechtungen schützen. In der von diesen kritisierten, früheren Fassung wurde zu unrecht das Gewicht auf axiomatische Systeme der Logik gelegt

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

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.

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

We present a logically detailed case-study of explanation and prediction in Newtonian mechanics. The case in question is that of a planet's elliptical orbit in the Sun's gravitational field. Care is taken to distinguish the respective contributions of the mathematics that is being applied, and of the empirical hypotheses that receive a mathematical formulation. This enables one to appreciate how in this case the overall logical structure of scientific explanation and prediction is exactly in accordance with the hypotheticodeductive model

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.

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

Brian Skyrms has studied the evolutionary dynamics of a simple bargaining game. Fair-dealing is the strategy 'demand 1/2', competing with the more modest strategy 'demand 1/3' and the greedier strategy 'demand 2/3'. Individuals leave offspring in proportion to their accumulated payoffs. The rules for payoffs from encounters penalize low- and high-demanders. The result is a significant basin of attraction for fair-dealing as an evolutionarily stable strategy. From these considerations Skyrms concludes that a disposition to fair-dealing could have evolved. A very different picture emerges, however, when one considers genetic bases for the dispositions involved. A simple two-allele sexual model produces very different stable equilibria in the distribution of behavioral phenotypes. The equilibria for Skyrms's purely phenotypic selection process will not in general be attainable once one enters some simple genetic considerations

Michael Friedman maintains that Carnap did not fully appreciate the impact of Gödel's first incompleteness theorem on the prospect for a purely syntactic definition of analyticity that would render arithmetic analytically true. This paper argues against this claim. It also challenges a common presumption on the part of defenders of Carnap, in their diagnosis of the force of Gödel's own critique of Carnap in his Gibbs Lecture. The author is grateful to Michael Friedman for valuable comments. Part of the research towards this paper was carried out while the author was a Visiting Fellow at the Center for Philosophy of Science at the University of Pittsburgh. The paper was presented to the Center's Fellowship Reunion Conference in Athens in 1992. It was committed for publication in the Proceedings of that conference, but those Proceedings never appeared. By the time it became evident that they would never appear, both the hard copy and the source file had been mislaid. The hard copy re-surfaced in 2007. The literature on this topic since 1992 appears to leave some space for the ideas and arguments presented here. Although the paper has been updated in light of the more recent literature, its basic thesis, presented in 1992, remains the same. Only 3 is new, questioning a basic presumption made by more recent commentators in their presentation of Gödel's criticism of Carnap in his Gibbs Lecture. For helpful comments on the current version, the author is indebted to Robert Kraut, Stewart Shapiro, and Adam Podlaskowski. CiteULike    Connotea    Del.icio.us    What's this?

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.