Whether assent ("acceptance") and dissent ("rejection") are thought of as speech acts or as propositional attitudes, the leading idea of rejectivism is that a grasp of the distinction between them is prior to our understanding of negation as a sentence operator, this operator then being explicable as applying to A to yield something assent to which is tantamount to dissent from A. Widely thought to have been refuted by an argument of Frege's, rejectivism has undergone something of a revival in (...) recent years, especially in writings by Huw Price and Timothy Smiley. While agreeing that Frege's argument does not refute the position, we shall air some philosophical qualms about it in Section 5, after a thorough examination of the formal issues in Sections 1-4. This discussion draws on - and seeks to draw attention to - some pertinent work of Kent Bendall in the 1970s. (shrink)

People reject ‘paradoxical’ inferences, such as: Luisa didn't play music; therefore, if Luisa played soccer, then she didn't play music. For some theorists, they are invalid for everyday conditionals, but valid in logic. The theory of mental models implies that they are valid, but unacceptable because the conclusion refers to a possibility inconsistent with the premise. Hence, individuals should accept them if the conclusions refer only to possibilities consistent with the premises: Luisa didn't play soccer; therefore, if Luisa played a (...) game then she didn't play soccer. Two experiments corroborated this prediction for three sorts of ‘paradox’, including a disjunctive paradox. (shrink)

Wittgensteinian predicate logic (W-logic) is characterized by the requirement that the objects mentioned within the scope of a quantifier be excluded from the range of the associated bound variable. I present a sound and complete tableaux calculus for this logic and discuss issues of translatability between Wittgensteinian and standard predicate logic in languages with and without individual constants. A metalinguistic co-denotation predicate, akin to Frege’s triple bar of the Begriffsschrift, is introduced and used to bestow the full expressive power of (...) first-order logic with identity on W-logic in the presence of constants. (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)

Human cognition requires coping with a complex and uncertain world. This suggests that dealing with uncertainty may be the central challenge for human reasoning. In Bayesian Rationality we argue that probability theory, the calculus of uncertainty, is the right framework in which to understand everyday reasoning. We also argue that probability theory explains behavior, even on experimental tasks that have been designed to probe people's logical reasoning abilities. Most commentators agree on the centrality of uncertainty; some suggest that there is (...) a residual role for logic in understanding reasoning; and others put forward alternative formalisms for uncertain reasoning, or raise specific technical, methodological, or empirical challenges. In responding to these points, we aim to clarify the scope and limits of probability and logic in cognitive science; explore the meaning of the explanation of cognition; and re-evaluate the empirical case for Bayesian rationality. (shrink)

We show that Smullyan's analytic tableaux cannot p-simulate the truth-tables. We identify the cause of this computational breakdown and relate it to an underlying semantic difficulty which is common to the whole tradition originating in Gentzen's sequent calculus, namely the dissonance between cut-free proofs and the Principle of Bivalence. Finally we discuss some ways in which this principle can be built into a tableau-like method without affecting its analytic nature.

The human imagination remains one of the last uncharted terrains of the mind. People often imagine how events might have turned out something had been different. The of reality, those aspects more readily changed, indicate that counterfactual thoughts are guided by the same principles as rational thoughts. In the past, rationality and imagination have been viewed as opposites. But research has shown that rational thought is more imaginative than cognitive scientists had supposed. In The Rational Imagination, I argue that imaginative (...) thought is more rational than scientists have imagined. People exhibit remarkable similarities in the sorts of things they change in their mental representation of reality when they imagine how the facts could have turned out differently. For example, they tend to imagine alternatives to actions rather than inactions, events within their control rather than those beyond their control, and socially unacceptable events rather than acceptable ones. Their thoughts about how an event might have turned out differently lead them to judge that a strong causal relation exists between an antecedent event and the outcome, and their thoughts about how an event might have turned out the same lead them to judge that a weaker causal relation exists. In a simple temporal sequence, people tend to imagine alternatives to the most recent event. The central claim in the book is that counterfactual thoughts are organised along the same principles as rational thought. The idea that the counterfactual imagination is rational depends on three steps: (1) humans are capable of rational thought; (2) they make inferences by thinking about possibilities; and (3) their counterfactual thoughts rely on thinking about possibilities, just as rational thoughts do. The sorts of possibilities that people envisage explain the mutability of certain aspects of mental representations and the immutability of other aspects. (shrink)

Tableau formulations are given for the relevance logics E (Entailment), R (Relevant implication) and RM (Mingle). Proofs of equivalence to modus-ponens-based formulations are vialeft-handed Gentzen sequenzen-kalküle. The tableau formulations depend on a detailed analysis of the structure of tableau rules, leading to certain global requirements. Relevance is caught by the requirement that each node must be used; modality is caught by the requirement that only certain rules can cross a barrier. Open problems are discussed.

Some philosophers argue that the principles of human reasoning are impeccable, and that mistakes are no more than momentary lapses in “information processing”. This article makes a case to the contrary. It shows that human reasoners commit systematic fallacies. The theory of mental models predicts these errors. It postulates that individuals construct mental models of the possibilities to which the premises of an inference refer. But, their models usually represent what is true in a possibility, not what is false. This (...) procedure reduces the load on working memory, and for the most part it yields valid inferences. However, as a computer program implementing the theory revealed, it leads to fallacious conclusions for certain inferences—those for which it is crucial to represent what is false in a possibility. Experiments demonstrate the variety of these fallacies and contrast them with control problems, which reasoners tend to get right. The fallacies can be compelling illusions, and they occur in reasoning based on sentential connectives such as “if” and “or”, quantifiers such as “all the artists” and “some of the artists”, on deontic relations such as “permitted” and “obligated”, and causal relations such as “causes” and “allows”. After we have reviewed the principal results, we consider the potential for alternative accounts to explain these illusory inferences. And we show how the illusions illuminate the nature of human rationality. (shrink)

In this paper, I develop a new set of doxastic logical systems and I show how they can be used to solve several well-known problems in doxastic logic, for example the so-called problem of logical omniscience. According to this puzzle, the notions of knowledge and belief that are used in ordinary epistemic and doxastic symbolic systems are too idealised. Hence, those systems cannot be used to model ordinary human or human-like agents' beliefs. At best, they can describe idealised individuals. The (...) systems in this paper can be used to symbolise not only the doxastic states of perfectly rational individuals, but also the beliefs of finite humans. Proof-theoretically, I will use a tableau technique. Every system is combined with predicate logic with necessary identity and ‘possibilist’ quantifiers and modal logic with two kinds of modal operators for relative and absolute necessity. The semantics is a possible world semantics. Finally, I prove that every tableau system in the paper is sound and complete with respect to its semantics. (shrink)

This paper is partly a tribute to Richard Jeffrey, partly a reflection on some of his writings, The Logic of Decision in particular. I begin with a brief biography and some fond reminiscences of Dick. I turn to some of the key tenets of his version of Bayesianism. All of these tenets are deployed in my discussion of his response to the St. Petersburg paradox, a notorious problem for decision theory that involves a game of infinite expectation. Prompted by that (...) paradox, I conclude with some suggestions of avenues for future research. (shrink)

This paper will present two contributions to teaching introductory logic. The first contribution is an alternative tree proof method that differs from the traditional one-sided tree method. The second contribution combines this tree system with an index system to produce a user-friendly tree method for sentential modal logic.

The paper is concerned with the development of the paradoxical theme of Daoism. Based on Chad Hansen's interpretation of Daoism and Chinese philosophy in general, it traces the history of Daoism by following their treatment of the limit of language. The Daoists seem to have noticed that there is a limit to what language can do and that the limit of language is paradoxical. The 'theoretical' treatment of the paradox of the limit of language matures as Daoism develops. Yet the (...) Daoists seem to have noticed that the limit of language and its paradoxical nature cannot be overcome. At the end, we are left with the paradoxes of the Daoists. In this paper, we jump into the abyss of the Daoists' paradoxes from which there is no escape. But the Daoists' paradoxes are fun! (shrink)

Bryne & Hajek (1997) argue that Lewis’s (1988; 1996) objections to identifying desire with belief do not go through if our notion of desire is ‘causalized’ (characterized by causal, rather than evidential, decision theory). I argue that versions of the argument go through on certain assumptions about the formulation of decision theory. There is one version of causal decision theory where the original arguments cannot be formulated—the ‘imaging’ formulation that Joyce (1999) advocates. But I argue this formulation is independently objectionable. (...) If we want to maintain the desire as belief thesis, there’s no shortcut through causalization. (shrink)

This paper offers the Boolean many-valued solution to the Sorites Paradox. According to the precisification-based Boolean many-valued theory, from which this solution arises, sentences have not only two truth values, truth (or 1) and falsity (or 0), but many Boolean values between 0 and 1. The Boolean value of a sentence is identified with the set of precisifications in which the sentence is true. Unlike degrees fuzzy logic assigns to sentences, Boolean many values are not linearly but only partially ordered; (...) so there are values that are incomparable. Despite this fact, the sentences in a sorites series can be taken as having values in a linear order, and losing (or gaining) value as we move from sentence to sentence in the series. So there is no sharp borderline between 0 and 1. Assigning Boolean many values instead of the two truth values to sentences for their vagueness values is analogous to assigning propositions instead of the truth values to sentences for their semantic values, as propositions are, from our viewpoint, also Boolean many values. (shrink)

This paper presents a tree method for testing the validity of inferences, including syllogisms, in a simple term logic. The method is given in the form of an algorithm and is shown to be sound and complete with respect to the obvious denotational semantics. The primitive logical constants of the system, which is indebted to the logical works of Jevons, Brentano and Lewis Carroll, are term negation, polyadic term conjunction, and functors affirming and denying existence, and use is also made (...) of a metalinguistic concept of formal synonymy. It is indicated briefly how the method may be extended to other systems. (shrink)

In Paradoxa Stoicorum, the Roman philosopher Cicero defends six important Stoic theses. Since these theses seem counterintuitive, and it is not likely that the average person would agree with them, they were generally called "paradoxes". According to the third paradox, (P3), (all) transgressions (wrong actions) are equal and (all) right actions are equal. According to one interpretation of this principle, which I will call (P3′), it means that if it is forbidden that A and it is forbidden that B, then (...) not-A is as good as not-B; and if it is permitted that A and it is permitted that B, then A is as good as B. In this paper, I show how it is possible to prove this thesis in dyadic deontic logic. I also try to defend (P3′) against some philosophical counterarguments. Furthermore, I address the claim that (P3′) is not a correct interpretation of Cicero’s third paradox and the assertion that it does not matter whether (P3′) is true or not. I argue that it does matter whether (P3′) is true or not, but acknowledge that (P3′) is perhaps a slightly different principle than Cicero’s thesis. The upshot is that (P3′) seems to be a plausible principle, and that at least one part of paradox III in Cicero’s Paradoxa Stoicorum appears to be defensible. (shrink)

I revisit my 1993 paper on Putnam and mathematical realism focusing on the indispensability argument and how it has fared over the years. This argument starts from the claim that mathematics is an indispensable part of science and draws the conclusion, from holistic considerations about confirmation, that the ontology of science includes abstract objects as well as the physical entities science deals with.

Various authors of logic texts are cited who either suggest or explicitly state that the Gödel incompleteness result shows that some unprovable sentence of arithmetic is true. Against this, the paper argues that the matter is one of philosophical controversy, that it is not a mathematical or logical issue.

Jean van Heijenoort was best known for his editorial work in the history of mathematical logic. I survey his contributions to model-theoretic proof theory, and in particular to the falsifiability tree method. This work of van Heijenoort’s is not widely known, and much of it remains unpublished. A complete list of van Heijenoort’s unpublished writings on tableaux methods and related work in proof theory is appended.

Two uses of ‘if are discussed which do not involve conditions. The first is illustrated in the example ‘If he's here, I don't see him’, the second in ‘He's not a dunce, if a trifle stupid’. A third non‐conditional use, cognate with the first is also mentioned: it would be illustrated in the example ‘If he's a Dutchman, I'll eat my hat’. It is argued that recent attempts to formulate a logic of conditionals have distorted our understanding of ‘if, by (...) ignoring these uses, sometimes deliberately. Specifically, as a result, many arguments involving ‘if have been misjudged as invalid, because the expectation has been that ‘if expresses a condition. It is suggested that the traditional analysis of ‘necessary and sufficient conditions’ in terms of ‘if and only if, is partly to blame for these misunderstandings. And the proper understanding of ‘if’ which emerges shows it is quite fully captured in the propositional calculus. (shrink)

Routley?s Formula says, for instance, that if it is believed there is a man then there is something which is believed to be a man. In this paper I defend the formula; first directly, but then by looking at work by Gensler and Hintikka against it, and at the original work of Routley, Meyer and Goddard for it. The argument ultimately reduces to a central point about the extensionality of objects in Routley, Meyer and Goddard?s intensional system, i.e. in its (...) formulation of transparency. (shrink)

Hypersequents are a natural generalization of ordinary sequents which turn out to be a very suitable tool for presenting cut-free Gentzent-type formulations for diverse logics. In this paper, an alternative way of formulating hypersequent calculi (by introducing meta-variables for formulas, sequents and hypersequents in the object language) is presented. A suitable category of hypersequent calculi with their morphisms is defined and both types of fibring (constrained and unconstrained) are introduced. The introduced morphisms induce a novel notion of translation between logics (...) which preserves metaproperties in a strong sense. Finally, some preservation features are explored. (shrink)

What is logical relevance? Anderson and Belnap say that the “modern classical tradition [,] stemming from Frege and Whitehead-Russell, gave no consideration whatsoever to the classical notion of relevance.” But just what is this classical notion? I argue that the relevance tradition is implicitly most deeply concerned with the containment of truth-grounds, less deeply with the containment of classes, and least of all with variable sharing in the Anderson–Belnap manner. Thus modern classical logicians such as Peirce, Frege, Russell, Wittgenstein, and (...) Quine are implicit relevantists on the deepest level. In showing this, I reunite two fields of logic which, strangely from the traditional point of view, have become basically separated from each other: relevance logic and diagram logic. I argue that there are two main concepts of relevance, intensional and extensional. The first is that of the relevantists, who overlook the presence of the second in modern classical logic. The second is the concept of truth-ground containment as following from in Wittgenstein’s Tractatus. I show that this second concept belongs to the diagram tradition of showing that the premisses contain the conclusion by the fact that the conclusion is diagrammed in the very act of diagramming the premisses. I argue that the extensional concept is primary, with at least five usable modern classical filters or constraints and indefinitely many secondary intensional filters or constraints. For the extensional concept is the genus of deductive relevance, and the filters define species. Also following the Tractatus, deductive relevance, or full truth-ground containment, is the limit of inductive relevance, or partial truth-ground containment. Purely extensional inductive or partial relevance has its filters or species too. Thus extensional relevance is more properly a universal concept of relevance or summum genus with modern classical deductive logic, relevantist deductive logic, and inductive logic as its three main domains. (shrink)

An argument against multiply instantiable universals is considered in neglected essays by Stanislaw Lesniewski and I.M. Bochenski. Bochenski further applies Lesniewski's refutation of universals by maintaining that identity principles for individuals must be different than property identity principles. Lesniewski's argument is formalized for purposes of exact criticism and shown to involve both a hidden vicious circularity in the form of impredicative definitions and explicit self-defeating consequences. Syntactical restrictions on Leibnizian indiscernibility of identicals are recommended to forestall Lesniewski's paradox.

This paper is an experiment in Leibnizian analysis. The reader will recall that Leibniz considered all true sentences to be analytically so. The difference, on his account, between necessary and contingent truths is that sentences reporting the former are finitely analytic; those reporting the latter require infinite analysis of which God alone is capable. On such a view at least two competing conceptions of entailment emerge. According to one, a sentence entails another when the set of atomic requirements for the (...) first is included in the corresponding set for the other; according to the other conception, every atomic requirement of the entailed sentence is underwritten by an atomic constituent of the entailing one. The former conception is classical on the twentieth century understanding of the term; the latter is the one we explore here. Now if we restrict ourselves to the formal language of the propositional calculus, every sentence has a finite analysis into its conjunctive normal form. Semantically, then, every sentence of that language can be represented as a simple hypergraph, H, on the powerset of a universe of states. Entailment of the sort we wish to study can be represented as a known relation, subsumption between hypergraphs. Since the lattice of hypergraphs thus ordered is a DeMorgan lattice, the logic of entailment thus understood is the familiar system, FDE of first-degree entailment. We observe that, extensionalized, the relation of subsumption is itself a DeMorgan Lattice ordered by higher-order subsumption. Thus the semantic idiom that hypergraph-theory affords reveals a hierarchy of lattices capable of representing entailments of every finite degree. (shrink)

The postulation by the “epistemic” theory of vagueness of a cut-off point between heaps and non-heaps has made it seem incredible. Surely, the critics argue, a vague predicate doesn’t divide the universe into a set and its complement. I argue in response that an objection of a similar kind can be leveled against most theories of vagueness. The only two which avoid it are untenable. The objection is less compelling than it initially seems. However, even when this obstacle is removed, (...) the epistemic theory is not yet vindicated. (shrink)