The paper tries to spell out a connection between deductive logic and rationality, against Harman's arguments that there is no such connection, and also against the thought that any such connection would preclude rational change in logic. One might not need to connect logic to rationality if one could view logic as the science of what preserves truth by a certain kind of necessity (or by necessity plus logical form); but the paper points out a serious obstacle to any such (...) view. (shrink)

This paper defends a counterexample to Modus Tollens, and uses it to draw some conclusions about the logic and semantics of indicative conditionals and probability operators in natural language. Along the way we investigate some of the interactions of these expressions with 'knows', and we call into question the thesis that all knowledge ascriptions have truth-conditions.

Epistemic modal operators give rise to something very like, but also very unlike, Moore's paradox. I set out the puzzling phenomena, explain why a standard relational semantics for these operators cannot handle them, and recommend an alternative semantics. A pragmatics appropriate to the semantics is developed and interactions between the semantics, the pragmatics, and the definition of consequence are investigated. The semantics is then extended to probability operators. Some problems and prospects for probabilistic representations of content and context are explored.

Every adequate semantics for conditionals and deontic ought must offer a solution to the miners paradox about conditional obligations. Kolodny and MacFarlane have recently argued that such a semantics must reject the validity of modus ponens. I demonstrate that rejecting the validity of modus ponens is inessential for an adequate solution to the paradox.

The aim of this paper is twofold: (i) to introduce the framework of update semantics and to explain what kind of semantic phenomena may successfully be analysed in it: (ii) to give a detailed analysis of one such phenomenon: default reasoning.

This paper is on the update semantics for might of Veltman. Threeconsequence relations are introduced and studied in an abstract setting.Next we present sequent-style systems for each of the consequence relations.We show the logics to be complete and decidable. The paper ends with asyntactic cut elimination result.

This paper is on the update semantics for might of Veltman. Threeconsequence relations are introduced and studied in an abstract setting.Next we present sequent-style systems for each of the consequence relations.We show the logics to be complete and decidable. The paper ends with asyntactic cut elimination result.

Let me start with a well-known story. Kant held that logic and conceptual analysis alone cannot account for our knowledge of arithmetic: “however we might turn and twist our concepts, we could never, by the mere analysis of them, and without the aid of intuition, discover what is the sum [7+5]” (KrV, B16). Frege took himself to have shown that Kant was wrong about this. According to Frege’s logicist thesis, every arithmetical concept can be defined in purely logical terms, and (...) every theorem of arithmetic can be proved using only the basic laws of logic. Hence, Kant was wrong to think that our grasp of arithmetical concepts and our knowledge of arithmetical truth depend on an extralogical source—the pure intuition of time (Frege 1884, §89, §109). Arithmetic, properly understood, is just a part of logic. (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)

It might be thought that we could argue for the consistency of a mathematical theory T within T, by giving an inductive argument that all theorems of T are true and inferring consistency. By Gödel's second incompleteness theorem any such argument must break down, but just how it breaks down depends on the kind of theory of truth that is built into T. The paper surveys the possibilities, and suggests that some theories of truth give far more intuitive diagnoses of (...) the breakdown than do others. The paper concludes with some morals about the nature of validity and about a possible alternative to the idea that mathematical theories are indefinitely extensible. (shrink)

There are quite a few theses about logic that are in one way or another pluralist: they hold (i) that there is no uniquely correct logic, and (ii) that because of this, some or all debates about logic are illusory, or need to be somehow reconceived as not straightforwardly factual. Pluralist theses differ markedly over the reasons offered for there being no uniquely correct logic. Some such theses are more interesting than others, because they more radically affect how we are (...) initially inclined to understand debates about logic. Can one find a pluralist thesis that is high on the interest scale, and also true? (shrink)

Covers first-order language in method appropriate for first and second courses in logic. CD-ROM consists of a new book, 3 programs,and an Internet-based grading service.

The standard use of the propositional calculus ('P.C.?) in analyzing the validity of inferences involving conditionals leads to fallacies, and the problem is to determine where P.C. may be ?safely? used. An alternative analysis of criteria of reasonableness of inferences in terms of conditions of justification rather than truth of statements is proposed. It is argued, under certain restrictions, that P. C. may be safely used, except in inferences whose conclusions are conditionals whose antecedents are incompatible with the premises in (...) the sense that if the antecedent became known, some of the previously asserted premises would have to be withdrawn. (shrink)

Situation Theory grew out of attempts by Jon Barwise in the late 1970s to provide a semantics for 'naked-infinitive' perceptual reports such as 'Claire saw Jon run'. Barwise's intuition was that Claire didn't just see Jon, an individual, but Jon doing something, a situation. Situations are individuals having properties and standing in relations. A theory of situations would allow us to study and compare various types of situations or situation-like entitles, such as facts, events, and scenes. One of the central (...) themes of situation theory of meaning and reference should be set within a general theory of information, one moreover that is rich enough to do justice to perception, communication, and thought. By now many people have contributed by the need to give a rigorous mathematical account of the principles of information that underwrite the theory. (shrink)

The present volume collects some of Barwise's papers written since then, those directly concerned with relations among logic, situation theory, and situation semantics. Several papers appear here for the first time.

Classical logic, beginning with the work of Aristotle, has developed into a powerful and rigorous mathematical theory with many applications in mathematics and ...

There is a lot that we don't know. That means that there are a lot of possibilities that are, epistemically speaking, open. For instance, we don't know whether it rained in Seattle yesterday. So, for us at least, there is an epistemic possibility where it rained in Seattle yesterday, and one where it did not. What are these epistemic possibilities? They do not match up with metaphysical possibilities - there are various cases where something is epistemically possible but not metaphysically (...) possible, and vice versa. How do we understand the semantics of statements of epistemic modality? The ten new essays in this volume explore various answers to these questions, including those offered by contextualism, relativism, and expressivism. (shrink)

A selective background -- Broadly classical approaches -- Paracompleteness -- More on paracomplete solutions -- Paraconsistent dialetheism.

This anthology of essays on the work of David Kaplan, a leading contemporary philosopher of language, sprang from a conference, "Themes from Kaplan," organized by the Center for the Study of Language and Information at Stanford University.

This book is a translation of some of the more important parts of the Grundgesetze of Frege: the introduction, the first part of the first volume which gives an exposition of the construction, rules, axioms of Frege's formal system, and two appendices, one of which is from the second volume and gives Frege's analysis of the paradox found by Russell in his system. The editor has provided a long introduction "for those not familiar with Frege," although it will benefit those (...) who have something more than acquaintance with his name as well. Frege's original two-dimensional symbolism has been preserved, but the editor has provided enough discussion in his introduction so as to make the going easier. Next to a complete translation of the Grundgesetze, this work is the most useful introduction to the magnum opus of the nineteenth century's greatest logician.—P. J. M. (shrink)

According to operator theories, "if" denotes a two-place operator. According to restrictor theories, "if" doesn't contribute an operator of its own but instead merely restricts the domain of some co-occurring quantifier. The standard arguments (Lewis 1975, Kratzer 1986) for restrictor theories have it that operator theories (but not restrictor theories) struggle to predict the truth conditions of quantified conditionals like -/- (1) a. If John didn't work at home, he usually worked in his office. b. If John didn't work at (...) home, he must have worked in his office. -/- Gillies (2010) offers a context-shifty conditional operator theory that predicts the right truth conditions for epistemically modalized conditionals like (1b), thus undercutting one standard argument for restrictor theories. I explore how we might generalize Gillies' theory to adverbially quantified conditionals like (1a) and deontic conditionals, and argue that a natural generalization of Gillies' theory -- following his strategy for handling epistemically modalized conditionals -- won't work for these other conditionals because a crucial assumption that epistemic modal bases are closed (used to neutralize the epistemic quantification contributed by "if") doesn't have plausible analogs in these other domains. (shrink)