The problem of closure for the traditional unstructured possible worlds model of attitudinal content is that it treats belief and other cognitive states as closed under entailment, despite apparent counterexamples showing that this is not a necessary property of such states. One solution to this problem, which has been proposed recently by several authors (Schaffer 2005; Yalcin 2018; Hoek forthcoming), is to restrict closure in an unstructured setting by treating propositional attitudes as question-sensitive. Here I argue that this line of (...) response is unsatisfying as it stands because the problem of closure is more general than is typically discussed. A version of the problem recurs for attitudes like wondering, entertaining, considering, and so on, which are directed at questions rather than propositions. For such questioning attitudes, the appeal to question-sensitivity is much less convincing as a solution to the problem of closure. (shrink)

Epistemic closure refers to the assumption that humans are able to recognize what entails or contradicts what they believe and know, or more accurately, that humans’ epistemic states are closed under logical inferences. Epistemic closure is part of a larger theory of mind ability, which is arguably crucial for downstream NLU tasks, such as inference, QA and conversation. In this project, we introduce a new automatically constructed natural language inference dataset that tests inferences related to epistemic closure. We test and (...) further fine tune the model RoBERTa-large-mnli on the new dataset, with limited positive results. (shrink)

Within psychology, philosophy, and cognitive science, theory of mind refers to the cognitive ability to reason about the mental states of other people, thus recognizing them as having beliefs, knowledge, intentions and emotions of their own. In this project, we construct a natural language inference (NLD) dataset that tests the ability of a state of the art language model, RoBERTa-large finetuned on the MNLI dataset, to make theory of mind inferences related to knowledge and belief. Experimental results suggest that the (...) model struggles with such inferences, including after attempts for further finetuning. (shrink)

Joint attention occurs when two (or more) individuals attend together to some object. It has been identified by psychologists as an early form of our joint engagement, and is thought to provide us with an understanding of other minds that is basic in that sophisticated conceptual resources are not involved. Accordingly, it has also attracted the interest of philosophers. Moreover, a very recent trend in the psychological and philosophical literature on joint attention consists of developing the suggestion that it holds (...) partially in virtue of communication: it is because we share our thoughts or feelings about an object that our individual attention becomes joint. This paper unpacks the communicative suggestion in a way that accounts for joint attention's basicness. (shrink)

Information can be public among a group. Whether or not information is public matters, for example, for accounts of interdependent rational choice, of communication, and of joint intention. A standard analysis of public information identifies it with (some variant of) common belief. The latter notion is stipulatively defined as an infinite conjunction: for p to be commonly believed is for it to believed by all members of a group, for all members to believe that all members believe it, and so (...) forth. This analysis is often presupposed without much argument in philosophy. Theoretical entrenchment or intuitions about cases might give some traction on the question, but give little insight about why the identification holds, if it does. The strategy of this paper is to characterize a practical-normative role for information being public, and show that the only things that play that role are (variants of) common belief as stipulatively characterized. In more detail: a functional role for “taking a proposition for granted” in non-isolated decision making is characterized. I then present some minimal conditions under which such an attitude is correctly held. The key assumption links this attitude to beliefs about what is public. From minimal a priori principles, we can argue that a proposition being public among a group entails common commitment to believe among that group. Later sections explore partial converses to this result, the factivity of publicity and publicity from the perspective of outsiders to the group, and objections to the aprioricity of the result deriving from a posteriori existential presuppositions. (shrink)

An overview of hyperintensionality is provided. Hyperintensional languages have expressions with meanings that are more fine-grained than necessary equivalence. That is, the expressions may necessarily co-apply and yet be distinct in meaning. Adequately accounting for theories cast in hyperintensional languages is important in the philosophy of language; the philosophy of mind; metaphysics; and elsewhere. This entry presents a number of areas in which hyperintensionality is important; a range of approaches to theorising about hyperintensional matters; and a range of debates that (...) attention to hyperintensional constructions has generated. (shrink)

Why do we use epistemic modals like 'might'? According to Factualism, the function of 'might' is to exchange information about state-of-affairs in the modal universe. As an alternative to Factualism, this paper offers a game-theoretic rationale for epistemic possibility operators in a Bayesian setting. The background picture is one whereby communication facilitates coordination, but coordination could fail if there's too much uncertainty, since the players' ability to share a belief is undermined. However, 'might' and related expressions can be used to (...) reveal one's uncertainty, and exploit this to coordinate despite the lack of a common epistemic ground. The final result is a way to articulate a non-Factualist view of epistemic possibility modals that builds on their standard semantics. (shrink)

I present a possible worlds semantics for a hyperintensional belief revision operator, which reduces the logical idealization of cognitive agents affecting similar operators in doxastic and epistemic logics, as well as in standard AGM belief revision theory. (Revised) belief states are not closed under classical logical consequence; revising by inconsistent information does not perforce lead to trivialization; and revision can be subject to ‘framing effects’: logically or necessarily equivalent contents can lead to different revisions. Such results are obtained without resorting (...) to non-classical logics, or to non-normal or impossible worlds semantics. The framework combines, instead, a standard semantics for propositional S5 with a simple mereology of contents. (shrink)

Argument evaluation, one of the central problems in argumentation theory, consists in studying what makes an argument a good one. This paper proposes a formal approach to argument evaluation from the perspective of justification logic. We adopt a multi-agent setting, accepting the intuitive idea that arguments are always evaluated by someone. Two general restrictions are imposed on our analysis: non-deductive arguments are left out and the goal of argument evaluation is fixed: supporting a given proposition. Methodologically, our approach uses several (...) existing tools borrowed from justification logic, awareness logic, doxastic logic and logics for belief dependence. We start by introducing a basic logic for argument evaluation, where a list of argumentative and doxastic notions can be expressed. Later on, we discuss how to capture the mentioned form of argument evaluation by defining a preference operator in the object language. The intuitive picture behind this definition is that, when assessing a couple of arguments, the agent puts them to a test consisting of several criteria. As a result of this process, a preference relation among the evaluated arguments is established by the agent. After showing that this operator suffers a special form of logical omniscience, called preferential omniscience, we discuss how to define an explicit version of it, more suitable to deal with non-ideal agents. The present work exploits the formal notion of awareness in order to model several informal phenomena: awareness of sentences, availability of arguments and communication between agents and external sources. We discuss several extensions of the basic logic and offer completeness and decidability results for all of them. (shrink)

Orthodox Bayesianism is a highly idealized theory of how we ought to live our epistemic lives. One of the most widely discussed idealizations is that of logical omniscience: the assumption that an agent’s degrees of belief must be probabilistically coherent to be rational. It is widely agreed that this assumption is problematic if we want to reason about bounded rationality, logical learning, or other aspects of non-ideal epistemic agency. Yet, we still lack a satisfying way to avoid logical omniscience within (...) a Bayesian framework. Some proposals merely replace logical omniscience with a different logical idealization; others sacrifice all traits of logical competence on the altar of logical non-omniscience. We think a better strategy is available: by enriching the Bayesian framework with tools that allow us to capture what agents can and cannot infer given their limited cognitive resources, we can avoid logical omniscience while retaining the idea that rational degrees of belief are in an important way constrained by the laws of probability. In this paper, we offer a formal implementation of this strategy, show how the resulting framework solves the problem of logical omniscience, and compare it to orthodox Bayesianism as we know it. (shrink)

The early literature on epistemic logic in philosophy focused on reasoning about the knowledge or belief of a single agent, especially on controversies about "introspection axioms" such as the 4 and 5 axioms. By contrast, the later literature on epistemic logic in computer science and game theory has focused on multi-agent epistemic reasoning, with the single-agent 4 and 5 axioms largely taken for granted. In the relevant multi-agent scenarios, it is often important to reason about what agent A believes about (...) what agent B believes about what agent A believes; but it is rarely important to reason just about what agent A believes about what agent A believes. This raises the question of the extent to which single-agent introspection axioms actually matter for multi-agent epistemic reasoning. In this paper, we formalize and answer this question. To formalize the question, we first define a set of multi-agent formulas that we call agent-alternating formulas, including formulas like Box_a Box_b Box_a p but not formulas like Box_a Box_a p. We then prove, for the case of belief, that if one starts with multi-agent K or KD, then adding both the 4 and 5 axioms (or adding the B axiom) does not allow the derivation of any new agent-alternating formulas—in this sense, introspection axioms do not matter. By contrast, we show that such conservativity results fail for knowledge and multi-agent KT, though they hold with respect to a smaller class of agent-nonrepeating formulas. (shrink)

We overview logical and computational explanations of the notion of tractability as applied in cognitive science. We start by introducing the basics of mathematical theories of complexity: computability theory, computational complexity theory, and descriptive complexity theory. Computational philosophy of mind often identifies mental algorithms with computable functions. However, with the development of programming practice it has become apparent that for some computable problems finding effective algorithms is hardly possible. Some problems need too much computational resource, e.g., time or memory, to (...) be practically computable. Computational complexity theory is concerned with the amount of resources required for the execution of algorithms and, hence, the inherent difficulty of computational problems. An important goal of computational complexity theory is to categorize computational problems via complexity classes, and in particular, to identify efficiently solvable problems and draw a line between tractability and intractability. -/- We survey how complexity can be used to study computational plausibility of cognitive theories. We especially emphasize methodological and mathematical assumptions behind applying complexity theory in cognitive science. We pay special attention to the examples of applying logical and computational complexity toolbox in different domains of cognitive science. We focus mostly on theoretical and experimental research in psycholinguistics and social cognition. (shrink)

An opinionated introduction to philosophical issues connected to common knowledge.

The impossibility theorem of Dekel, Lipman and Rustichini has been thought to demonstrate that standard state-space models cannot be used to represent unawareness. We first show that Dekel, Lipman and Rustichini do not establish this claim. We then distinguish three notions of awareness, and argue that although one of them may not be adequately modeled using standard state spaces, there is no reason to think that standard state spaces cannot provide models of the other two notions. In fact, standard space (...) models of these forms of awareness are attractively simple. They allow us to prove completeness and decidability results with ease, to carry over standard techniques from decision theory, and to add propositional quantifiers straightforwardly. (shrink)

We present a formal semantics for epistemic logic, capturing the notion of knowability relative to information (KRI). Like Dretske, we move from the platitude that what an agent can know depends on her (empirical) information. We treat operators of the form K_AB (‘B is knowable on the basis of information A’) as variably strict quantifiers over worlds with a topic- or aboutness- preservation constraint. Variable strictness models the non-monotonicity of knowledge acquisition while allowing knowledge to be intrinsically stable. Aboutness-preservation models (...) the topic-sensitivity of information, allowing us to invalidate controversial forms of epistemic closure while validating less controversial ones. Thus, unlike the standard modal framework for epistemic logic, KRI accommodates plausible approaches to the Kripke-Harman dogmatism paradox, which bear on non-monotonicity, or on topic-sensitivity. KRI also strikes a better balance between agent idealization and a non-trivial logic of knowledge ascriptions. (shrink)

The paper analyzes dynamic epistemic logic from a topological perspective. The main contribution consists of a framework in which dynamic epistemic logic satisfies the requirements for being a topological dynamical system thus interfacing discrete dynamic logics with continuous mappings of dynamical systems. The setting is based on a notion of logical convergence, demonstratively equivalent with convergence in Stone topology. Presented is a flexible, parametrized family of metrics inducing the latter, used as an analytical aid. We show maps induced by action (...) model transformations continuous with respect to the Stone topology and present results on the recurrent behavior of said maps. (shrink)

The traditional possible-worlds model of belief describes agents as ‘logically omniscient’ in the sense that they believe all logical consequences of what they believe, including all logical truths. This is widely considered a problem if we want to reason about the epistemic lives of non-ideal agents who—much like ordinary human beings—are logically competent, but not logically omniscient. A popular strategy for avoiding logical omniscience centers around the use of impossible worlds: worlds that, in one way or another, violate the laws (...) of logic. In this paper, we argue that existing impossible-worlds models of belief fail to describe agents who are both logically non-omniscient and logically competent. To model such agents, we argue, we need to ‘dynamize’ the impossible-worlds framework in a way that allows us to capture not only what agents believe, but also what they are able to infer from what they believe. In light of this diagnosis, we go on to develop the formal details of a dynamic impossible-worlds framework, and show that it successfully models agents who are both logically non-omniscient and logically competent. (shrink)

A moderate belief-disagreement between agents on proposition p means that one agent believes p and the other agent does not. This paper presents two logical systems, \ and \, that describe moderate belief-disagreement, and shows, using possible worlds semantics, that \ is sound and complete with respect to arbitrary frames, and \ is sound and complete with respect to serial frames. Syntactically, the logics are monomodal, but two doxastic accessibility relations are involved in their semantics. The notion of moderate belief-disagreement, (...) which is in accordance with the understanding of belief-disagreement in everyday life, is an epistemic one related to multiagent situations, and \ and \ are two epistemic logics. (shrink)

Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms. Justification logics can be seen as explicit counterparts to modal logics. The behavior and interaction of agents in distributed system is often modeled using logics of knowledge and time. In this paper, we sketch some preliminary ideas on how the modal knowledge part of such logics of knowledge and time could be replaced with an appropriate justification logic.

1) We will begin by offering a short introduction to Epistemic Logic and presenting Fitch’s paradox in an epistemic‑modal logic. (2) Then, we will proceed to presenting three Epistemic Temporal logical frameworks creat‑ ed by Hoshi (2009) : TPAL (Temporal Public Announcement Logic), TAPAL (Temporal Arbitrary Public Announcement Logic) and TPAL+P ! (Temporal Public Announcement Logic with Labeled Past Operators). We will show how Hoshi stated the Verificationist Thesis in the language of TAPAL and analyze his argument on why this (...) version of it is immune from paradox. (3) Edgington (1985) offered an interpretation of the Verificationist Thesis that blocks Fitch’s paradox and we will propose a way to formulate it in a TAPAL‑based lan‑ guage. The language we will use is a combination of TAPAL and TPAL+P ! with an Indefinite (Unlabeled) Past Operator (TAPAL+P !+P). Using indexed satisfi‑ ability relations (as introduced in (Wang 2010 ; 2011)) we will offer a prospec ‑ tive semantics for this language. We will investigate whether the tentative re‑ formulation of Edgington’s Verificationist Thesis in TAPAL+P !+P is free from paradox and adequate to Edgington’s ideas on how „all truths are knowable“ should be interpreted. (shrink)

The concept of knowledge can be modelled in epistemic modal logic and, if modelled by using a standard modal operator, it is subject to the problem of logical omniscience. The classical solution to this problem is to distinguish between implicit and explicit knowledge and to construe the knowledge operator as capturing the concept of implicit knowledge. In addition, since a proposition is said to be implicitly known just in case it is derivable from the set of propositions that are explicitly (...) known by using a certain set of logical rules, the concept of implicit knowledge is definable on the basis of the concept of explicit knowledge. In any case, both implicit and explicit knowledge are typically characterized as factive, i.e. such that it is always the case that what is known is also true. The aim of the present paper is twofold: first, we will develop a dynamic system of explicit intersubjective knowledge that allows us to introduce the operator of implicit knowledge by definition; secondly, we will show that it is not possible to hold together the following two theses: (1) the concept of implicit knowledge is definable along the lines indicated above and (2) the concept of implicit knowledge is factive. (shrink)

This essay aims to provide a modal logic for rational intuition. Similarly to treatments of the property of knowledge in epistemic logic, I argue that rational intuition can be codified by a modal operator governed by the modal $\mu$-calculus. Via correspondence results between fixed point modal propositional logic and the bisimulation-invariant fragment of monadic second-order logic, a precise translation can then be provided between the notion of 'intuition-of', i.e., the cognitive phenomenal properties of thoughts, and the modal operators regimenting the (...) notion of 'intuition-that'. I argue that intuition-that can further be shown to entrain conceptual elucidation, by way of figuring as a dynamic-interpretational modality which induces the reinterpretation of both domains of quantification and the intensions and hyperintensions of mathematical concepts that are formalizable in monadic first- and second-order formal languages. Hyperintensionality is countenanced via a topic-sensitive epistemic two-dimensional truthmaker semantics. (shrink)

Logics of joint strategic ability have recently received attention, with arguably the most influential being those in a family that includes Coalition Logic (CL) and Alternating-time Temporal Logic (ATL). Notably, both CL and ATL bypass the epistemic issues that underpin Schelling-type coordination problems, by apparently relying on the meta-level assumption of (perfectly reliable) communication between cooperating rational agents. Yet such epistemic issues arise naturally in settings relevant to ATL and CL: these logics are standardly interpreted on structures where agents move (...) simultaneously, opening the possibility that an agent cannot foresee the concurrent choices of other agents. In this paper we introduce a variant of CL we call Two-Player Strategic Coordination Logic (SCL2). The key novelty of this framework is an operator for capturing coalitional ability when the cooperating agents cannot share strategic information. We identify significant differences in the expressive power and validities of SCL2 and CL2, and present a sound and complete axiomatization for SCL2. We briefly address conceptual challenges when shifting attention to games with more than two players and stronger notions of rationality. (shrink)

This article provides a brief overview of several formal frameworks concerning the relation between knowledge on the one hand, and obligation on the other. We discuss the paradox of the knower, knowledge based obligation, knowingly doing, deontic dynamic epistemology, descriptive obligations, and responsibilities as dynamic epistemology.

Lying and fiction both involve the deliberate production of statements that fail to obey Grice’s first Maxim of Quality (“do not say what you believe to be false”). The question thus arises if we can provide a uniform analysis for fiction and lies. In this chapter I discuss the similarities, but also some fundamental differences between lying and fiction. I argue that there’s little hope for a satisfying account within a traditional truth conditional semantic framework. Rather than immediately moving to (...) a fully pragmatic analysis involving distinct speech acts of fiction-making and lying, I will first explore how far we get with the assumption that both are simply assertions, analyzed in a Stalnakerian framework, i.e. as proposals to update the common ground. (shrink)

The coordinated attack scenario and the electronic mail game are two paradoxes of common knowledge. In simple mathematical models of these scenarios, the agents represented by the models can coordinate only if they have common knowledge that they will. As a result, the models predict that the agents will not coordinate in situations where it would be rational to coordinate. I argue that we should resolve this conflict between the models and facts about what it would be rational to do (...) by rejecting common knowledge assumptions implicit in the models. I focus on the assumption that the agents have common knowledge that they are rational, and provide models to show that denying this assumption suffices for a resolution of the paradoxes. I describe how my resolution of the paradoxes fits into a general story about the relationship between rationality in situations involving a single agent and rationality in situations involving many agents. (shrink)

Although the change of beliefs in the face of new information has been widely studied with some success, the revision of other mental states has received little attention from the theoretical perspective. In particular, intentions are widely recognised as being a key attitude for rational agents, and while several formal theories of intention have been proposed in the literature, the logic of intention revision has been hardly considered. There are several reasons for this: perhaps most importantly, intentions are very closely (...) connected with other mental states—in particular, beliefs about the future and the abilities of the agent. So, we cannot study them in isolation. We must consider the interplay between intention revision and the revision of other mental states, which complicates the picture considerably. In this paper, we present some first steps towards a theory of intention revision. We develop a simple model of an agent’s mental states, and define intention revision operators. Using this model, we develop a logic of intention dynamics, and then investigate some of its properties. (shrink)

I want to model a finite, fallible cognitive agent who imagines that p in the sense of mentally representing a scenario—a configuration of objects and properties—correctly described by p. I propose to capture imagination, so understood, via variably strict world quantifiers, in a modal framework including both possible and so-called impossible worlds. The latter secure lack of classical logical closure for the relevant mental states, while the variability of strictness captures how the agent imports information from actuality in the imagined (...) non-actual scenarios. Imagination turns out to be highly hyperintensional, but not logically anarchic. Section 1 sets the stage and impossible worlds are quickly introduced in Sect. 2. Section 3 proposes to model imagination via variably strict world quantifiers. Section 4 introduces the formal semantics. Section 5 argues that imagination has a minimal mereological structure validating some logical inferences. Section 6 deals with how imagination under-determines the represented contents. Section 7 proposes additional constraints on the semantics, validating further inferences. Section 8 describes some welcome invalidities. Section 9 examines the effects of importing false beliefs into the imagined scenarios. Finally, Sect. 10 hints at possible developments of the theory in the direction of two-dimensional semantics. (shrink)

In this paper, we propose a decidable single-agent modal logic for reasoning about goal-directed “knowing how”, based on ideas from linguistics, philosophy, modal logic, and automated planning in AI. We first define a modal language to express “I know how to guarantee \ given \” with a semantics based not on standard epistemic models but on labeled transition systems that represent the agent’s knowledge of his own abilities. The semantics is inspired by conformant planning in AI. A sound and complete (...) proof system is given to capture valid reasoning patterns, which highlights the compositional nature of “knowing how”. The logical language is further extended to handle knowing how to achieve a goal while maintaining other conditions. (shrink)

Recent years have seen a surge in online collaboration between experts and amateurs on scientific research. In this article, we analyse the epistemological implications of these crowdsourced projects, with a focus on Zooniverse, the world’s largest citizen science web portal. We use quantitative methods to evaluate the platform’s success in producing large volumes of observation statements and high impact scientific discoveries relative to more conventional means of data processing. Through empirical evidence, Bayesian reasoning, and conceptual analysis, we show how information (...) and communication technologies enhance the reliability, scalability, and connectivity of crowdsourced e-research, giving online citizen science projects powerful epistemic advantages over more traditional modes of scientific investigation. These results highlight the essential role played by technologically mediated social interaction in contemporary knowledge production. We conclude by calling for an explicitly sociotechnical turn in the philosophy of science that combines insights from statistics and logic to analyse the latest developments in scientific research. (shrink)

We develop a conceptually clear, intuitive, and feasible decision procedure for testing satisfiability in the full multi\-agent epistemic logic \CMAELCD\ with operators for common and distributed knowledge for all coalitions of agents mentioned in the language. To that end, we introduce Hintikka structures for \CMAELCD\ and prove that satisfiability in such structures is equivalent to satisfiability in standard models. Using that result, we design an incremental tableau-building procedure that eventually constructs a satisfying Hintikka structure for every satisfiable input set of (...) formulae of \CMAELCD\ and closes for every unsatisfiable input set of formulae. (shrink)

This paper aims at developing a logical theory of perspectival epistemic attitudes. After presenting a standard framework for modeling acceptance, where the epistemic space of an agent coincides with a unique epistemic cell, more complex systems are introduced, which are characterized by the existence of many connected epistemic cells, and different possible attitudes towards a proposition, both positive and negative, are discussed. In doing that, we also propose some interesting ways in which the systems can be interpreted on well known (...) epistemological standpoints. (shrink)

The logic of justification provides an in-depth analysis of the epistemic states of an agent. This paper aims at solving some of the problems to which the common interpretation of the operators of justification logic is subject by providing a framework in which a crucial distinction between potential and explicit justifiers is exploited. The paper is subdivided into three sections. The first section offers an introduction to a basic system LJ of justification logic and to the problems concerning its interpretation. (...) In the second section, three new systems of justification logic are introduced and characterised with respect to an appropriate semantics. The final section shows why the highlighted problems do not afflict the new systems and how it is possible to interpret LJ in the new framework. (shrink)

Epistemic logic begins with the recognition that our everyday talk about knowing and believing has some systematic features that we can track and re‡ect upon. Epistemic logicians have studied and extended these glints of systematic structure in fascinating and important ways since the early 1960s. However, for one reason or another, mainstream epistemologists have shown little interest. It is striking to contrast the marginal role of epistemic logic in contemporary epistemology with the centrality of modal logic for metaphysicians. This article (...) is intended to help in correcting this oversight by presenting some important developments in epistemic logic and suggesting ways to understand their applicability to traditional epistemological problems. Obviously, by itself, tweaking the formal apparatus of epistemic logic does not solve traditional epistemological problems. Epistemic logic can help us to navigate through problems in a systematic fashion by unpacking the logic of the problematic concepts, it can also lead us to recognize problems that we had not anticipated. This is basically analogous to the role that modal logic has played in contemporary metaphysics. (shrink)

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. (shrink)

This paper supersedes an ealier version, entitled "A Non-Standard Semantics for Inexact Knowledge with Introspection", which appeared in the Proceedings of "Rationality and Knowledge". The definition of token semantics, in particular, has been modified, both for the single- and the multi-agent case.

Epistemic iteration principles are principles according to which some or another epistemic operator automatically iterates---e.g., if it is known that P, then it is known that P, or there is evidence that P, then there is evidence that there is evidence that P. This article provides a survey of various arguments for and against epistemic iteration principles, with a focus on arguments relevant to a wide range of such principles.

In a recent paper, Alexander argues that relaxing the requirement that sound knowers know their own soundness might provide a solution to Fitch’s paradox and introduces a suitable axiomatic system where the paradox is avoided. In this paper an analysis of this solution is proposed according to which the effective move for solving the paradox depends on the axiomatic treatment of the ontic modality rather than the limitations imposed on the epistemic one. It is then shown that, once the ontic (...) modality is standardly introduced, the paradox still follows and, in addition, some puzzling consequences arise. (shrink)

The goal of the present paper is to construct a formal explication of the pluralistic ignorance explanation of the bystander effect. The social dynamics leading to inaction is presented, decomposed, and modeled using dynamic epistemic logic augmented with ‘transition rules’ able to characterize agent behavior. Three agent types are defined: First Responders who intervene given belief of accident; City Dwellers, capturing ‘apathetic urban residents’ and Hesitators, who observe others when in doubt, basing subsequent decision on social proof. It is shown (...) how groups of the latter may end in a state of pluralistic ignorance leading to inaction. Sequential models for each agent type are specified, and their results compared to empirical studies. It is concluded that only the Hesitator model produces reasonable results. (shrink)

It has been an open question whether or not we can define a belief revision operation that is distinct from simple belief expansion using paraconsistent logic. In this paper, we investigate the possibility of meeting the challenge of defining a belief revision operation using the resources made available by the study of dynamic epistemic logic in the presence of paraconsistent logic. We will show that it is possible to define dynamic operations of belief revision in a paraconsistent setting.

Robert Aumann presents his Agreement Theorem as the key conditional: “if two people have the same priors and their posteriors for an event A are common knowledge, then these posteriors are equal” (Aumann, 1976, p. 1236). This paper focuses on four assumptions which are used in Aumann’s proof but are not explicit in the key conditional: (1) that agents commonly know, of some prior μ, that it is the common prior; (2) that agents commonly know that each of them updates (...) on the prior by conditionalization; (3) that agents commonly know that if an agent knows a proposition, she knows that she knows that proposition (the “K K” principle); (4) that agents commonly know that they each update only on true propositions. It is shown that natural weakenings of any one of these strong assumptions can lead to countermodels to Aumann’s key conditional. Examples are given in which agents who have a common prior and commonly know what probability they each assign to a proposition nevertheless assign that proposition unequal probabilities. To alter Aumann’s famous slogan: people can “agree to disagree”, even if they share a common prior. The epistemological significance of these examples is presented in terms of their role in a defense of the Uniqueness Thesis: If an agent whose total evidence is E is fully rational in taking doxastic attitude D to P, then necessarily, any subject with total evidence E who takes a different attitude to P is less than fully rational. (shrink)

I present an approach to our conceiving absolute impossibilities—things which obtain at no possible world—in terms of ceteris paribus intentional operators: variably restricted quantifiers on possible and impossible worlds based on world similarity. The explicit content of a representation plays a role similar in some respects to the one of a ceteris paribus conditional antecedent. I discuss how such operators invalidate logical closure for conceivability, and how similarity works when impossible worlds are around. Unlike what happens with ceteris paribus counterfactual (...) conditionals, the closest worlds are relevantly closest belief-worlds: closest to how things are believed to be, rather than to how they are. Also, closeness takes into account apriority and the opacity of intentional contexts. (shrink)

Using a knowledge-based approach, we derive a protocol, MACOM1, for the sequence transmission problem from one agent to a group of agents. The protocol is correct for communication media where deletion and reordering errors may occur. Furthermore, it is shown that after k rounds the agents in the group attain depth k general knowledge about the members of the group and the values of the messages. Then, we adjust this algorithm for multi-agent communication for the process of teamwork. MACOM1 solves (...) the sequence transmission problem from one agent to a group of agents, but does not fully comply with the type of dialogue communication needed for teamwork. The number of messages being communicated per communication between the initiator and the other agents from the group can differ. Furthermore, the teamwork process can require the communication algorithm to handle changes of initiator. We show the adjustments that have to be made to MACOM1 to handle these properties of teamwork. For the new multi-agent communication algorithm, MACOM2, it is shown that the gaining of knowledge required for a successful teamwork process is still guaranteed. (shrink)