In defense of the minimalist conception of truth, Paul Horwich(2001) has recently argued that our acceptance of the instances of the schema,`the proposition that p is true if and only if p', suffices to explain our acceptanceof truth generalizations, that is, of general claims formulated using the truth predicate.In this paper, I consider the strategy Horwich develops for explaining our acceptance of truth generalizations. As I show, while perhaps workable on its own, the strategy is in conflictwith his response to (...) the liar paradox. Something must give. I consider and reject variousalternatives and emendations to the strategy. In order to resolve the conflict,I propose an alternative approach to the liar, one that supports Horwich's strategywhile leaving minimalism maximally uncompromised. (shrink)

Logic: the Basics is an accessible introduction to the core philosophy topic of standard logic. Focussing on traditional Classical Logic the book deals with topics such as mathematical preliminaries, propositional logic, monadic quantified logic, polyadic quantified logic, and English and standard ‘symbolic transitions’. With exercises and sample answers throughout this thoroughly revised new edition not only comprehensively covers the core topics at introductory level but also gives the reader an idea of how they can take their knowledge further and the (...) philosophical questions around logic. -/- Logic: the Basics is essential reading for first-year undergraduate philosophy students on standard introductory logic courses. (shrink)

The paper offers a critical examination of a prominent, “quasi-deflationist” argument advanced in the contemporary debate on the semantic paradoxes against non-naive and non-transparent theories of truth. The argument claims that truth unrestrictedly fulfils certain expressive functions, and that its so doing requires the unrestricted validity of naivety and transparency principles. The paper criticises the quasi-deflationist argument by considering some kinds of cases in which transparency and naivety arguably fail. In some such cases truth still fulfils the relevant expressive functions (...) without being transparent or naive; in some other such cases, truth does not fulfil the relevant expressive functions and other conceptual resources must be called upon. Thus, in different ways, all such cases belie the quasi-deflationist argument’s insistence that naivety and transparency should be unrestrictedly valid for truth unrestrictedly to fulfil the relevant expressive functions. There might however be other reasons for solving the semantic paradoxes by revising classical logic, and the paper in effect closes by offering versions of the liar paradox that rely on compelling but opacity-friendly truth-theoretic principles. (shrink)

I provide an interpretation of Wittgenstein's much criticized remarks on Gödel's First Incompleteness Theorem in the light of paraconsistent arithmetics: in taking Gödel's proof as a paradoxical derivation, Wittgenstein was right, given his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. I show that the models of paraconsistent arithmetics (obtained via the Meyer-Mortensen (...) collapsing filter on the standard model) match with many intuitions underlying Wittgensteins philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any meaningful mathematical question. (shrink)

This article has one aim, to reject the claim that negation is semantically ambiguous. The first section presents the putative incompatibility between truth-value gaps and the truth-schema; the second section presents the motivation for the ambiguity thesis; the third section summarizes arguments against the claim that natural language negation is semantically ambiguous; and the fourth section indicates the problems of an introduction of two distinct negation operators in natural language.

This document presents a Gentzen-style deductive calculus and proves that it is complete with respect to a 3-valued semantics for a language with quantifiers. The semantics resembles the strong Kleene semantics with respect to conjunction, disjunction and negation. The completeness proof for the sentential fragment fills in the details of a proof sketched in Arnon Avron (2003). The extension to quantifiers is original but uses standard techniques.