There are schools of logicians who claim that an argument is not valid unless the conclusion is relevant to the premises. In particular, relevance logicians reject the classical theses that anything follows from a contradiction and that a logical truth follows from everything. This chapter critically evaluates several different motivations for relevance logic, and several systems of relevance logic, finding them all wanting.

The general problem of visual search can be shown to be computationally intractable in a formal, complexity-theoretic sense, yet visual search is extensively involved in everyday perception, and biological systems manage to perform it remarkably well. Complexity level analysis may resolve this contradiction. Visual search can be reshaped into tractability through approximations and by optimizing the resources devoted to visual processing. Architectural constraints can be derived using the minimum cost principle to rule out a large class of potential solutions. The (...) evidence speaks strongly against bottom-up approaches to vision. In particular, the constraints suggest an attentional mechanism that exploits knowledge of the specific problem being solved. This analysis of visual search performance in terms of attentional influences on visual information processing and complexity satisfaction allows a large body of neurophysiological and psychological evidence to be tied together. (shrink)

We present a bimodal logic suitable for formalizing reasoning about points and sets, and also states of the world and views about them. The most natural interpretation of the logic is in subset spaces , and we obtain complete axiomatizations for the sentences which hold in these interpretations. In addition, we axiomatize the validities of the smaller class of topological spaces in a system we call topologic . We also prove decidability for these two systems. Our results on topologic relate (...) early work of McKinsey on topological interpretations of S4 with recent work of Georgatos on topologic. Some of the results of this paper were presented at the 1992 conference on Theoretical Aspects of Reasoning about Knowledge. (shrink)

We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive formulae (...) are elementary canonical and thus extend Sahlqvist’s theorem over them. In particular, we give a simple example of an inductive formula which is not frame-equivalent to any Sahlqvist formula. Then, after a deeper analysis of the inductive formulae as set-theoretic operators in descriptive and Kripke frames, we establish a somewhat stronger model-theoretic characterization of these formulae in terms of a suitable equivalence to syntactically simpler formulae in the extension of the language with reversive modalities. Lastly, we study and characterize the elementary canonical formulae in reversive languages with nominals, where the relevant notion of persistence is with respect to discrete frames. (shrink)

In this thesis we present two logical systems, $\bf MP$ and $\MP$, for the purpose of reasoning about knowledge and effort. These logical systems will be interpreted in a spatial context and therefore, the abstract concepts of knowledge and effort will be defined by concrete mathematical concepts.

Questions are triggers for explicit events of ‘issue management’. We give a complete logic in dynamic-epistemic style for events of raising, refining, and resolving an issue, all in the presence of information flow through observation or communication. We explore extensions of the framework to multi-agent scenarios and long-term temporal protocols. We sketch a comparison with some alternative accounts.

We propose a non-standard interpretation of Alternating-time Temporal Logic with imperfect information, for which no commonly accepted semantics has been proposed yet. Rather than changing the semantic structures, we generalize the usual interpretation of formulae in single states to sets of states. We also propose a new epistemic operator for ?practical? or ?constructive? knowledge, and we show that the new logic (which we call Constructive Strategic Logic) is strictly more expressive than most existing solutions, while it retains the same model (...) checking complexity. Finally, we study properties of constructive knowledge and other operators in this non-standard semantics. (shrink)

This is identical with the first edition (see 21: 2716) except for the addition of a Supplement containing 5 previously published articles and the bringing of the bibliography (now 73 items) up to date. The 5 added articles present clarifications or modifications of views expressed in the first edition. (PsycINFO Database Record (c) 2009 APA, all rights reserved).

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)

This modern, advanced textbook reviews modal logic, a field which caught the attention of computer scientists in the late 1970's.

This paper studies Aumann’s agreeing to disagree theorem from the perspective of dynamic epistemic logic. This was first done by Dégremont and Roy (J Phil Log 41:735–764, 2012) in the qualitative framework of plausibility models. The current paper uses a probabilistic framework, and thus stays closer to Aumann’s original formulation. The paper first introduces enriched probabilistic Kripke frames and models, and various ways of updating them. This framework is then used to prove several agreement theorems, which are natural formalizations of (...) Aumann’s original result. Furthermore, a sound and complete axiomatization of a dynamic agreement logic is provided, in which one of these agreement theorems can be derived syntactically. These technical results are used to show the importance of explicitly representing the dynamics behind the agreement theorem, and lead to a clarification of some conceptual issues surrounding the agreement theorem, in particular concerning the role of common knowledge. The formalization of the agreement theorem thus constitutes a concrete example of the so-called dynamic turn in logic. (shrink)

A well-known open problem in epistemic logic is to give a syntactic characterization of the successful formulas. Semantically, a formula is successful if and only if for any pointed model where it is true, it remains true after deleting all points where the formula was false. The classic example of a formula that is not successful in this sense is the “Moore sentence” p ∧ ¬BOXp, read as “p is true but you do not know p.” Not only is the (...) Moore sentence unsuccessful, it is self-refuting, for it never remains true as described. We show that in logics of knowledge and belief for a single agent (extended by S5), Moorean phenomena are the source of all self-refutation; moreover, in logics for an introspective agent (extending KD45), Moorean phenomena are the source of all unsuccessfulness as well. This is a distinctive feature of such logics, for with a non-introspective agent or multiple agents, non-Moorean unsuccessful formulas appear. We also consider how successful and self-refuting formulas relate to the Cartesian and learnable formulas, which have been discussed in connection with Fitch’s “paradox of knowability.” We show that the Cartesian formulas are exactly the formulas that are not eventually self-refuting and that not all learnable formulas are successful. In an appendix, we give syntactic characterizations of the successful and the self-refuting formulas. (shrink)

Externalists in epistemology often reject the KK principle – which says that if a person knows that p, then they know that they know that p. This paper argues that one standard argument against the KK principle that many externalists make is fallacious, as it involves illicit substitution into an intensional context. The fallacy is exposed and discussed.

Counterfactual attitudes like imagining, dreaming, and wishing create a problem for the standard formal semantic theory of de re attitude ascriptions. I show how the problem can be avoided if we represent an agent's attitudinal possibilities using "multi-centered worlds", possible worlds with multiple distinguished individuals, each of which represents an individual with whom the agent is acquainted. I then present a compositional semantics for de re ascriptions according to which singular terms are "assignment-sensitive" expressions and attitude verbs are "assignment shifters".

This paper provides equational semantics for Dung's argumentation networks. The network nodes get numerical values in [0,1], and are supposed to satisfy certain equations. The solutions to these equations correspond to the ?extensions? of the network. This approach is very general and includes the Caminada labelling as a special case, as well as many other so-called network extensions, support systems, higher level attacks, Boolean networks, dependence on time, and much more. The equational approach has its conceptual roots in the nineteenth (...) century following the algebraic equational approach to logic by George Boole, Louis Couturat, and Ernst Schroeder. (shrink)

'The Probabilistic Mind' is a follow-up to the influential and highly cited 'Rational Models of Cognition'. It brings together developments in understanding how, and how far, high-level cognitive processes can be understood in rational terms, and particularly using probabilistic Bayesian methods.

It is common to assume that the problem of induction arises only because of small sample sizes or unreliable data. In this paper, I argue that the piecemeal collection of data can also lead to underdetermination of theories by evidence, even if arbitrarily large amounts of completely reliable experimental and observational data are collected. Specifically, I focus on the construction of causal theories from the results of many studies (perhaps hundreds), including randomized controlled trials and observational studies, where the studies (...) focus on overlapping, but not identical, sets of variables. Two theorems reveal that, for any collection of variables V, there exist fundamentally different causal theories over V that cannot be distinguished unless all variables are simultaneously measured. Underdetermination can result from piecemeal measurement, regardless of the quantity and quality of the data. Moreover, I generalize these results to show that, a priori, it is impossible to choose a series of small (in terms of number of variables) observational studies that will be most informative with respect to the causal theory describing the variables under investigation. This final result suggests that scientific institutions may need to play a larger role in coordinating differing research programs during inquiry. (shrink)

Presents a mathematically rigorous, philosophically sound foundation for a science of information.

Free will sceptics claim that we do not possess free will—or at least, that we do not possess nearly as much free will as we think we do. Some free will sceptics hold that the very notion of free will is incoherent, and that no being could possibly possess free will (Strawson this volume). Others allow that the notion of free will is coherent, but hold that features of our cognitive architecture prevent us from possessing free will. My concern in (...) this chapter is with views of the second kind. According to an increasingly influential line of thought, our common-sense commitment to the existence of free will is threatened in unique ways by what we are learning from the sciences of human agency. (shrink)

Das Ziel: Konstitutionssystem der Begriffe Das Ziel der vorliegenden Untersuchungen ist die Aufstellung eines erkenntnismäßig-logischen Systems der ...

Probability, Frequency and Reasonable Expectation.

When one looks into the role of artificial languages in philosophy of language it seems appropriate to start with making a distinction between philosophy of language proper and formal semantics of natural language. Although the distinction between the two disciplines may not always be easy to make since there arguably exist substantial historical and systematic relationships between the two, it nevertheless pays to keep the two apart, at least initially, since the motivation commonly given for the use of artificial languages (...) in philosophy of language is often rather different from the one that drives the use of such languages in semantics. Of course, this difference in motivation should not blind us for the commonalities that exists between the two disciplines. Philosophy of language and formal semantics have a common history, and arguably also share some of their substance. Philosophy of language is by and large an outgrowth of work in the analytical tradition in philosophy in the first half of the twentieth century. Both ordinary language philosophy, with its emphasis on the description of actual language use, as well as the more logic-oriented and formally inclined school of logical positivism contributed to the definition of philosophy of language as a separate philosophical discipline, with its own set of problems and methods to solve them. Another major contributor to the establishment of philosophy of language as a distinct discipline has been modern linguistics, in particular generative grammar in the tradition of Chomsky that became the dominant paradigm in linguisticsin the fifties and sixties of the previous century. And as it happens, both the generative tradition of Chomsky and analytic philosophy in its formal and less formal guises have been important factors in the development of formal semantics as well. Thus, it should come as no surprise that the two have something in common. That the communalities go beyond a common ancestry, but are reflected in substance and methods as well, will be argued later on. However, be that as it may, it is still a good idea to keep philosophy of language and formal semantics separate, at least initially, since the role that is assigned to artificial languages and the ways in which these languages are employed in both does differ in a number of respects that are worth keeping in mind.. (shrink)

This paper is a brief history of natural logic at the interface of logic, linguistics, and nowadays also other disciplines. It merely summarizes some facts that deserve to be common knowledge.

Logic is not just about single-agent notions like reasoning, or zero-agent notions like truth, but also about communication between two or more people. What we tell and ask each other can be just as 'logical' as what we infer in Olympic solitude. We show how such interactive phenomena can be studied systematically by merging epistemic and dynamic logic.

We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consists of definable update rules for changing plausibility relations between worlds, which have been proposed independently in the dynamic-epistemic literature on preference change. Our analysis yields two new types of modal result. First, we obtain complete logics for concrete mechanisms of belief revision, based on compositional reduction axioms. Next, we show how various abstract postulates for (...) belief revision can be analyzed by standard modal frame correspondences for model-changing operations. (shrink)

We discuss games of both perfect and imperfect information at two levels of structural detail: players’ local actions, and their global powers for determining outcomes of the game. We propose matching logical languages for both. In particular, at the ‘action level’, imperfect information games naturally model a combined ‘dynamic-epistemic language’ – and we find correspondences between special axioms and particular modes of playing games with their information dynamics. At the ‘outcome level’, we present suitable notions of game equivalence, plus some (...) simple representation results. (shrink)

Game-theoretic solution concepts describe sets of strategy profiles that are optimal for all players in some plausible sense. Such sets are often found by recursive algorithms like iterated removal of strictly dominated strategies in strategic games, or backward induction in extensive games. Standard logical analyses of solution sets use assumptions about players in fixed epistemic models for a given game, such as mutual knowledge of rationality. In this paper, we propose a different perspective, analyzing solution algorithms as processes of learning (...) which change game models. Thus, strategic equilibrium gets linked to fixed-points of operations of repeated announcement of suitable epistemic statements. This dynamic stance provides a new look at the current interface of games, logic, and computation. (shrink)

With a few notable exceptions formal semantics, as it originated from the seminal work of Richard Montague, Donald Davidson, Max Cresswell, David Lewis and others, in the late sixties and early seventies of the previous century, does not consider Wittgenstein as one of its ancestors. That honour is bestowed on Frege, Tarski, Carnap. And so it has been in later developments. Most introductions to the subject will refer to Frege and Tarski (Carnap less frequently) —in addition to the pioneers just (...) mentioned, of course— , and discuss the main elements of their work that helped shape formal semantics in some detail. But Wittgenstein is conspicuously absent whenever the history of the subject is mentioned (usually briefly, if at all). Of course, if one thinks of Wittgenstein’s later work, this is obvious: nothing, it seems, could be more antithetic to what formal semantics aims for and to how it pursues those aims than the views on meaning and language that Wittgenstein expounds in, e.g., Philosophical Investigations, with its insistence on particularity and diversity, and its rejection of explanation and formal modelling. But what about his earlier work, the Tractatus (henceforth )? At first sight, that seems much more congenial, as it develops a conception of language and meaning that is both general and uniform, explanatory.. (shrink)

Two-dimensional (2D) semantics is a formal framework that is used to characterize the meaning of certain linguistic expressions and the entailment relations among sentences containing them. 2D semantics has also been applied to thought contents. In contrast with standard possible worlds semantics, 2D semantics assigns extensions and truth-values to expressions relative to two possible world parameters, rather than just one. So a 2D semantic framework provides finer-grained semantic values than those available within standard possible world semantics, while using the same (...) basic model-theoretic resources. The 2D framework itself is just a formal tool. To develop a semantic theory for someone’s language, a proponent of 2D semantics must do three things: (i) explain what exactly the two possible world parameters represent, (ii) explain the rules for assigning 2D semantic values to a person’s words and sentences, and (iii) explain how 2D semantic values help in understanding the meanings of the person’s words and sentences. (shrink)

Edmund Gettier is Professor Emeritus at the University of Massachusetts, Amherst. This short piece, published in 1963, seemed to many decisively to refute an otherwise attractive analysis of knowledge. It stimulated a renewed effort, still ongoing, to clarify exactly what knowledge comprises.

This article takes off from Johan van Benthem’s ruminations on the interface between logic and cognitive science in his position paper “Logic and reasoning: Do the facts matter?”. When trying to answer Van Benthem’s question whether logic can be fruitfully combined with psychological experiments, this article focuses on a specific domain of reasoning, namely higher-order social cognition, including attributions such as “Bob knows that Alice knows that he wrote a novel under pseudonym”. For intelligent interaction, it is important that the (...) participants recursively model the mental states of other agents. Otherwise, an international negotiation may fail, even when it has potential for a win-win solution, and in a time-critical rescue mission, a software agent may depend on a teammate’s action that never materializes. First a survey is presented of past and current research on higher-order social cognition, from the various viewpoints of logic, artificial intelligence, and psychology. Do people actually reason about each other’s knowledge in the way proscribed by epistemic logic? And if not, how can logic and cognitive science productively work together to construct more realistic models of human reasoning about other minds? The paper ends with a delineation of possible avenues for future research, aiming to provide a better understanding of higher-order social reasoning. The methodology is based on a combination of experimental research, logic, computational cognitive models, and agent-based evolutionary models. Keywords Epistemic logic - Cognitive science - Intelligent interaction - Cognitive modeling. (shrink)

The paper identifies some background assumptions of compositionality in formal semantics and investigates how they shape formal semantics as a scientific discipline.

This study synthesizes current information from the various fields of cognitive science in support of a new and exciting theory of mind. Most psychologists study horizontal processes like memory and information flow; Fodor postulates a vertical and modular psychological organization underlying biologically coherent behaviors. This view of mental architecture is consistent with the historical tradition of faculty psychology while integrating a computational approach to mental processes. One of the most notable aspects of Fodor's work is that it articulates features not (...) only of speculative cognitive architectures but also of current research in artificial intelligence. (shrink)

Contents. Introduction. 1. Preliminaries. 2. Normal Form Games. 3. Extensive Games. 4. Applications of Game Theory. 5. The Methodology of Game Theory. Conclusion. Appendix. Bibliography. Index. Does game theory—the mathematical theory of strategic interaction—provide genuine explanations of human behaviour? Can game theory be used in economic consultancy or other normative contexts? Explaining Games: The Epistemic Programme in Game Theory—the first monograph on the philosophy of game theory—is an attempt to combine insights from epistemic logic and the philosophy of science to (...) investigate the applicability of game theory in such fields as economics, philosophy and strategic consultancy. I prove new mathematical theorems about the beliefs, desires and rationality principles of individual human beings, and explore in detail the logical form of game theory as it is used in explanatory and normative contexts. I argue that game theory reduces to rational choice theory if used as an explanatory device, and that game theory is nonsensical if used as a normative device. A provocative account of the history of game theory reveals that this is not bad news for all of game theory, though. Two central research programmes in game theory tried to find the ultimate characterisation of strategic interaction between rational agents. Yet, while the Nash Equilibrium Refinement Programme has done badly thanks to such research habits as overmathematisation, model-tinkering and introversion, the Epistemic Programme, I argue, has been rather successful in achieving this aim. "The 'epistemic' approach to game theory has emerged over the past twenty-five years. What is this approach? How does it differ from the conventional equilibrium-based approach to game theory? What have been its strengths and weaknesses to date? To find out, read this comprehensive and excellently written account". Adam Brandenburger, J. P. Valles Professor of Business Economics and Strategy, Stern School of Business, New York University "Reading Boudewijn de Bruin's book should be rewarding both for game theorists interested in the conceptual foundations of their discipline and for philosophers who want to learn more about formal analysis of strategic interaction. It provides an in-depth logical study of the currently dominant epistemic approaches to non-cooperative games, with an eye both to the attractions and to the serious challenges facing the Epistemic Programme". Wlodek Rabinowicz, Professor of Practical Philosophy, Department of Philosophy, Lund University . (shrink)

We solve a major open problem concerning algorithmic properties of products of ‘transitive’ modal logics by showing that products and commutators of such standard logics as K4, S4, S4.1, K4.3, GL, or Grz are undecidable and do not have the finite model property. More generally, we prove that no Kripke complete extension of the commutator [K4,K4] with product frames of arbitrary finite or infinite depth (with respect to both accessibility relations) can be decidable. In particular, if.