The received view says that possibility is the dual of necessity: a proposition is (metaphysically, logically, epistemically etc.) possible iff it is not the case that its negation is (metaphysically, logically, epistemically etc., respectively) necessary. This reading is usually taken for granted by modal logicians and indeed seems plausible when dealing with logical or metaphysical possibility. But what about epistemic possibility? We argue that the dual definition of epistemic possibility in terms of epistemic necessity generates tension when reasoning about non-idealized (...) agents and is a problem of concern for most hyperintensional epistemic logics that alleviate the problem of logical omniscience. The tension is particularly evident when knowledge is taken as a primitive to define other epistemic concepts, such as justification and belief, as done in the knowledge-first tradition. We propose a non-dual interpretation of epistemic possibility, employing a hyperintensionality filter similar to the one that makes the corresponding epistemic necessity operator hyperintensional. We employ the proposed semantics to model Stalnaker's belief as epistemic possibility of knowledge and provide a sound and complete axiomatization for a hyperintensional version of his bimodal logic of knowledge and belief. (shrink)

In this paper, I use a framework from computational linguistics, the Rational Speech Act framework, to model deceptive probabilistic communication. This account allows agents to discount for the biases they perceive their interlocutors to have. This way, agents can update their credences with the perceived interests of others in mind.

The paper focuses on a recent challenge brought forward against the interventionist approach to the meaning of counterfactual conditionals. According to this objection, interventionism cannot account for the interpretation of right-nested counterfactuals, the problem being its strict interventionism. We will report on the results of an empirical study supporting the objection. Furthermore, we will extend the well-known logic of intervention with a new operator expressing an alternative notion of intervention that does away with strict interventionism. This new notion of intervention (...) operates on the valuation of the variables in a causal model, and not on their functional dependencies. (shrink)

Contextology is the science of the dynamics of the conversational context. Contextology formulates laws governing how the shared information states of interlocutors evolve in response to assertion. More precisely, the contextologist attempts to construct a function which, when provided with just a conversation’s pre-update context and the content of an assertion, delivers that conversation’s post-update context. Most contextologists have assumed that the function governing the evolution of the context is simple: the post-update context is just the pre-update context intersected with (...) the content of the assertion. We argue that this assumption is wrong: not only is it false, it is also incoherent given standard contextological assumptions. Moreover, it is impossible in principle to revise it to correctly describe the dynamics of context. We conclude that there can be no science of Contextology. The laws governing the evolution of the context in response to assertion must make essential reference to the private information states of interlocutors. (shrink)

This volume is a collation of original contributions from the key actors of a new trend in the contemporary theory of knowledge and belief, that we call “dynamic epistemology”. It brings the works of these researchers under a single umbrella by highlighting the coherence of their current themes, and by establishing connections between topics that, up until now, have been investigated independently. It also illustrates how the new analytical toolbox unveils questions about the theory of knowledge, belief, preference, action, and (...) rationality, in a number of central axes in dynamic epistemology: temporal, social, probabilistic and even deontic dynamics. (shrink)

Reasoning about what other people know is an important cognitive ability, known as epistemic reasoning, which has fascinated psychologists, economists, and logicians. In this paper, we propose a computational model of humans’ epistemic reasoning, including higher-order epistemic reasoning—reasoning about what one person knows about another person’s knowledge—that we test in an experiment using a deductive card game called “Aces and Eights”. Our starting point is the model of perfect higher-order epistemic reasoners given by the framework of dynamic epistemic logic. We (...) modify this idealized model with bounds on the level of feasible epistemic reasoning and stochastic update of a player’s space of possibilities in response to new information. These modifications are crucial for explaining the variation in human performance across different participants and different games in the experiment. Our results demonstrate how research on epistemic logic and cognitive models can inform each other. (shrink)

Analyzing situations where information is partial, incomplete or contradictory has created a demand for quantitative belief measures that are weaker than classic probability theory. In this paper, we compare two frameworks that have been proposed for this task, Dempster-Shafer theory and non-standard probability theory based on Belnap-Dunn logic. We show the two frameworks to assume orthogonal perspectives on informational shortcomings, but also provide a partial correspondence result. Lastly, we also compare various dynamical rules of the two frameworks, all seen as (...) generalizations of classic Bayes’ conditioning. (shrink)

We propose a dynamic hyperintensional logic of belief revision for non-omniscient agents, reducing the logical omniscience phenomena affecting standard doxastic/epistemic logic as well as AGM belief revision theory. Our agents don’t know all a priori truths; their belief states are not closed under classical logical consequence; and their belief update policies are such that logically or necessarily equivalent contents can lead to different revisions. We model both plain and conditional belief, then focus on dynamic belief revision. The key idea we (...) exploit to achieve non-omniscience focuses on topic- or subject matter-sensitivity: a feature of belief states which is gaining growing attention in the recent literature. (shrink)

In this article I argue that phenomenal intentionality fundamentally consists in a horizonality structure, rather than in a relation to a representational content or the determination of accuracy conditions. I provide a distinctive modal model of intentionality that conceives of phenomenal intentionality as the enjoyment of a plus ultra that points beyond what is actual. The directedness of intentionality on the world, thus, consists in “pointing ahead” to possibilities. The principal difficulty for the modal model is logical: the most obvious (...) way of implementing such a structure results in an analogue of Russell’s paradox. However, this paradox can be avoided by fine-tuning the modal logic deployed in this setting. This way of fine-tuning the logic ultimately amounts to intuitive benefits. For, it captures the intensional character of intentionality, since the way that our mental states refer to things is conception-dependent. Moreover, the way I interpret the modal model leads to a conception of intentionality as a feature of dynamic, diachronic patterns in the way that mental acts subjectively appear, rather than as a synchronic property. We ought to think of intentionality as fundamentally a temporal, subjective determination. In a generalization on Sellars’ approach to concepts, I hold that phenomenally intentional mental presentations involve modal laws and are inconceivable without them. (shrink)

In this work we summarise the concept of bisimulation, widely used both in computational sciences and in modal logic, that characterises modal structures with the same behaviour in terms of accessibility relations. Then, we offer a sketch of categorical interpretation of bisimulation between modal structures, which comprise both the structure and the valuation from a propositional language.

En este ensayo exploramos una perspectiva epistemológica en la que el elemento social y colectivo del conocimiento juega un papel fundamental en la explicación de su producción y transmisión. Primero presentamos y criticamos una posición individualista que ha sido dominante en la epistemología contemporánea y cuyas raíces pueden trazarse, al menos, hasta Descartes. Posteriormente introducimos y defendemos nuestra propia mirada, una en la que el conocimiento es un proceso constituido por un conjunto de actividades y prácticas que tiene un carácter (...) material. (shrink)

Epistemic logic is usually employed to model two aspects of a situation: the factual and the epistemic aspects. Truth, however, is not always attainable, and in many cases we are forced to reason only with whatever information is available to us. In this paper, we will explore a four-valued epistemic logic designed to deal with these situations, where agents have only knowledge about the available information, which can be incomplete or conflicting, but not explicitly about facts. This layer of available (...) information or evidence, which is the object of the agents’ knowledge, can be seen as a database. By adopting this sceptical posture in our semantics, we prepare the ground for logics where the notion of knowledge—or more appropriately, belief—is entirely based on evidence. The technical results include a set of reduction axioms for public announcements, correspondence proofs, and a complete tableau system. In summary, our contributions are twofold: on the one hand we present an intuition and possible application for many-valued modal logics, and on the other hand we develop a logic that models the dynamics of evidence in a simple and intuitively clear fashion. (shrink)

We propose a solution to the problem of logical omniscience in what we take to be its fundamental version: as concerning arbitrary agents and the knowledge attitude per se. Our logic of knowledge is a spin-off from a general theory of thick content, whereby the content of a sentence has two components: an intension, taking care of truth conditions; and a topic, taking care of subject matter. We present a list of plausible logical validities and invalidities for the logic of (...) knowledge per se for arbitrary agents, and isolate three explanatory factors for them: the topic-sensitivity of content; the fragmentation of knowledge states; the defeasibility of knowledge acquisition. We then present a novel dynamic epistemic logic that yields precisely the desired validities and invalidities, for which we provide expressivity and completeness results. We contrast this with related systems and address possible objections. (shrink)

This paper proposes a new account of bounded or minimal doxastic rationality (in the sense of Cherniak 1986), based on the notion that beliefs are answers to questions (à la Yalcin 2018). The core idea is that minimally rational beliefs are linked through thematic connections, rather than entailment relations. Consequently, such beliefs are not deductively closed, but they are closed under parthood (where a part is an entailment that answers a smaller question). And instead of avoiding all inconsistency, minimally rational (...) believers only avoid blatant inconsistencies (where some beliefs are blatantly inconsistent when they contradict one another on a particular question). Rather than cohering into a single overall world view, beliefs are more loosely connected in what is best described as a web of questions. This view of minimally rational belief naturally gives rise to an account of deductive inquiry on which deductive reasoning is a matter of posing new questions. (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)

Information exchange can be viewed as a process of asking questions and answering them. While dynamic epistemic logic traditionally focuses on statements, recent developments have been concerned with ways of incorporating questions. One approach, based on the framework of inquisitive semantics, is inquisitive dynamic epistemic logic ). In this system, agents are represented with issues as well as information. On the dynamic level, it can model actions that raise new issues. Compared to other approaches, a limitation of \ is that (...) it can only encode public announcements. \ can be refined to encode private questions, by merging its static basis, inquisitive epistemic logic ), with action model logic ). This can be done in two ways, namely by enriching action models with questions as possible actions or with issues concerning which action takes place. This paper describes the corresponding dynamic logics, which are conservative extensions of both \ and \, and a sound and complete axiomatization is given for both. (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 book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, (...) and often stressing Johan van Benthem's pioneering work in establishing this program. However, this is not a Festschrift, but a rich tapestry for a field with a wealth of strands of its own. The reader will see the state of the art in such topics as information update, belief change, preference, learning over time, and strategic interaction in games. Moreover, no tight boundary has been enforced, and some chapters add more general mathematical or philosophical foundations or links to current trends in computer science. The theme of this book lies at the interface of many disciplines. Logic is the main methodology, but the various chapters cross easily between mathematics, computer science, philosophy, linguistics, cognitive and social sciences, while also ranging from pure theory to empirical work. Accordingly, the authors of this book represent a wide variety of original thinkers from different research communities. And their interconnected themes challenge at the same time how we think of logic, philosophy and computation. Thus, very much in line with van Benthem's work over many decades, the volume shows how all these disciplines form a natural unity in the perspective of dynamic logicians (broadly conceived) exploring their new themes today. And at the same time, in doing so, it offers a broader conception of logic with a certain grandeur, moving its horizons beyond the traditional study of consequence relations. (shrink)

Three classic distinctions specify that truths can be necessary versus contingent,analytic versus synthetic, and a priori versus a posteriori. The philosopher reading this article knows very well both how useful and ordinary such distinctions are in our conceptual work and that they have been subject to many and detailed debates, especially the last two. In the following pages, I do not wish to discuss how far they may be tenable. I shall assume that, if they are reasonable and non problematic (...) in some ordinary cases, then they can be used in order to understand what kind of knowledge the maker’s knowledge is. By this I mean the sort of knowledge that Alice enjoys when she holds the information that Bob’s coffee is sweetened because she just put two spoons of sugar in it herself. The maker’s knowledge tradition is quite important but it is not mainstream in modern and analytic epistemology and lacks grounding in terms of exactly what sort of knowledge one is talking about. My suggestion is that this grounding can be provided by a minimalist approach, based on an information-theoretical analysis. In the article, I argue that we need to decouple a fourth distinction, namely informative versus uninformative, from the previous three and, in particular, from its implicit association with analytic versus synthetic and a priori versus a posteriori; such a decoupling facilitates, and is facilitated by, moving from a monoagent to a multiagent approach: the distinctions qualify a proposition, a message, or some information not just in themselves but relationally, with respect to an informational agent; the decoupling and the multiagent approach enable a re-mapping of currently available positions in epistemology on these four dichotomies; within such a re-mapping, two positions, capturing the nature of a witness’ knowledge and of a maker’s knowledge, can best be described as contingent, synthetic, a posteriori, and uninformative and as contingent, synthetic, weakly a priori, and uninformative respectively. In the conclusion, I indicate why the analysis of the maker’s knowledge has important consequences in all those cases in which the poietic intervention on a system determines the truth of the model of that system. (shrink)

In many social contexts, social influence seems to be inescapable: the behavior of others influences us to modify ours, and vice-versa. However, social psychology is full of examples of phenomena where individuals experience a discrepancy between their public behavior and their private opinion. This raises two central questions. First, how does an individual reason about the behavior of others and their private opinions in situations of social influence? And second, what are the laws of the resulting information dynamics? In this (...) paper, we address these questions by introducing a formal framework for representing reasoning about an individual’s private opinions and public behavior under the dynamics of social influence in social networks. Moreover, we dig deeper into the involved information dynamics by modeling how individuals can learn about each other based on this reasoning. This compels us to introduce a new formal notion of reflective social influence. Finally, we initialize the work on proof theory and automated reasoning for our framework by introducing a sound and complete tableaux system for a fragment of our logic. Furthermore, this constitutes the first tableau system for the “Facebook logic” of J. Seligman, F. Liu, and P. Girard. (shrink)

Epistemic logic in the tradition of Hintikka provides, as one of its many applications, a toolkit for the precise analysis of certain epistemological problems. In recent years, dynamic epistemic logic has expanded this toolkit. Dynamic epistemic logic has been used in analyses of well-known epistemic “paradoxes”, such as the Paradox of the Surprise Examination and Fitch’s Paradox of Knowability, and related epistemic phenomena, such as what Hintikka called the “anti-performatory effect” of Moorean announcements. In this paper, we explore a variation (...) on basic dynamic epistemic logic—what we call sequential epistemic logic—and argue that it allows more faithful and fine-grained analyses of those epistemological topics. (shrink)

The paper provides an alternative interpretation of ‘pair points’, discussed in Beall et al., "On the ternary relation and conditionality", J. of Philosophical Logic 41(3), 595-612. Pair points are seen as points viewed from two different ‘perspectives’ and the latter are explicated in terms of two independent valuations. The interpretation is developed into a semantics using pairs of Kripke models (‘pair models’). It is demonstrated that, if certain conditions are fulfilled, pair models are validity-preserving copies of positive substructural models. This (...) yields a general soundness and completeness result for a variety of (positive) substructural logics with respect to multimodal Kripke frames with binary accessibility relations. In addition, an epistemic interpretation of pair models is provided. (shrink)

Mathematicians often speak of conjectures, yet unproved, as probable or well-confirmed by evidence. The Riemann Hypothesis, for example, is widely believed to be almost certainly true. There seems no initial reason to distinguish such probability from the same notion in empirical science. Yet it is hard to see how there could be probabilistic relations between the necessary truths of pure mathematics. The existence of such logical relations, short of certainty, is defended using the theory of logical probability (or objective Bayesianism (...) or non-deductive logic), and some detailed examples of its use in mathematics surveyed. Examples of inductive reasoning in experimental mathematics are given and it is argued that the problem of induction is best appreciated in the mathematical case. (shrink)

Larry Moss and Rohit Parikh used subset semantics to characterize a family of logics for reasoning about knowledge. An important feature of their framework is that subsets always decrease based on the assumption that knowledge always increases. We drop this assumption and modify the semantics to account for logics of knowledge that handle arbitrary changes, that is, changes that do not necessarily result in knowledge increase, such as the update of our knowledge due to an action. We present a system (...) which is complete for subset spaces and prove its decidability. (shrink)

The current trend in knowledge revision in the Dynamic Epistemic Logic tradition focuses on the addition of new knowledge, rather than the possibility of losing knowledge. Yet there are natural situations, such as an agent who does not want another agent to know that she knows a certain piece of information, where there is a need to be able to model the retraction of a proposition from a knowledge base. One situation where this is systematically required is the variant of (...) the medieval theory of obligationes known as dubitatio, where one of the agents in the dialogue is obliged to hold the initial proposition, the dubitatum, as doubtful, regardless of what other propositions she may concede or deny during the disputation. In this paper, we use dubitatio as a motivation for studying deceitful agents, and we discuss various ways that an agent can move from a model where f is known to one where f is not known. (shrink)

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 $A_{Gx} \phi $ reading 'if the agents in the set of agents G identify themselves with institution x then they together accept that φ'. We extend acceptance logic by two kinds of dynamic modal operators. The first kind are public announcements of the form x!ψ, meaning that the agents learn that ψ is the case in (...) context x. Formulae of the form [x!ψ]φ mean that φ 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 ¬ψ-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 G:x↑ψ. 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)

Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. A distinction therefore arises between the logic and its substitution core, the set of formulas all of whose substitution instances are valid. The classic example of a non-uniform dynamic epistemic logic is Public Announcement Logic (PAL), and a well-known open problem is to axiomatize the substitution core of PAL. In this paper we solve this problem for PAL over the class of all relational models with infinitely (...) many agents, PAL-K_omega, as well as standard extensions thereof, e.g., PAL-T_omega, PAL-S4_omega, and PAL-S5_omega. We introduce a new Uniform Public Announcement Logic (UPAL), prove completeness of a deductive system with respect to UPAL semantics, and show that this system axiomatizes the substitution core of PAL. (shrink)

In this paper we study substantive assumptions in social interaction. By substantive assumptions we mean contingent assumptions about what the players know and believe about each other’s choices and information. We first explain why substantive assumptions are fundamental for the analysis of games and, more generally, social interaction. Then we show that they can be compared formally, and that there exist contexts where no substantive assumptions are being made. Finally we show that the questions raised in this paper are related (...) to a number of issues concerning “large” structures in epistemic game theory. (shrink)

In this paper, we first propose a simple formal language to specify types of agents in terms of necessary conditions for their announcements. Based on this language, types of agents are treated as ‘first-class citizens’ and studied extensively in various dynamic epistemic frameworks which are suitable for reasoning about knowledge and agent types via announcements and questions. To demonstrate our approach, we discuss various versions of Smullyan’s Knights and Knaves puzzles, including the Hardest Logic Puzzle Ever (HLPE) proposed by Boolos (...) (in Harv Rev Philos 6:62–65, 1996). In particular, we formalize HLPE and verify a classic solution to it. Moreover, we propose a spectrum of new puzzles based on HLPE by considering subjective (knowledge-based) agent types and relaxing the implicit epistemic assumptions in the original puzzle. The new puzzles are harder than the previously proposed ones in the literature, in the sense that they require deeper epistemic reasoning. Surprisingly, we also show that a version of HLPE in which the agents do not know the others’ types does not have a solution at all. Our formalism paves the way for studying these new puzzles using automatic model checking techniques. (shrink)

This paper formalizes part of a well-known psychological model of emotions. In particular, the logical structure underlying the conditions that trigger emotions are studied and then hierarchically organized. The insights gained therefrom are used to guide a formalization of emotion triggers, which proceeds in three stages. The first stage captures the conditions that trigger emotions in a semiformal way, i.e., without committing to an underlying formalism and semantics. The second stage captures the main psychological notions used in the emotion model (...) in dynamic doxastic logic. The third stage introduces a BDI-based framework (belief–desire–intention) with achievement goals, which is used to firmly ground the preceding stages. The result is a formalization of emotion triggers for BDI agents with achievement goals. The idea of proceeding in these stages is to provide different levels of commitment to formalisms, so that it remains relatively easy to extend or replace the used formalisms without having to start from scratch. Finally, we show that the formalization renders properties of emotions that are in line with the psychological model on which it is based. (shrink)

Rational agents base their actions on information from observation, inference, introspection, or other sources. But this information comes in different kinds, and it is usually handled by different logical mechanisms. We discuss how to integrate external ‘updating information’ and internal ‘elucidating information’ into one system of dynamic epistemic logic, by distinguishing two basic informational actions: ‘bare seeing’ versus ‘conscious realization’.

Starting from the sixties of the past century theory change has become a main concern of philosophy of science. Two of the best known formal accounts of theory change are the post-Popperian theories of verisimilitude (PPV for short) and the AGM theory of belief change (AGM for short). In this paper, we will investigate the conceptual relations between PPV and AGM and, in particular, we will ask whether the AGM rules for theory change are effective means for approaching the truth, (...) i.e., for achieving the cognitive aim of science pointed out by PPV. First, the key ideas of PPV and AGM and their application to a particular kind of propositional theories - the so called "conjunctive propositions" - will be illustrated. Afterwards, we will prove that, as far as conjunctive propositions are concerned, AGM belief change is an effective tool for approaching the truth. (shrink)

We suggest that developing automata theoretic foundations is relevant for knowledge theory, so that we study not only what is known by agents, but also the mechanisms by which such knowledge is arrived at. We define a class of epistemic automata, in which agents’ local states are annotated with abstract knowledge assertions about others. These are finite state agents who communicate synchronously with each other and information exchange is ‘perfect’. We show that the class of recognizable languages has good closure (...) properties, leading to a Kleene-type theorem using what we call regular knowledge expressions. These automata model distributed causal knowledge in the following way: each agent in the system has a partial knowledge of the temporal evolution of the system, and every time agents synchronize, they update each other’s knowledge, resulting in a more up-to-date view of the system state. Hence we show that these automata can be used to solve the satisfiability problem for a natural epistemic temporal logic for local properties. Finally, we characterize the class of languages recognized by epistemic automata as the regular consistent languages studied in concurrency theory. (shrink)

Formal learning theory is the mathematical embodiment of a normative epistemology. It deals with the question of how an agent should use observations about her environment to arrive at correct and informative conclusions. Philosophers such as Putnam, Glymour and Kelly have developed learning theory as a normative framework for scientific reasoning and inductive inference.

In the current debate there are two epistemological approaches to the definition of ignorance: the Standard View and the New View. The former defines ignorance simply as not knowing, while the latter defines it as the absence of true belief. One of the main differences between these two positions lies in rejecting (Standard View) or in accepting (New View) the factivity of ignorance, i.e., if an agent is ignorant of φ, then φ is true. In the present article, we first (...) provide a criticism of the Standard View in favour of the New View. Secondly, we propose a formal setting to represent the notion of factive ignorance. (shrink)

In dynamical multi-agent systems, agents are controlled by protocols. In choosing a class of formal protocols, an implicit choice is made concerning the types of agents, actions and dynamics representable. This paper investigates one such choice: An intensional protocol class for agent control in dynamic epistemic logic (DEL), called ‘DEL dynamical systems’. After illustrating how such protocols may be used in formalizing and analyzing information dynamics, the types of epistemic temporal models that they may generate are characterized. This facilitates a (...) formal comparison with the only other formal protocol framework in dynamic epistemic logic, namely the extensional ‘DEL protocols’. The paper concludes with a conceptual comparison, highlighting modeling tasks where DEL dynamical systems are natural. (shrink)

In this paper, I will develop a set of boulesic-doxastic tableau systems and prove that they are sound and complete. Boulesic-doxastic logic consists of two main parts: a boulesic part and a doxastic part. By ‘boulesic logic’ I mean ‘the logic of the will’, and by ‘doxastic logic’ I mean ‘the logic of belief’. The first part deals with ‘boulesic’ concepts, expressions, sentences, arguments and theorems. I will concentrate on two types of boulesic expression: ‘individual x wants it to be (...) the case that’ and ‘individual x accepts that it is the case that’. The second part deals with ‘doxastic’ concepts, expressions, sentences, arguments and theorems. I will concentrate on two types of doxastic expression: ‘individual x believes that’ and ‘it is imaginable to individual x that’. Boulesic-doxastic logic investigates how these concepts are related to each other. Boulesic logic is a new kind of logic. Doxastic logic has been around for a while, but the approach to this branch of logic in this paper is new. Each system is combined with modal logic with two kinds of modal operators for historical and absolute necessity and predicate logic with necessary identity and ‘possibilist’ quantifiers. I use a kind of possible world semantics to describe the systems semantically. I also sketch out how our basic language can be extended with propositional quantifiers. All the systems developed in this paper are new. (shrink)

En este ensayo exploramos una perspectiva epistemológica en la que el elemento social y colectivo del conocimiento juega un papel fundamental en la explicación de su producción y transmisión. Primero presentamos y criticamos una posición individualista que ha sido dominante en la epistemología contemporánea y cuyas raíces pueden trazarse, al menos, hasta Descartes. Posteriormente introducimos y defendemos nuestra propia mirada, una en la que el conocimiento es un proceso constituido por un conjunto de actividades y prácticas que tiene un carácter (...) material. (shrink)

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

This research is published within the project ‘The Logic of Conceivability’, funded by the European Research Council, Grant Number 681404.

In this paper we consider logical inference as an activity that results in proofs and hence produces knowledge. We suggest to merge the semantical analysis of deliberatively seeing-to-it-that from stit theory and the semantics of the epistemic logic with justification from. The general idea is to understand proving that A as seeing to it that a proof of A is available. We introduce a semantics of various notions of proving as an activity and present a number of valid principles that (...) relate the various notions of proving to each other and to notions of justified knowledge, implicit knowledge, and possibility. We also point out and comment upon certain principles our semantics fails to validate. (shrink)

In this work, we present a multi-agent logic of knowledge and change of knowledge interpreted on topological structures. Our dynamics are of the so-called semi-private character where a group G of agents is informed of some piece of information \, while all the other agents observe that group G is informed, but are uncertain whether the information provided is \ or \. This article follows up on our prior work where the dynamics were public events. We provide a complete axiomatization (...) of our logic, and give two detailed examples of situations with agents learning information through semi-private announcements. (shrink)

This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...) the semantics, such as inductive skepticism, the logic of discovery, Duhem’s problem, the articulation of theories by auxiliary hypotheses, the role of serendipity in scientific knowledge, Fitch’s paradox, deductive closure of knowability, whether one can know inductively that one knows inductively, whether one can know inductively that one does not know inductively, and whether expert instruction can spread common inductive knowledge—as opposed to mere, true belief—through a community of gullible pupils. (shrink)

Logic isn’t special. Its theories are continuous with science; its method continuous with scientific method. Logic isn’t a priori, nor are its truths analytic truths. Logical theories are revisable, and if they are revised, they are revised on the same grounds as scientific theories. These are the tenets of anti-exceptionalism about logic. The position is most famously defended by Quine, but has more recent advocates in Maddy, Priest, Russell, and Williamson. Although these authors agree on many methodological issues about logic, (...) they disagree about which logic anti-exceptionalism supports. Williamson uses an anti-exceptionalist argument to defend classical logic, while Priest claims that his anti-exceptionalism supports nonclassical logic. This paper argues that the disagreement is due to a difference in how the parties understand logical theories. Once we reject Williamson’s deflationary account of logical theories, the argument for classical logic is undercut. Instead an alternative account of logical theories is offered, on which logical pluralism is a plausible supplement to anti-exceptionalism. (shrink)

The Interrogative Model of Inquiry and Dynamic Epistemic Logics are two central paradigms in formal epistemology. This paper is motivated by the observation of a significant complementarity between them: on the one hand, the IMI provides a framework for investigating inquiry represented as an idealized game between an Inquirer and Nature, along with an account of the interaction between questions and inferences in information-seeking processes, but is lacking a formulation in the multi-agent case; on the other hand, DELs model various (...) operations of information change in multi-agent systems, but the field is lacking a proper integration of question and inference dynamics, along with an application to the investigation of inquiry processes. The goal of this paper is to integrate the two paradigms in such a way as to combine their respective insights. To this end, we develop a formal system called DEL $$_\mathrm{IMI }$$ IMI which aims to represent the interaction between question and inference dynamics in inquiry—as described by the IMI—in a multi-agent setting, and this in such a way as to enable an investigation of inquiry games with multi-agent dimensions. The DEL $$_\mathrm{IMI }$$ IMI system is designed to represent the possible moves of such inquiry games through three types of epistemic actions: agents addressing questions to Nature, agents addressing questions to other agents, agents drawing logical inferences. We then show how the resulting framework can be used to formally define multi-agent inquiry games. We conclude by evaluating the interest of the DEL $$_\mathrm{IMI }$$ IMI system for the IMI and DELs paradigms. (shrink)

In this paper I present a more refined analysis of the principles of deductive closure and positive introspection. This analysis uses the expressive resources of logics for different types of group knowledge, and discriminates between aspects of closure and computation that are often conflated. The resulting model also yields a more fine-grained distinction between implicit and explicit knowledge, and places Hintikka’s original argument for positive introspection in a new perspective.