This revised and considerably expanded 2nd edition brings together a wide range of topics, including modal, tense, conditional, intuitionist, many-valued, paraconsistent, relevant, and fuzzy logics. Part 1, on propositional logic, is the old Introduction, but contains much new material. Part 2 is entirely new, and covers quantification and identity for all the logics in Part 1. The material is unified by the underlying theme of world semantics. All of the topics are explained clearly using devices such as tableau proofs, and (...) their relation to current philosophical issues and debates are discussed. Students with a basic understanding of classical logic will find this book an invaluable introduction to an area that has become of central importance in both logic and philosophy. It will also interest people working in mathematics and computer science who wish to know about the area. (shrink)

Multiple -conclusion logic extends formal logic by allowing arguments to have a set of conclusions instead of a single one, the truth lying somewhere among the conclusions if all the premises are true. The extension opens up interesting possibilities based on the symmetry between premises and conclusions, and can also be used to throw fresh light on the conventional logic and its limitations. This is a sustained study of the subject and is certain to stimulate further research. Part I reworks (...) the fundamental ideas of logic to take account of multiple conclusions, and investigates the connections between multiple - and single - conclusion calculi. Part II draws on graph theory to discuss the form and validity of arguments independently of particular logical systems. Part III contrasts the multiple - and the single - conclusion treatment of one and the same subject, using many-valued logic as the example; and Part IV shows how the methods of 'natural deduction' can be matched by direct proofs using multiple conclusions. (shrink)

Our topic is the notion of logical consequence: the link between premises and conclusions, the glue that holds together deductively valid argument. How can we understand this relation between premises and conclusions? It seems that any account begs questions. Painting with very broad brushtrokes, we can sketch the landscape of disagreement like this: “Realists” prefer an analysis of logical consequence in terms of the preservation of truth [29]. “Anti-realists” take this to be unhelpful and o:er alternative analyses. Some, like Dummett, (...) look to preservation of warrant to assert [9, 36]. Others, like Brandom [5], take inference as primitive, and analyse other notions in terms of it. There is plenty of disagreement on the “realist” side of the fence too. It is one thing to argue that logical consequence involves preservation of truth. It is another to explain how far truth must be preserved. Is the preservation essentially modal (in all circumstances [25]) or analytic (vouchsafed by.. (shrink)

It will be an essential resource for philosophers, mathematicians, computer scientists, linguists, or any scholar who finds connectives, and the conceptual issues surrounding them, to be a source of interest.This landmark work offers both ...

An assertion is a speech act in which something is claimed to hold, e.g. that there are infinitely many prime numbers, or, with respect to some time t, that there is a traffic congestion on Brooklyn Bridge at t, or, of some person x with respect to some time t, that x has a tooth ache at t. The concept of assertion has often occupied a central place in the philosophy of language, since it is often thought that making assertions (...) is the use of language most crucial to linguistic meaning, and since assertions are the natural expressions of cognitive attitudes, and hence of importance for theories of knowledge and belief. (shrink)

A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finite -valued logic if the labels are interpreted as sets of truth values. Furthermore, it is shown that any finite -valued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed is logarithmic in the (...) number of truth values, and it is shown that this bound is tight. (shrink)

The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the proof theory of finite-valued first order (...) logics in a general way, and to present some of the more important results in this area. In Systems covered are the resolution calculus, sequent calculus, tableaux, and natural deduction. This report is actually a template, from which all results can be specialized to particular logics. (shrink)

A construction principle for natural deduction systems for arbitrary, finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent calculi, which in turn can be automatically extracted from the truth tables of the logics under consideration. Soundness and cut-free completeness of these sequent calculi translate into soundness, completeness, and normal-form theorems for natural deduction systems.

Natural deduction systems were motivated by the desire to define the meaning of each connective by specifying how it is introduced and eliminated from inference. In one sense, this attempt fails, for it is well known that propositional logic rules underdetermine the classical truth tables. Natural deduction rules are too weak to enforce the intended readings of the connectives; they allow non-standard models. Two reactions to this phenomenon appear in the literature. One is to try to restore the standard readings, (...) for example by adopting sequent rules with multiple conclusions. Another is to explore what readings the natural deduction rules do enforce. When the notion of a model of a rule is generalized, it is found that natural deduction rules express “intuitionistic” readings of their connectives. A third approach is presented here. The intuitionistic readings emerge when models of rules are defined globally, but the notion of a local model of a rule is also natural. Using this benchmark, natural deduction rules enforce exactly the classical readings of the connectives, while this is not true of axiomatic systems. This vindicates the historical motivation for natural deduction rules. One odd consequence of using the local model benchmark is that some systems of propositional logic are not complete for the semantics that their rules express. Parallels are drawn with incompleteness results in modal logic to help make sense of this. (shrink)

Logical pluralism has been in vogue since JC Beall and Greg Restall 2006 articulated and defended a new pluralist thesis. Recent criticisms such as Priest 2006a and Field 2009 have suggested that there is a relationship between their type of logical pluralism and the meaning-variance thesis for logic. This is the claim, often associated with Quine 1970, that a change of logic entails a change of meaning. Here we explore the connection between logical pluralism and meaning-variance, both in general and (...) for Beall and Restall's theory specifically. We argue that contrary to what Beall and Restall claim, their type of pluralism is wedded to meaning-variance. We then develop an alternative form of logical pluralism that circumvents at least some forms of meaning-variance. (shrink)

In Contradiction advocates and defends the view that there are true contradictions, a view that flies in the face of orthodoxy in Western philosophy since Aristotle. The book has been at the center of the controversies surrounding dialetheism ever since its first publication in 1987. This second edition of the book substantially expands upon the original in various ways, and also contains the author’s reflections on developments over the last two decades. Further aspects of dialetheism are discussed in the companion (...) volume, Doubt Truth to be a Liar, also published by Oxford University Press in 2006. (shrink)

This paper provides both a solution and a problem for the account of compositionality in Christopher Peacocke’s modest inferentialism. The immediate issue facing Peacocke’s account is that it looks as if compositionality can only be understood at the level of semantics, which is difficult to reconcile with inferentialism. Here, following up a brief suggestion by Peacocke, I provide a formal framework wherein compositionality occurs the level of the determining relation between inference and semantics. This, in turn provides a “test” for (...) compositionality, which, problematically, Peacocke’s natural deduction framework for classical logic can not meet. To finish, I briefly outline an alternative, bilateralist, framework for modest inferentialism, for which compositionality holds. (shrink)

In bilateral systems for classical logic, assertion and denial occur as primitive signs on formulas. Such systems lend themselves to an inferentialist story about how truth-conditional content of connectives can be determined by inference rules. In particular, for classical logic there is a bilateral proof system which has a property that Carnap in 1943 called categoricity. We show that categorical systems can be given for any finite many-valued logic using $n$-sided sequent calculus. These systems are understood as a further development (...) of bilateralism—call it multilateralism. The overarching idea is that multilateral proof systems can incorporate the logic of a variety of denial speech acts. So against Frege we say that denial is not the negation of assertion and, with Mark Twain, that denial is more than a river in Egypt. (shrink)

This comprehensive text shows how various notions of logic can be viewed as notions of universal algebra providing more advanced concepts for those who have an introductory knowledge of algebraic logic, as well as those wishing to delve into more theoretical aspects.

This paper uses the strengthened liar paradox as a springboard to illuminate two more general topics: i) the negation operator and the speech act of denial among speakers of English and ii) some ways the potential for acceptable language change is constrained by linguistic meaning. The general and special problems interact in reciprocally illuminating ways. The ultimate objective of the paper is, however, less to solve certain problems than to create others, by illustrating how the issues that form the topic (...) of this paper are more intricate than previously realised, and that they are related in delicate and somewhat surprising ways. (shrink)

This paper uses the notion of Galois-connection to examine the relation between valuation-spaces and logics. Every valuation-space gives rise to a logic, and every logic gives rise to a valuation space, where the resulting pair of functions form a Galois-connection, and the composite functions are closure-operators. A valuation-space (resp., logic) is said to be complete precisely if it is Galois-closed. Two theorems are proven. A logic is complete if and only if it is reflexive and transitive. A valuation-space is complete (...) if and only if it is closed under formation of super-valuations. (shrink)

In this paper the informativeness account of assertion (Pagin in Assertion. Oxford University Press, Oxford, 2011) is extended to account for inference. I characterize the conclusion of an inference as asserted conditionally on the assertion of the premises. This gives a notion of conditional assertion (distinct from the standard notion related to the affirmation of conditionals). Validity and logical validity of an inference is characterized in terms of the application of method that preserves informativeness, and contrasted with consequence and logical (...) consequence, that is defined in terms of truth preservation. The proposed account is compared with that of Prawitz (Logica yearbook 2008, pp. 175-192. College Publications, London, 2009). (shrink)

I present an account of truth values for classical logic, intuitionistic logic, and the modal logic S5, in which truth values are not a fundamental category from which the logic is defined, but rather, an idealisation of more fundamental logical features in the proof theory for each system. The result is not a new set of semantic structures, but a new understanding of how the existing semantic structures may be understood in terms of a more fundamental notion of logical consequence.

The paper is a defense of the project of explaining the a priori via the notion of meaning or concept possession. It responds to certain objections that have been made to this project—in particular, that there can be no epistemically analytic sentences that are not also metaphysically analytic, and that the notion of implicit definition cannot explain a priori entitlement. The paper goes on to distinguish between two different ways in which facts about meaning might generate facts about entitlement—inferential and (...) constitutive. It concludes by outlining a theory of the latter. (shrink)

A bivalent valuation is snt iff sound (standard PC inference rules take truths only into truths) and non-trivial (not all wffs are assigned the same truth value). Such a valuation is normal iff classically correct for each connective. Carnap knew that there were non-normal snt valuations of PC, and that the gap they revealed between syntax and semantics could be "jumped" as follows. Let $VAL_{snt}$ be the set of snt valuations, and $VAL_{nrm}$ be the set of normal ones. The bottom (...) row in the table for the wedge 'v' is not semantically determined by $VAL_{snt}$ , but if one deletes from $VAL_{snt}$ all those valuations that are not classically correct at the aforementioned row, one jumps straights to $VAL_{nrm}$ and thus to classical semantics. The conjecture we call semantic holism claims that the same thing happens for any semantic indeterminacy in any row in the table of any connective of PC, i.e., to remove it is to jump straight to classical semantics. We show (i) why semantic holism is plausible and (ii) why it is nevertheless false. And (iii) we pose a series of questions concerning the number of possible steps or jumps between the indeterminate semantics given by $VAL_{snt}$ and classical semantics given by $VAL_{nrm}$. (shrink)

I present an account of truth values for classical logic, intuitionistic logic, and the modal logic s5, in which truth values are not a fundamental category from which the logic is defined, but rather, an idealisation of more fundamental logical features in the proof theory for each system. The result is not a new set of semantic structures, but a new understanding of how the existing semantic structures may be understood in terms of a more fundamental notion of logical consequence.

In the service of paraconsistent (indeed, ‘dialetheic’) theories, Graham Priest has long advanced a non-monotonic logic (viz., MiLP) as our ‘universal logic’ (at least for standard connectives), one that enjoys the familiar logic LP (for ‘logic of paradox’) as its monotonic core (Priest, G. In Contradiction , 2nd edn. Oxford: Oxford University Press. First printed by Martinus Nijhoff in 1987: Chs. 16 and 19). In this article, I show that MiLP faces a dilemma: either it is (plainly) unsuitable as a (...) universal logic or its role as a ‘universal logic’ (indeed, its role full stop) is a mystery. While familiarity with the basic ideas of dialetheism is assumed, formal details of the target logics are relegated to an appendix; the basic problem is evident without them. (shrink)