A textbook for graduate students of philosophy, computer science, and mathematics, on various approaches to nonmonotonic logic, with emphasis on they way in which they fall into an overall pattern.

The concept of truth arguably plays a central role in many areas of philosophical theorizing. Yet, what seems to be one of the most fundamental principles governing that concept, i.e. the equivalence between P and , is inconsistent in full classical logic, as shown by the semantic paradoxes. I propose a new solution to those paradoxes, based on a principled revision of classical logic. Technically, the key idea consists in the rejection of the unrestricted validity of the structural principle of (...) contraction. I first motivate philosophically this idea with the metaphysical picture of the states-of-affairs expressed by paradoxical sentences as being distinctively . I then proceed to demonstrate that the theory of truth resulting from this metaphysical picture is, in many philosophically interesting respects, surprisingly stronger than most other theories of truth endorsing the equivalence between P and (for example, the theory vindicates the validity of the traditional laws of excluded middle and of non-contradiction, and also vindicates the traditional constraint of truth preservation on logical consequence). I conclude by proving a cutelimination theorem that shows the consistency of the theory. (shrink)

ABSTRACTDo truth tables—the ordinary sort that we use in teaching and explaining basic propositional logic—require an assumption of consistency for their construction? In this essay we show that truth tables can be built in a consistency-independent paraconsistent setting, without any appeal to classical logic. This is evidence for a more general claim—that when we write down the orthodox semantic clauses for a logic, whatever logic we presuppose in the background will be the logic that appears in the foreground. Rather than (...) any one logic being privileged, then, on this count partisans across the logical spectrum are in relatively similar dialectical positions. (shrink)

We investigate axiomatizations of Kripke's theory of truth based on the Strong Kleene evaluation scheme for treating sentences lacking a truth value. Feferman's axiomatization KF formulated in classical logic is an indirect approach, because it is not sound with respect to Kripke's semantics in the straightforward sense: only the sentences that can be proved to be true in KF are valid in Kripke's partial models. Reinhardt proposed to focus just on the sentences that can be proved to be true in (...) KF and conjectured that the detour through classical logic in KF is dispensable. We refute Reinhardt's Conjecture, and provide a direct axiomatization PKF of Kripke's theory in partial logic. We argue that any natural axiomatization of Kripke's theory in Strong Kleene logic has the same proof-theoretic strength as PKF, namely the strength of the system RA< ωω ramified analysis or a system of Tarskian ramified truth up to ωω. Thus any such axiomatization is much weaker than Feferman's axiomatization KF in classical logic, which is equivalent to the system RA<ε₀ of ramified analysis up to ε₀. (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)

The aggregation of individual judgments on logically interconnected propositions into a collective decision on the same propositions is called judgment aggregation. Literature in social choice and political theory has claimed that judgment aggregation raises serious concerns. For example, consider a set of premises and a conclusion where the latter is logically equivalent to the former. When majority voting is applied to some propositions (the premises) it may give a different outcome than majority voting applied to another set of propositions (the (...) conclusion). This problem is known as the discursive dilemma (or paradox). The discursive dilemma is a serious problem since it is not clear whether a collective outcome exists in these cases, and if it does, what it is like. Moreover, the two suggested escape-routes from the paradox—the so-called premise-based procedure and the conclusion-based procedure—are not, as I will show, satisfactory methods for group decision-making. In this paper I introduce a new aggregation procedure inspired by an operator defined in artificial intelligence in order to merge belief bases. The result is that we do not need to worry about paradoxical outcomes, since these arise only when inconsistent collective judgments are not ruled out from the set of possible solutions. (shrink)

Taken as a model for how groups should make collective judgments and decisions, the ideal of deliberative democracy is inherently ambiguous. Consider the idealised case where it is agreed on all sides that a certain conclusion should be endorsed if and only if certain premises are admitted. Does deliberative democracy recommend that members of the group debate the premises and then individually vote, in the light of that debate, on whether or not to support the conclusion? Or does it recommend (...) that members individually vote on the premises, and then let their commitment to the conclusion be settled by whether or not the group endorses the required premises? Is deliberative democracy to enforce the discipline of reason at the individual level, as in the first possibility, or at the collective level, as in the second? (shrink)

Taken as a model for how groups should make collective judgments and decisions, the ideal of deliberative democracy is inherently ambiguous. Consider the idealised case where it is agreed on all sides that a certain conclusion should be endorsed if and only if certain premises are admitted. Does deliberative democracy recommend that members of the group debate the premises and then individually vote, in the light of that debate, on whether or not to support the conclusion? Or does it recommend (...) that members individually vote on the premises, and then let their commitment to the conclusion be settled by whether or not the group endorses the required premises? Deliberative-democratic theory has not addressed this issue, and this is a problem. The discursive dilemma of my title--a generalisation of the doctrinal paradox from analytical jurisprudence--shows that the procedures distinguished can come apart. Thus deliberative democrats must make up their minds on where they stand in relation to the issue; they cannot sit on the fence. This paper is an attempt to address the issue and look at the grounds on which it may be resolved. (shrink)

The ``doctrinal paradox'' or ``discursive dilemma'' shows that propositionwise majority voting over the judgments held by multiple individuals on some interconnected propositions can lead to inconsistent collective judgments on these propositions. List and Pettit (2002) have proved that this paradox illustrates a more general impossibility theorem showing that there exists no aggregation procedure that generally produces consistent collective judgments and satisfies certain minimal conditions. Although the paradox and the theorem concern the aggregation of judgments rather than preferences, they invite comparison (...) with two established results on the aggregation of preferences: the Condorcet paradox and Arrow's impossibility theorem. We may ask whether the new impossibility theorem is a special case of Arrow's theorem, or whether there are interesting disanalogies between the two results. In this paper, we compare the two theorems, and show that they are not straightforward corollaries of each other. We further suggest that, while the framework of preference aggregation can be mapped into the framework of judgment aggregation, there exists no obvious reverse mapping. Finally, we address one particular minimal condition that is used in both theorems – an independence condition – and suggest that this condition points towards a unifying property underlying both impossibility results. (shrink)

Suppose that the members of a group each hold a rational set of judgments on some interconnected questions, and imagine that the group itself has to form a collective, rational set of judgments on those questions. How should it go about dealing with this task? We argue that the question raised is subject to a difficulty that has recently been noticed in discussion of the doctrinal paradox in jurisprudence. And we show that there is a general impossibility theorem that that (...) difficulty illustrates. Our paper describes this impossibility result and provides an exploration of its significance. The result naturally invites comparison with Kenneth Arrow's famous theorem (Arrow, 1963 and 1984; Sen, 1970) and we elaborate that comparison in a companion paper (List and Pettit, 2002). The paper is in four sections. The first section documents the need for various groups to aggregate its members' judgments; the second presents the discursive paradox; the third gives an informal statement of the more general impossibility result; the formal proof is presented in an appendix. The fourth section, finally, discusses some escape routes from that impossibility. (shrink)

A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.

In “The Runabout Inference Ticket” AN Prior (1960) examines the idea that logical connectives can be given a meaning solely in virtue of the stipulation of a set of rules governing them, and thus that logical truth/consequence.

This paper presents and defends a way to add a transparent truth predicate to classical logic, such that and A are everywhere intersubstitutable, where all T-biconditionals hold, and where truth can be made compositional. A key feature of our framework, called STTT (for Strict-Tolerant Transparent Truth), is that it supports a non-transitive relation of consequence. At the same time, it can be seen that the only failures of transitivity STTT allows for arise in paradoxical cases.

One of the most dominant approaches to semantics for relevant (and many paraconsistent) logics is the Routley-Meyer semantics involving a ternary relation on points. To some (many?), this ternary relation has seemed like a technical trick devoid of an intuitively appealing philosophical story that connects it up with conditionality in general. In this paper, we respond to this worry by providing three different philosophical accounts of the ternary relation that correspond to three conceptions of conditionality. We close by briefly discussing (...) a general conception of conditionality that may unify the three given conceptions. (shrink)

At the centre of the traditional discussion of truth is the question of how truth is defined. Recent research, especially with the development of deflationist accounts of truth, has tended to take truth as an undefined primitive notion governed by axioms, while the liar paradox and cognate paradoxes pose problems for certain seemingly natural axioms for truth. In this book, Volker Halbach examines the most important axiomatizations of truth, explores their properties and shows how the logical results impinge on the (...) philosophical topics related to truth. In particular, he shows that the discussion on topics such as deflationism about truth depends on the solution of the paradoxes. His book is an invaluable survey of the logical background to the philosophical discussion of truth, and will be indispensable reading for any graduate or professional philosopher in theories of truth. (shrink)

This introductory text explores the theory of social choice. Written as a primer suitable for advanced undergraduates and graduates, this text will act as an important starting point for students grappling with the complexities of social choice theory. Rigorous yet accessible, this primer avoids the use of technical language and provides an up-to-date discussion of this rapidly developing field. This is the first in a series of texts published in association with the LSE.

An graduate level introduction to nonmonotonic reasoning, emphasizing structures and spirit common to different formulations, with exercises.

Definitional and axiomatic theories of truth -- Objects of truth -- Tarski -- Truth and set theory -- Technical preliminaries -- Comparing axiomatic theories of truth -- Disquotation -- Classical compositional truth -- Hierarchies -- Typed and type-free theories of truth -- Reasons against typing -- Axioms and rules -- Axioms for type-free truth -- Classical symmetric truth -- Kripke-Feferman -- Axiomatizing Kripke's theory in partial logic -- Grounded truth -- Alternative evaluation schemata -- Disquotation -- Classical logic -- Deflationism (...) -- Reflection -- Ontological reduction -- Applying theories of truth. (shrink)

Judgment aggregation theory, which concerns the translation of individual judgments on logical propositions into consistent group judgments, has shown that group consistency generally cannot be guaranteed if each proposition is treated independently from the others. Developing the right method of abandoning independence is thus a high-priority goal. However, little work has been done in this area outside of a few simple approaches. To fill the gap, we compare four methods based on distance metrics between judgment sets. The methods generalize the (...) premise-based and sequential priority approaches to judgment aggregation, as well as distance-based preference aggregation. They each guarantee group consistency and implement a range of distinct functions with different properties, broadening the available tools for social choice. A central result is that only one of these methods (not previously considered in the literature) satisfies three attractive properties for all reasonable metrics. (shrink)

In response to recent work on the aggregation of individual judgments on logically connected propositions into collective judgments, it is often asked whether judgment aggregation is a special case of Arrowian preference aggregation. We argue for the converse claim. After proving two impossibility theorems on judgment aggregation (using "systematicity" and "independence" conditions, respectively), we construct an embedding of preference aggregation into judgment aggregation and prove Arrow’s theorem (stated for strict preferences) as a corollary of our second result. Although we thereby (...) provide a new proof of Arrow’s theorem, our main aim is to identify the analogue of Arrow’s theorem in judgment aggregation, to clarify the relation between judgment and preference aggregation, and to illustrate the generality of the judgment aggregation model. JEL Classi…cation: D70, D71.. (shrink)

The new field of judgment aggregation aims to merge many individual sets of judgments on logically interconnected propositions into a single collective set of judgments on these propositions. Judgment aggregation has commonly been studied using classical propositional logic, with a limited expressive power and a problematic representation of conditional statements ("if P then Q") as material conditionals. In this methodological paper, I present a simple unified model of judgment aggregation in general logics. I show how many realistic decision problems can (...) be represented in it. This includes decision problems expressed in languages of classical propositional logic, predicate logic (e.g. preference aggregation problems), modal or conditional logics, and some multi-valued or fuzzy logics. I provide a list of simple tools for working with general logics, and I prove impossibility results that generalise earlier theorems. (shrink)