The abstract structure of inquiry - the process of acquiring and changing beliefs about the world - is the focus of this book which takes the position that the "pragmatic" rather than the "linguistic" approach better solves the philosophical problems about the nature of mental representation, and better accounts for the phenomena of thought and speech. It discusses propositions and propositional attitudes (the cluster of activities that constitute inquiry) in general and takes up the way beliefs change in response to (...) potential new information, suggesting that conditional propositions should be understood as projections of epistemic policies onto the world.Robert C. Stalnaker is a professor in the Sage School of Philosophy at Cornell University. A Bradford Book. (shrink)

Modern modal logic originated as a branch of philosophical logic in which the concepts of necessity and possibility were investigated by means of a pair of dual operators that are added to a propositional or first-order language. The field owes much of its flavor and success to the introduction in the 1950s of the “possible-worlds” semantics in which the modal operators are interpreted via some “accessibility relation” connecting possible worlds. In subsequent years, modal logic has received attention as an attractive (...) approach towards formalizing such diverse notions as time, knowledge, or action. Nowadays, modal logics are applied in various disciplines, ranging from economics to linguistics and computer science. Consequently, there is by now a large variety of modal languages, with an even greater wealth of interpretations. For instance, many applications require a poly-modal framework consisting of a language with a family of modal operators and a semantics in which the corresponding accessibility relations are connected somehow. (shrink)

In an information state where various agents have both factual knowledge and knowledge about each other, announcements can be made that change the state of information. Such informative announcements can have the curious property that they become false because they are announced. The most typical example of that is 'fact p is true and you don't know that', after which you know that p, which entails the negation of the announcement formula. The announcement of such a formula in a given (...) information state is called an unsuccessful update. A successful formula is a formula that always becomes common knowledge after being announced. Analysis of information systems and 'philosophical puzzles' reveals a growing number of dynamic phenomena that can be described or explained by unsuccessful updates. This increases our understanding of such philosophical problems. We also investigate the syntactic characterization of the successful formulas. (shrink)

Statements not only update our current knowledge, but also have other dynamic effects. In particular, suggestions or commands ?upgrade' our preferences by changing the current order among worlds. We present a complete logic of knowledge update plus preference upgrade that works with dynamic-epistemic-style reduction axioms. This system can model changing obligations, conflicting commands, or ?regret'. We then show how to derive reduction axioms from arbitrary definable relation changes. This style of analysis also has a product update version with preferences between (...) actions, as well as worlds. Some illustrations are presented involving defaults and obligations. We conclude that our dynamic framework is viable, while admitting a further extension to more numerical ?utility update'. (shrink)

In this paper the problem of the relation between belief and acceptance is discussed in view of recent literature on the topic. Belief and acceptance are characterized in terms of a number of properties, which show both the similarities and the dissimilarities between these notions. In particular it is claimed - contrary to some recently expressed views - that acceptance need not be intentional action and that the differences between belief and acceptance do not boil down to the simple view (...) that acceptance, contrary to belief, is based on the agent's direct exercise of his will. Acceptance which is not based on intentional action is shown in the paper to be especially closely related to belief, especially to linguistic belief. Thus if a person is in a non-intentional-ly acquired and held state of acceptance that something p, he also believes that p. Another general difference is that acceptance is language-dependent while there can be non-linguistic belief. Collective beliefs and acceptances are also briefly discussed in the paper Among other things, it is noted that the notion of wide as contrasted with truth-oriented, narrow acceptance is central in the collective case. (shrink)

It is argued in this paper that there can be both normative and nonnormative, merely factual group beliefs. The former involve the whole social group in question, while the latter only relate to the distributions of personal beliefs within the group. The paper develops a detailed theory, called the positional account of group beliefs, to explicate normative, group-involving group beliefs. Normative group beliefs are characterized within this approach in terms of joint acceptances of views by the group members — or (...) their representatives — acting in their right positions and tasks, and in a sense creating group commitments for all the members to accept (and keep accepting) the view in question. Also aggregate accounts of group belief are considered in the paper, especially the shared we-belief approach. Such aggregate accounts purport to account for merely factual group beliefs. (shrink)

In 1985 Alchourrón, Gärdenfors and Makinson presented their now classic theory of theory change . In 1988 Adam Grove, generalizing David Lewis's theory of counterfactuals, presented a model theory suitable for the AGM theory. Although AGM and Grove mentioned object languages, neither used them. But recently, Maarten de Rijke has shown how object languages can be brought into the picture. In the present paper we take de Rijke's idea further, addressing the question whether there is a particular doxastic or epistemic (...) logic implicit in AGM. (shrink)

Multi-modal versions of propositional logics S5 or S4—commonly accepted as logics of knowledge—are capable of describing static states of knowledge but they do not reflect how the knowledge changes after communications among agents. In the present paper (part of broader research on logics of knowledge and communications) we define extensions of the logic S5 which can deal with public communications. The logics have natural semantics. We prove some completeness, decidability and interpretability results and formulate a general method that solves certain (...) kind of problems involving public communications—among them well known puzzles of Muddy Children and Mr. Sum & Mr. Product. As the paper gives a formal logical treatment of the operation of restriction of the universe of a Kripke model, it contributes also to investigations of semantics for modal logics. (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)

Logical puzzles like the doctrinal paradox raise the problem of how to aggregate individual judgements into a collective judgement, or alternatively, how to merge collectively inconsistent knowledge bases. In this paper, we view judgement aggregation as a function on propositional logic valuations, and we investigate how logic constrains judgement aggregation. In particular, we show that there is no non-dictatorial decision method for aggregating sets of judgements in a logically consistent way if the decision method is local, i.e., only depends on (...) the individual judgements on the proposition under consideration. (shrink)

We discuss similarities and residual differences, within the general semantic framework of minimality, between defeasible inference, belief revision, counterfactual conditionals, updating — and also conditional obligation in deontic logic. Our purpose is not to establish new results, but to bring together existing material to form a clear overall picture.

In this paper, I introduce the emerging theory of judgment aggregation as a framework for studying institutional design in social epistemology. When a group or collective organization is given an epistemic task, its performance may depend on its ‘aggregation procedure’, i.e. its mechanism for aggregating the group members’ individual beliefs or judgments into corresponding collective beliefs or judgments endorsed by the group as a whole. I argue that a group’s aggregation procedure plays an important role in determining whether the group (...) can meet two challenges: the ‘rationality challenge’ and the ‘knowledge challenge’. The rationality challenge arises when a group is required to endorse consistent beliefs or judgments; the knowledge challenge arises when the group’s beliefs or judgments are required to track certain truths. My discussion seeks to identify those properties of an aggregation procedure that affect a group’s success at meeting each of the two challenges. (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)

_ Convention_ was immediately recognized as a major contribution to the subject and its significance has remained undiminished since its first publication in 1969. Lewis analyzes social conventions as regularities in the resolution of recurring coordination problems-situations characterized by interdependent decision processes in which common interests are at stake. Conventions are contrasted with other kinds of regularity, and conventions governing systems of communication are given special attention.

In this paper, we present several extensions of epistemic logic with update operators modelling public information change. Next to the well-known public announcement operators, we also study public substitution operators. We prove many of the results regarding expressivity and completeness using so-called reduction axioms. We develop a general method for using reduction axioms and apply it to the logics at hand.

In this paper we investigate a logic for modelling individual and collective acceptances that is called acceptance logic. The logic has formulae of the form \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\rm A}_{G:x} \varphi$$\end{document} reading ‘if the agents in the set of agents G identify themselves with institution x then they together accept that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varphi}$$\end{document} ’. We extend acceptance logic by two kinds of dynamic modal operators. The first (...) kind are public announcements of the form \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${x!\psi}$$\end{document}, meaning that the agents learn that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\psi}$$\end{document} is the case in context x. Formulae of the form \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${[x!\psi]\varphi}$$\end{document} mean that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varphi}$$\end{document} is the case after every possible occurrence of the event x!ψ. Semantically, public announcements diminish the space of possible worlds accepted by agents and sets of agents. The announcement of ψ in context x makes all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\lnot\psi}$$\end{document} -worlds inaccessible to the agents in such context. In this logic, if the set of accessible worlds of G in context x is empty, then the agents in G are not functioning as members of x, they do not identify themselves with x. In such a situation the agents in G may have the possibility to join x. To model this we introduce here a second kind of dynamic modal operator of acceptance shifting of the form \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${G:x\uparrow\psi}$$\end{document}. The latter means that the agents in G shift (change) their acceptances in order to accept ψ in context x. Semantically, they make ψ-worlds accessible to G in the context x, which means that, after such operation, G is functioning as member of x (unless there are no ψ-worlds). We show that the resulting logic has a complete axiomatization in terms of reduction axioms for both dynamic operators. In the paper we also show how the logic of acceptance and its dynamic extension can be used to model some interesting aspects of judgement aggregation. In particular, we apply our logic of acceptance to a classical scenario in judgment aggregation, the so-called ‘doctrinal paradox’ or ‘discursive dilemma’ (Pettit, Philosophical Issues 11:268–299, 2001; Kornhauser and Sager, Yale Law Journal 96:82–117, 1986). (shrink)

This book provides the first comprehensive introduction to Dynamic Logic. Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys the singular advantage of being strongly related to classical logic. Its variants constitute natural generalizations and extensions of classical formalisms. For example, Propositional Dynamic Logic (PDL) can be described as a blend of three complementary classical ingredients: propositional calculus, modal logic, and the algebra of regular events. In First-Order Dynamic Logic (DL), the propositional calculus is replaced by classical (...) first-order predicate calculus. Dynamic Logic is a system of remarkable unity that is theoretically rich as well as of practical value. It can be used for formalizing correctness specifications and proving rigorously that those specifications are met by a particular program. Other uses include determining the equivalence of programs, comparing the expressive power of various programming constructs, and synthesizing programs from specifications. This book provides the first comprehensive introduction to Dynamic Logic. It is divided into three parts. The first part reviews the appropriate fundamental concepts of logic and computability theory and can stand alone as an introduction to these topics. The second part discusses PDL and its variants, and the third part discusses DL and its variants. Examples are provided throughout, and exercises and a short historical section are included at the end of each chapter. (shrink)

A proof-theoretical treatment of collectively accepted group beliefs is presented through a multi-agent sequent system for an axiomatization of the logic of acceptance. The system is based on a labelled sequent calculus for propositional multi-agent epistemic logic with labels that correspond to possible worlds and a notation for internalized accessibility relations between worlds. The system is contraction- and cut-free. Extensions of the basic system are considered, in particular with rules that allow the possibility of operative members or legislators. Completeness with (...) respect to the underlying Kripke semantics follows from a general direct and uniform argument for labelled sequent calculi extended with mathematical rules for frame properties. As an example of the use of the calculus we present an analysis of the discursive dilemma. (shrink)

Social epistemology is a many-splendored subject. Different theorists adopt different approaches and the options are quite diverse, often orthogonal to one another. The approach I favor is to examine social practices in terms of their impact on knowledge acquisition . This has at least two virtues: it displays continuity with traditional epistemology, which historically focuses on knowledge, and it intersects with the concerns of practical life, which are pervasively affected by what people know or don't know. In making this choice, (...) I am not blind to the allure of alternative approaches. In this paper I explain and motivate the knowledge-centered approach by contrasting it with a newly emerging alternative that has a definite appeal of its own. According to this alternative, the chief dimension of social epistemological interest would be rationality rather than knowledge. (shrink)

This book offers original accounts of a number of central social phenomena, many of which have received little if any prior philosophical attention. These phenomena include social groups, group languages, acting together, collective belief, mutual recognition, and social convention. In the course of developing her analyses Gilbert discusses the work of Emile Durkheim, Georg Simmel, Max Weber, David Lewis, among others.

In this paper we provide a formal analysis of the idea of normative co-ordination. We argue that this idea is based on the assumption that agents can achieve flexible co-ordination by conferring normative positions to other agents. These positions include duties, permissions, and powers. In particular, we explain the idea of declarative power, which consists in the capacity of the power-holder of creating normative positions, involving other agents, simply by proclaiming such positions. In addition, we account also for the concepts (...) of representation, namely the representatives capacity of acting in the name of his principal, and of mandate, which is the mandatees duty to act as the mandator has requested. Finally, we show how the framework can be applied to represent the contract-net protocol. Some brief remarks on future research and applications conclude this contribution. (shrink)

Belief is not a unified phenomenon. In this paper I argue, as a number of other riters argue, that one should distinguish a variety of belief-like attitudes: believing proper - a dispositional state which can have degrees - holding true - which can occur without understanding what one believes - and accepting - a practical and contextual attitude that has a role in deliberation and in practical reasoning. Acceptance itself is not a unified attitude. I explore the various relationships and (...) differences between these doxastic attitudes, and claim that although acceptance is distinct from belief, it rests upon it, and is therefore a species of belief. (shrink)

This paper explores principles governing the rational balance among an agent's beliefs, goals, actions, and intentions. Such principles provide specifications for artificial agents, and approximate a theory of human action (as philosophers use the term). By making explicit the conditions under which an agent can drop his goals, i.e., by specifying how the agent is committed to his goals, the formalism captures a number of important properties of intention. Specifically, the formalism provides analyses for Bratman's three characteristic functional roles played (...) by intentions [7, 9], and shows how agents can avoid intending all the foreseen side-effects of what they actually intend. Finally, the analysis shows how intentions can be adopted relative to a background of relevant beliefs and other intentions or goals. By relativizing one agent's intentions in terms of beliefs about another agent's intentions (or beliefs'), we derive a preliminary account of interpersonal commitments. (shrink)

In this incisive new book one of Britain's most eminent philosophers explores the often overlooked tension between voluntariness and involuntariness in human cognition. He seeks to counter the widespread tendency for analytic epistemology to be dominated by the concept of belief. Is scientific knowledge properly conceived as being embodied, at its best, in a passive feeling of belief or in an active policy of acceptance? Should a jury's verdict declare what its members involuntarily believe or what they voluntarily accept? And (...) should statements and assertions be presumed to express what their authors believe or what they accept? Does such a distinction between belief and acceptance help to resolve the paradoxes of self-deception and akrasia? Must people be taken to believe everything entailed by what they believe, or merely to accept everything entailed by what they accept? Through a systematic examination of these problems, the author sheds new light on issues of crucial importance in contemporary epistemology, philosophy of mind, and cognitive science. (shrink)

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

We construct logical languages which allow one to represent a variety of possible types of changes affecting the information states of agents in a multi-agent setting. We formalize these changes by defining a notion of epistemic program. The languages are two-sorted sets that contain not only sentences but also actions or programs. This is as in dynamic logic, and indeed our languages are not significantly more complicated than dynamic logics. But the semantics is more complicated. In general, the semantics of (...) an epistemic program is what we call aprogram model. This is a Kripke model of ‘actions’,representing the agents' uncertainty about the current action in a similar way that Kripke models of ‘states’ are commonly used in epistemic logic to represent the agents' uncertainty about the current state of the system. Program models induce changes affecting agents' information, which we represent as changes of the state model, called epistemic updates. Formally, an update consists of two operations: the first is called the update map, and it takes every state model to another state model, called the updated model; the second gives, for each input state model, a transition relation between the states of that model and the states of the updated model. Each variety of epistemic actions, such as public announcements or completely private announcements to groups, gives what we call an action signature, and then each family of action signatures gives a logical language. The construction of these languages is the main topic of this paper. We also mention the systems that capture the valid sentences of our logics. But we defer to a separate paper the completeness proof. (shrink)

This paper extends earlier work by its authors on formal aspects of the processes of contracting a theory to eliminate a proposition and revising a theory to introduce a proposition. In the course of the earlier work, Gardenfors developed general postulates of a more or less equational nature for such processes, whilst Alchourron and Makinson studied the particular case of contraction functions that are maximal, in the sense of yielding a maximal subset of the theory (or alternatively, of one of (...) its axiomatic bases), that fails to imply the proposition being eliminated. In the present paper, the authors study a broader class, including contraction functions that may be less than maximal. Specifically, they investigate "partial meet contraction functions", which are defined to yield the intersection of some nonempty family of maximal subsets of the theory that fail to imply the proposition being eliminated. Basic properties of these functions are established: it is shown in particular that they satisfy the Gardenfors postulates, and moreover that they are sufficiently general to provide a representation theorem for those postulates. Some special classes of partial meet contraction functions, notably those that are "relational" and "transitively relational", are studied in detail, and their connections with certain "supplementary postulates" of Gardenfors investigated, with a further representation theorem established. (shrink)

This is a systematic philosophical and conceptual study of the notion of a social practice. Raimo Tuomela explains social practices in terms of the interlocking mental states of the agents; he shows how social practices are 'building blocks of society'; and he offers a clear and powerful account of the way in which social institutions are constructed from these building blocks as established, interconnected sets of social practices with a special new social status. His analysis is based on the novel (...) concept of shared 'we-attitudes', which represent a weak form of collective intentionality, and he makes instructive connections to major topics and figures in philosophy and the social sciences. His book will be of interest to a wide range of readers in philosophy of mind, philosophy of social science, psychology and sociology, and artificial intelligence. (shrink)

Develops a logical analysis of dialogue in which two or more parties attempt to advance their own interests. It includes a classification of the major types of dialogues and a discussion of several important informal fallacies.

Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed ...

Dynamic Epistemic Logic This article tells the story of the rise of dynamic epistemic logic, which began with epistemic logic, the logic of knowledge, in the 1960s. Then, in the late 1980s, came dynamic epistemic logic, the logic of change of knowledge. Much of it was motivated by puzzles and paradoxes. The number … Continue reading Dynamic Epistemic Logic →.

Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added. In this paper we propose new versions that extend the underlying static epistemic language in such a way that dynamic completeness proofs can be obtained by perspicuous reduction axioms.