In this book the authors reconcile two different viewpoints of the foundations of mathematics, namely mathematical logic and category theory. In Part I, they show that typed lambda-calculi, a formulation of higher order logic, and cartesian closed categories are essentially the same. In Part II, it is demonstrated that another formulation of higher order logic is closely related to topos theory. Part III is devoted to recursive functions. Numerous applications of the close relationship between traditional logic and the algebraic language (...) of category theory are given. The authors have included an introduction to category theory and develop the necessary logic as required, making the book essentially self-contained. Detailed historical references are provided throughout, and each section concludes with a set of exercises. Thus it is well-suited for graduate courses and research in mathematics and logic. Researchers in theoretical computer science, artificial intelligence and mathematical linguistics will also find this an accessible introduction to a subject of increasing application to these disciplines. (shrink)

Based on a crowdsourced truth value judgment experiment, we provide empirical evidence challenging two classical views in semantics, and we develop a novel account of counterfactuals that combines ideas from inquisitive semantics and causal reasoning. First, we show that two truth-conditionally equivalent clauses can make different semantic contributions when embedded in a counterfactual antecedent. Assuming compositionality, this means that the meaning of these clauses is not fully determined by their truth conditions. This finding has a clear explanation in inquisitive semantics: (...) truth-conditionally equivalent clauses may be associated with different propositional alternatives, each of which counts as a separate counterfactual assumption. Second, we show that our results contradict the common idea that the interpretation of a counterfactual involves minimizing change with respect to the actual state of affairs. We propose to replace the idea of minimal change by a distinction between foreground and background for a given counterfactual assumption: the background is held fixed in the counterfactual situation, while the foreground can be varied without any minimality constraint. (shrink)

Conditional excluded middle (CEM) is the following principe of counterfactual logic: either, if it were the case that φ, it would be the case that ψ, or, if it were the case that φ, it would be the case that not-ψ. I will first show that CEM entails the identity of indiscernibles, the falsity of physicalism, and the failure of the modal to supervene on the categorical and of the vague to supervene on the precise. I will then argue that (...) we should accept these startling conclusions, since CEM is valid. (shrink)

First published in 1952, professor’s Strawson’s highly influential _Introduction_ _to Logical Theory_ provides a detailed examination of the relationship between the behaviour of words in common language and the behaviour of symbols in a logical system. He seeks to explain both the exact nature of the discipline known as Formal Logic, and also to reveal something of the intricate logical structure of ordinary unformalised discourse.

This book introduces an important group of logics that have come to be known under the umbrella term 'susbstructural'. Substructural logics have independently led to significant developments in philosophy, computing and linguistics. _An Introduction to Substrucural Logics_ is the first book to systematically survey the new results and the significant impact that this class of logics has had on a wide range of fields.The following topics are covered: * Proof Theory * Propositional Structures * Frames * Decidability * Coda Both (...) students and professors of philosophy, computing, linguistics, and mathematics will find this to be an important addition to their reading. (shrink)

Statements about the future are central in everyday conversation and reasoning. How should we understand their meaning? The received view among philosophers treats will as a tense: in ‘Cynthia will pass her exam’, will shifts the reference time forward. Linguists, however, have produced substantial evidence for the view that will is a modal, on a par with must and would. The different accounts are designed to satisfy different theoretical constraints, apparently pulling in opposite directions. We show that these constraints are (...) jointly satisfied by a novel modal account of will. On this account, will is a modal but doesn't work as a quantifier over worlds. Rather, the meaning of will involves a selection function similar to the one used by Stalnaker in his semantics for conditionals. The resulting theory yields a plausible semantics and logic for will and vindicates our intuitive views about the attitudes that rational agents should have towards future-directed contents. (shrink)

We say that a sentence A is a permissive consequence of a set X of premises whenever, if all the premises of X hold up to some standard, then A holds to some weaker standard. In this paper, we focus on a three-valued version of this notion, which we call strict-to-tolerant consequence, and discuss its fruitfulness toward a unified treatment of the paradoxes of vagueness and self-referential truth. For vagueness, st-consequence supports the principle of tolerance; for truth, it supports the (...) requisite of transparency. Permissive consequence is non-transitive, however, but this feature is argued to be an essential component to the understanding of paradoxical reasoning in cases involving vagueness or self-reference. (shrink)

A number of recent authors (Galles and Pearl, Found Sci 3 (1):151–182, 1998; Hiddleston, Noûs 39 (4):232–257, 2005; Halpern, J Artif Intell Res 12:317–337, 2000) advocate a causal modeling semantics for counterfactuals. But the precise logical significance of the causal modeling semantics remains murky. Particularly important, yet particularly under-explored, is its relationship to the similarity-based semantics for counterfactuals developed by Lewis (Counterfactuals. Harvard University Press, 1973b). The causal modeling semantics is both an account of the truth conditions of counterfactuals, and (...) an account of which inferences involving counterfactuals are valid. As an account of truth conditions, it is incomplete. While Lewis's similarity semantics lets us evaluate counterfactuals with arbitrarily complex antecedents and consequents, the causal modeling semantics makes it hard to ascertain the truth conditions of all but a highly restricted class of counterfactuals. I explain how to extend the causal modeling language to encompass a wider range of sentences, and provide a sound and complete axiomatization for the extended language. Extending the truth conditions for counterfactuals has serious consequences concerning valid inference. The extended language is unlike any logic of Lewis's: modus ponens is invalid, and classical logical equivalents cannot be freely substituted in the antecedents of conditionals. (shrink)

This paper presents and motivates a new philosophical and logical approach to truth and semantic paradox. It begins from an inferentialist, and particularly bilateralist, theory of meaning---one which takes meaning to be constituted by assertibility and deniability conditions---and shows how the usual multiple-conclusion sequent calculus for classical logic can be given an inferentialist motivation, leaving classical model theory as of only derivative importance. The paper then uses this theory of meaning to present and motivate a logical system---ST---that conservatively extends classical (...) logic with a fully transparent truth predicate. This system is shown to allow for classical reasoning over the full (truth-involving) vocabulary, but to be non-transitive. Some special cases where transitivity does hold are outlined. ST is also shown to give rise to a familiar sort of model for non-classical logics: Kripke fixed points on the Strong Kleene valuation scheme. Finally, to give a theory of paradoxical sentences, a distinction is drawn between two varieties of assertion and two varieties of denial. On one variety, paradoxical sentences cannot be either asserted or denied; on the other, they must be both asserted and denied. The target theory is compared favourably to more familiar related systems, and some objections are considered. (shrink)

In this paper we investigate a semantics for first-order logic originally proposed by R. van Rooij to account for the idea that vague predicates are tolerant, that is, for the principle that if x is P, then y should be P whenever y is similar enough to x. The semantics, which makes use of indifference relations to model similarity, rests on the interaction of three notions of truth: the classical notion, and two dual notions simultaneously defined in terms of it, (...) which we call tolerant truth and strict truth. We characterize the space of consequence relations definable in terms of those and discuss the kind of solution this gives to the sorites paradox. We discuss some applications of the framework to the pragmatics and psycholinguistics of vague predicates, in particular regarding judgments about borderline cases. (shrink)

Lewis (1973) gave a short argument against conditional excluded middle, based on his treatment of ‘might’ counterfactuals. Bennett (2003), with much of the recent literature, gives an alternative take on ‘might’ counterfactuals. But Bennett claims the might-argument against CEM still goes through. This turns on a specific claim I call Bennett’s Hypothesis. I argue that independently of issues to do with the proper analysis of might-counterfactuals, Bennett’s Hypothesis is inconsistent with CEM. But Bennett’s Hypothesis is independently objectionable, so we should (...) resolve this tension by dropping the Hypothesis, not by dropping CEM. (shrink)

What we want to be true about ordinary indicative conditionals seems to be more than we can possibly get: there just seems to be no good way to assign truth-conditions to ordinary indicative conditionals. Some take this argument as reason to make our wantings more modest. Others take it to show that indicative conditionals don't have truth-conditions in the first place. But we have overlooked two possibilities for assigning truth-conditions to indicatives. What's more, those possibilities deliver what we want and (...) turn out to be equivalent. CiteULike Connotea Del.icio.us Digg Reddit Technorati What's this? (shrink)

Common-sense allows that talk about moral truths makes perfect sense. If you object to the United States’ Declaration of Independence’s assertion that it is a truth that ‘all men’ are ‘endowed by their Creator with certain unalienable Rights’, you are more likely to object that these rights are not unalienable or that they are not endowed by the Creator, or even that its wording ignores the fact that women have rights too, than that this is not the sort of thing (...) which could be a truth. Whether it is a truth or not seems beside the point, anyway; the writers of the Declaration could just have well written, ‘We hold it to be self-evident that all men are created equal, and also that it is self-evident that all men are endowed by their Creator with certain unalienable Rights,’ save only that its cadence would lack some of the poetic resonance of the version which garnered Hancock’s signature. Yet famously, ethical noncognitivists have proclaimed that moral sentences can’t be true or false – that, like ‘Hooray!’ or ‘dammit!’, they are not even the kinds of things to be true or false. Noncognitivism is sometimes even defined as the view that this is so, but even philosophers who define ‘noncognitivism’ more broadly, as consistent with the idea that moral sentences may be true or false, have believed that they needed to do important philosophical spadework in order to make sense of how moral sentences could be true or false. In this article we’ll look at the puzzle about moral truth as it is faced by early noncognitivists and by metaethical expressivists, the early noncognitivists’ contemporary cousins. We’ll look at what it would take for expressivists to ‘earn the right’ to talk about moral truths at all, and in particular at what it would take for them to earn the right to claim that moral truths behave in the ways that we should expect – including that meaningful moral sentences which lack presuppositions are true or false, and that classically valid arguments are truth-preserving.. (shrink)

In this paper I explore why one might hope to, and how to begin to, develop an expressivist account of truth – that is, a semantics for ‘true’ and ‘false’ within an expressivist framework. I do so for a few reasons: because certain features of deflationism seem to me to require some sort of nondescriptivist semantics, because of all nondescriptivist semantic frameworks which are capable of yielding definite predictions rather than consisting merely of hand-waving, expressivism is that with which I (...) am most familiar, and because I believe that certain problems about truth and particularly about paradox seem to me to look different, when seen through the lens of an expressivist theory. I don’t mean to defend such a theory in this paper, and indeed I have cast doubts on the ultimate prospects of the framework I will be employing here elsewhere.1 But I do think that seeing what an expressivist theory of truth would look like helps to shed light on both expressivism and on truth. (shrink)

Is A & C sufficient for the truth of ‘if A were the case, C would be the case’? Jonathan Bennett thinks not, although the counterexample he gives is inconsistent with his own account of counterfactuals. In any case, I argue that anyone who accepts the case of Morgenbesser's coin, as Bennett does, should reject Bennett’s counterexample. Moreover, I show that the principle underlying his counterexample is unmotivated and indeed false. More generally, I argue that Morgenbesser’s coin commits us to (...) the sufficiency of A & C for the truth of the corresponding counterfactual. (shrink)

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much (...) more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included. (shrink)

We consider a paradox involving indicative conditionals (‘ifs’) and deontic modals (‘oughts’). After considering and rejecting several standard options for resolv- ing the paradox—including rejecting various premises, positing an ambiguity or hidden contextual sensitivity, and positing a non-obvious logical form—we offer a semantics for deontic modals and indicative conditionals that resolves the paradox by making modus ponens invalid. We argue that this is a result to be welcomed on independent grounds, and we show that rejecting the general validity of modus (...) ponens is compatible with vindicating most ordinary uses of modus ponens in reasoning. (shrink)

In a recent series of papers, I and others have advanced new logical approaches to familiar paradoxes. The key to these approaches is to accept full classical logic, and to accept the principles that cause paradox, while preventing trouble by allowing a certain sort ofnontransitivity. Earlier papers have treated paradoxes of truth and vagueness. The present paper will begin to extend the approach to deal with the familiar paradoxes arising in naive set theory, pointing out some of the promises and (...) pitfalls of such an approach. (shrink)

Counterfactuals are typically thought--given the force of Sobel sequences--to be variably strict conditionals. I go the other way. Sobel sequences and (what I call) Hegel sequences push us to a strict conditional analysis of counterfactuals: counterfactuals amount to some necessity modal scoped over a plain material conditional, just which modal being a function of context. To make this worth saying I need to say just how counterfactuals and context interact. No easy feat, but I have something to say on the (...) matter. (shrink)

Structural proof theory is a branch of logic that studies the general structure and properties of logical and mathematical proofs. This book is both a concise introduction to the central results and methods of structural proof theory, and a work of research that will be of interest to specialists. The book is designed to be used by students of philosophy, mathematics and computer science. The book contains a wealth of results on proof-theoretical systems, including extensions of such systems from logic (...) to mathematics, and on the connection between the two main forms of structural proof theory - natural deduction and sequent calculus. The authors emphasize the computational content of logical results. A special feature of the volume is a computerized system for developing proofs interactively, downloadable from the web and regularly updated. (shrink)

Higginbotham (1986) observed that quantified conditionals have a stronger meaning than might be expected, as attested by the apparent equivalence of examples like No student will pass if he goofs off and Every student will fail if he goofs off. Higginbotham's observation follows straightforwardly given the validity of conditional excluded middle (CEM; as observed by von Fintel & Iatridou 2002), and as such could be taken as evidence thereof (e.g. Williams forthcoming). However, the empirical status of CEM has been disputed, (...) and it is invalid under many prominent theories of conditionals—notably Lewis (1973) for counterfactuals, also Kratzer (1979, 1991). More acutely, Higginbotham's observation holds even for quantified counterparts of conditionals that appear not to obey CEM (Higginbotham 2003), and the standard way of explaining (away) such apparent counterexamples to the principle, à la Stalnaker (1981), does not directly yield an account of our apparent truth-conditional intuitions about the quantified counterparts (Leslie 2009). This article provides an explanation for the latter intuitions within Stalnaker's framework, the upshot being that CEM does remain a viable explanation, in principle, for Higginbotham's observation. (shrink)

In this essay I renew the case for Conditional Excluded Middle (CXM) in light of recent developments in the semantics of the subjunctive conditional. I argue that Michael Tooley’s recent backward causation counterexample to the Stalnaker-Lewis comparative world similarity semantics undermines the strongest argument against CXM, and I offer a new, principled argument for the validity of CXM that is in no way undermined by Tooley’s counterexample. Finally, I formulate a simple semantics for the subjunctive conditional that is consistent with (...) both CXM and Tooley’s counterexample. (shrink)

The compositional semantics of sentences like Only mammals give live birth and The flag flies only if the Queen is home is a tough problem. Evidence is presented to show that only here is modifying an underlying proposition (its ‘prejacent’). After discussing the semantics of only, the question of the proper interpretation of the prejacent is explored. It would be nice if the prejacent could be analyzed as having existential quantificational force. But that is difficult to maintain, since the prejacent (...) structures when encountered on their own are naturally read as having a lawlike flavor, which in many analyses is attributed to the semantics of implicit operators alleged to be present in them. In the end, an analysis is presented which attributes some very particular properties to these operators and thereby succeeds in providing the target sentences with intuitively adequate interpretations. These complex constructions can therefore be used as a probe into the nature of implicit quantification in natural language. (shrink)