In the present article, we introduce a multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The display approach is suitable to modularly chart the space of dynamic epistemic logics on weaker-than-classical propositional base. The presence of types endows the language of the Dynamic Calculus with additional expressivity, allows for a smooth proof-theoretic treatment, and paves the way towards a general methodology for the design of (...) proof systems for the generality of dynamic logics, and certainly beyond dynamic epistemic logic. We prove that the Dynamic Calculus adequately captures Baltag–Moss–Solecki's dynamic epistemic logic, and enjoys Belnap-style cut elimination. (shrink)

This thesis provides an analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics. After an illustration of the basic principles of proof-theoretic semantics, we review some of the most significant proposals of proof systems for dynamic epistemic logics, and we critically reject on them in the light of proof-theoretic semantic principles. The main original contributions of the present thesis are: (a) a revised version of the display-style calculus D.EAK, (...) which we argue to be more adequate from the proof-theoretic semantic viewpoint; the main feature of this revision is that a smoother proof (so-called Belnap-style) of cut-elimination holds for it, which is problematic for the original version of D.EAK. (b) The intro duction of a novel, multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The presence of types endows the language of the Dynamic Calculus with additional expressivity, and makes it possible to design rules with an even smoother behavior. We argue that this calculus paves the way towards a general methodology for the design of proof systems for the generality of dynamic logics, and certainly for proof systems beyond dynamic epistemic logic. We prove that the Dynamic Calculus adequately captures Baltag-Moss-Solecki's dynamic epistemic logic, and enjoys Belnap-style cut elimination. (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 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, 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)

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)

The present article provides an analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics. Dynamic epistemic logic is one of the best known members of a family of logical systems that have been successfully applied to diverse scientific disciplines, but the proof-theoretic treatment of which presents many difficulties. After an illustration of the proof-theoretic semantic principles most relevant to the treatment of logical connectives, we turn to illustrating the main (...) features of display calculi, a proof-theoretic paradigm that has been successfully employed to give a proof-theoretic semantic account of modal and substructural logics. Then, we review some of the most significant proposals of proof systems for dynamic epistemic logics, and we critically reflect on them in the light of the previously introduced proof-theoretic semantic principles. The contributions of the present article include a generalization of Belnap's cut-elimination metatheorem for display calculi, and a revised version of the display-style calculus D.EAK. We verify that the revised version satisfies the previously mentioned proof-theoretic semantic principles, and show that it enjoys cut-elimination as a consequence of the generalized metatheorem. (shrink)

Dynamic epistemic logic (DEL) is a multi-modal logic for reasoning about the change of knowledge in multi-agent systems. It extends epistemic logic by a modal operator for actions which announce logical formulas to other agents. In Hilbert-style proof calculi for DEL, modal action formulas are reduced to epistemic logic, whereas current sequent calculi for DEL are labelled systems which internalize the semantic accessibility relation of the modal operators, as well as the accessibility relation underlying (...) the semantics of the actions. We present a novel cut-free ordinary sequent calculus, called |$ \textbf{G4}_{P,A}[] $|⁠, for propositional DEL. In contrast to the known sequent calculi, our calculus does not internalize the accessibility relations, but—similar to Hilbert style proof calculi—action formulas are reduced to epistemic formulas. Since no ordinary sequent calculus for full S5 modal logic is known, the proof rules for the knowledge operator and the Boolean operators are those of an underlying S4 modal calculus. We show the soundness and completeness of |$ \textbf{G4}_{P,A}[] $| and prove also the admissibility of the cut-rule and of several other rules for introducing the action modality. (shrink)

In this paper, we investigate the use of event models for automated planning. Event models are the action defining structures used to define a semantics for dynamic epistemic logic. Using event models, two issues in planning can be addressed: Partial observability of the environment and knowledge. In planning, partial observability gives rise to an uncertainty about the world. For single-agent domains, this uncertainty can come from incomplete knowledge of the starting situation and from the nondeterminism of actions. In (...) multi-agent domains, an additional uncertainty arises from the fact that other agents can act in the world, causing changes that are not instigated by the agent itself. For an agent to successfully construct and execute plans in an uncertain environment, the most widely used formalism in the literature on automated planning is “belief states”: sets of different alternatives for the current state of the world. Epistemic logic is a significantly more expressive and theoretically better founded method for representing knowledge and ignorance about the world. Further, epistemic logic allows for planning according to the knowledge (and iterated knowledge) of other agents, allowing the specification of a more complex class of planning domains, than those simply concerned with simple facts about the world. We show how to model multi-agent planning problems using Kripke-models for representing world states, and event models for representing actions. Our mechanism makes use of slight modifications to these concepts, in order to model the internal view of agents, rather than that of an external observer. We define a type of planning domain called epistemic planning domains, a generalisation of classical planning domains, and show how epistemic planning can successfully deal with partial observability, nondeterminism, knowledge and multiple agents. Finally, we show epistemic planning to be decidable in the single-agent case, but only semi-decidable in the multi-agent case. (shrink)

This paper introduces a multi-agent dynamic epistemic logic for abstract argumentation. Its main motivation is to build a general framework for modelling the dynamics of a debate, which entails reasoning about goals, beliefs, as well as policies of communication and information update by the participants. After locating our proposal and introducing the relevant tools from abstract argumentation, we proceed to build a three-tiered logical approach. At the first level, we use the language of propositional logic to encode (...) states of a multi-agent debate. This language allows to specify which arguments any agent is aware of, as well as their subjective justification status. We then extend our language and semantics to that of epistemic logic, in order to model individuals’ beliefs about the state of the debate, which includes uncertainty about the information available to others. As a third step, we introduce a framework of dynamic epistemic logic and its semantics, which is essentially based on so-called event models with factual change. We provide completeness results for a number of systems and show how existing formalisms for argumentation dynamics and unquantified uncertainty can be reduced to their semantics. The resulting framework allows reasoning about subtle epistemic and argumentative updates—such as the effects of different levels of trust in a source—and more in general about the epistemic dimensions of strategic communication. (shrink)

In the literature there are at least two main formal structures to deal with situations of interactive epistemology: Kripke models and type spaces. As shown in many papers :149–225, 1999; Battigalli and Siniscalchi in J Econ Theory 106:356–391, 2002; Klein and Pacuit in Stud Log 102:297–319, 2014; Lorini in J Philos Log 42:863–904, 2013), both these frameworks can be used to express epistemic conditions for solution concepts in game theory. The main result of this paper is a formal (...) comparison between the two and a statement of semantic equivalence with respect to two different logical systems: a doxastic logic for belief and an epistemic–doxastic logic for belief and knowledge. Moreover, a sound and complete axiomatization of these logics with respect to the two equivalent Kripke semantics and type spaces semantics is provided. Finally, a probabilistic extension of the result is also presented. A further result of the paper is a study of the relationship between the epistemic–doxastic logic for belief and knowledge and the logic STIT by Belnap and colleagues. (shrink)

A combination of epistemic logic and dynamic logic of programs is presented. Although rich enough to formalize some simple game-theoretic scenarios, its axiomatization is problematic as it leads to the paradoxical conclusion that agents are omniscient. A cut-free labelled Gentzen-style proof system is then introduced where knowledge and action, as well as their combinations, are formulated as rules of inference, rather than axioms. This provides a logical framework for reasoning about games in a modular and systematic way, and (...) to give a step-by-step reconstruction of agents omniscience. In particular, its semantic assumptions are made explicit and a possible solution can be found in weakening the properties of the knowledge operator. (shrink)

Throughout the last decade, there has been an increased interest in various forms of dynamic epistemic logics to model the flow of information and the effect this flow has on knowledge in multi-agent systems. This enterprise, however, has mostly been applicationally and semantically driven. This results in a limited amount of proof theory for dynamic epistemic logics. In this paper, we try to compensate for a part of this by presenting terminating tableau systems for full (...) dynamic epistemic logic with action models and for a hybrid public announcement logic. The tableau systems are extensions of already existing tableau systems, in addition to which we have used the reduction axioms of dynamic epistemic logic to define rules for the dynamic part of the logics. Termination is shown using methods introduced by Braüner, Bolander, and Blackburn. (shrink)

In the multi-agent setting, it is relevant to model group dynamics of agents, and logic has proved a good tool to do so. We propose an epistemic logic, L-DINF-E, that allows one to formalize what are the beliefs formed by a group of agents, where several groups exist and agents can pass from a group to another one. We introduce a new modality which allows an agent to reason about the beliefs of other agents. This allows us to (...) model aspects of the “Theory of Mind”, understood as the set of social-cognitive skills involving the ability to attribute and reason about mental states, desires, beliefs, and knowledge of agents. In this paper, we present the logic L-DINF-E and illustrate how it can be used to solve “false-belief tasks”, i.e., tests in which an agent should understand that some other agent may develop, under some circumstances, false beliefs. (shrink)

In the paper, certain rational postulates for protocols describing real communicating are introduced.These rational postulates, on the one hand, allow assigning a certain typology of real systems of interactions, which is consistent with the reality of epistemic argumentation in systems of communicating, and on the other one – defining rules of using argumentation in real situations. Moreover, the presented postulates for protocols characterize information networks and administering knowledge in real interactivity systems. Due to the epistemic character of the (...) considerations, the problem undertaken in the paper concerns working out fundamental assumptions that refer to building of epistemic logics. They allow establishing the correctness of the discourse defined by rational postulates of protocols of real communication. In the context of the presented problem there are the following two research questions distinguished: 1) How do we determine the rule of building of real dynamic epistemic logics? and 2) How should we define semantics for these logics? Within the framework of considerations relating to the research questions asked, certain epistemic operators, relativized to types of communicating, are introduced. Basic logical relations between using these operators are established for these operators. The relations are presented by a diagram called the square of epis temic operators. On the basis of these logical relations some axioms for real dynamic epistemic logics are presented. The semantics of real dynamic epistem ic logics is extended by the methods of lower and upper approximation of formula evaluating. This allows defining ‘approximation Kripke models’. The results of conceptualization of knowledge on real premises of epistemic argum entation presented in this paper can be applied to rhetoric in real systems of interaction. (shrink)

Current dynamic-epistemic logics model different types of information change in multi-agent scenarios. We generalize these logics to a probabilistic setting, obtaining a calculus for multi-agent update with three natural slots: prior probability on states, occurrence probabilities in the relevant process taking place, and observation probabilities of events. To match this update mechanism, we present a complete dynamic logic of information change with a probabilistic character. The completeness proof follows a compositional methodology that applies to a (...) much larger class of dynamic-probabilistic logics as well. Finally, we discuss how our basic update rule can be parameterized for different update policies, or learning methods. (shrink)

Compositional verification aims at managing the complexity of theverification process by exploiting compositionality of the systemarchitecture. In this paper we explore the use of a temporal epistemiclogic to formalize the process of verification of compositionalmulti-agent systems. The specification of a system, its properties andtheir proofs are of a compositional nature, and are formalized within acompositional temporal logic: Temporal Multi-Epistemic Logic. It isshown that compositional proofs are valid under certain conditions.Moreover, the possibility of incorporating default persistence ofinformation in a (...) system, is explored. A completion operation on aspecific type of temporal theories, temporal completion, is introducedto be able to use classical proof techniques in verification withrespect to non-classical semantics covering default persistence. (shrink)

Current dynamic-epistemic logics model different types of information change in multi-agent scenarios. We generalize these logics to a probabilistic setting, obtaining a calculus for multi-agent update with three natural slots: prior probability on states, occurrence probabilities in the relevant process taking place, and observation probabilities of events. To match this update mechanism, we present a complete dynamic logic of information change with a probabilistic character. The completeness proof follows a compositional methodology that applies to a (...) much larger class of dynamic-probabilistic logics as well. Finally, we discuss how our basic update rule can be parameterized for different update policies, or learning methods. (shrink)

We draw parallels between several closely related logics that combine — in different proportions — elements of game theory, computation tree logics, and epistemic logics to reason about agents and their abilities. These are: the coalition game logics CL and ECL introduced by Pauly 2000, the alternating-time temporal logic ATL developed by Alur, Henzinger and Kupferman between 1997 and 2002, and the alternating-time temporal epistemic logic ATEL by van der Hoek and Wooldridge (2002). In particular, we establish some (...) subsumption and equivalence results for their semantics, as well as interpretation of the alternating-time temporal epistemic logic into ATL. The focus in this paper is on models: alternating transition systems, multi-player game models (alias concurrent game structures) and coalition effectivity models turn out to be intimately related, while alternating epistemic transition systems share much of their philosophical and formal apparatus. Our approach is constructive: we present ways to transform between different types of models and languages. (shrink)

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 studies the Lockean thesis from the perspective of contemporary epistemic logic. The Lockean thesis states that belief can be defined as ‘sufficiently high degree of belief’. Its main problem is that it gives rise to a notion of belief which is not closed under conjunction. This problem is typical for classical epistemic logic: it is single-agent and static. I argue that from the perspective of contemporary epistemic logic, the Lockean thesis fares much better. I briefly (...) mention that it can successfully be extended from single-agent to multi-agent settings. More importantly, I show that accepting the Lockean thesis (and a more sophisticated version for conditional beliefs) leads to a significant and unexpected unification in the dynamic behavior of (conditional) belief and high (conditional) probability with respect to public announcements. This constitutes a methodological argument in favor of the Lockean thesis. Furthermore, if one accepts Baltag’s Erlangen program for epistemology, this technical observation has even stronger philosophical implications: because belief and high probability display the same dynamic behavior, it is plausible that they are indeed one and the same epistemic notion. (shrink)

This book concerns the foundations of epistemic modality. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality relates to the computational theory of mind; metaphysical modality; the types of mathematical modality; to the epistemic status of large cardinal axioms, undecidable propositions, and abstraction principles in the philosophy of mathematics; to the modal profile (...) of rational intuition; and to the types of intention, when the latter is interpreted as a modal mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal cognitivism and modal expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic epistemic two-dimensional hyperintensional semantics. Chapter \textbf{3} provides an abstraction principle for epistemic intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states, by contrast to availing of modal axiom 4 (i.e. the KK principle). Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapter \textbf{4} is availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional intensions of epistemic two-dimensional semantics solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between topic-sensitive epistemic two-dimensional truthmaker semantics, the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. Chapter \textbf{9} examines the modal profile of $\Omega$-logic in set theory. Chapter \textbf{10} examines the modal commitments of abstractionism, in particular necessitism, and epistemic modality and the epistemology of abstraction. Chapter \textbf{11} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of epistemic two-dimensional semantics in order to account for the interaction of the interpretational and objective modalities thereof. Chapter \textbf{12} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Chapter \textbf{14} examines, finally, the modal semantics for the different types of intention and the relation of the latter to evidential decision theory. The multi-hyperintensional, topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} is applied in chapters \textbf{7}, \textbf{8}, \textbf{10}, \textbf{11}, \textbf{12}, and \textbf{14}.}. (shrink)

A dynamic epistemic logic is presented in which the single agent can reason about his knowledge stages before and after announcements. The logic is generated by reinterpreting multi agent private announcements in a single agent environment. It is shown that a knowability principle is valid for such logic: any initially true ϕ can be known after a certain number of announcements.

Dynamic Epistemic Logic is the logic of knowledge change. This book provides various logics to support such formal specifications, including proof systems. Concrete examples and epistemic puzzles enliven the exposition. The book also offers exercises with answers. It is suitable for graduate courses in logic. Many examples, exercises, and thorough completeness proofs and expressivity results are included. A companion web page offers slides for lecturers and exams for further practice.

Dynamic epistemic logic, broadly conceived, is the study of logics of information change. This is the first paper in a two-part series introducing this research area. In this paper, I introduce the basic logical systems for reasoning about the knowledge and beliefs of a group of agents.

In this dissertation we present proof systems for several modal logics. These proof systems are based on analytic (or semantic) tableaux. -/- Modal logics are logics for reasoning about possibility, knowledge, beliefs, preferences, and other modalities. Their semantics are almost always based on Saul Kripke’s possible world semantics. In Kripke semantics, models are represented by relational structures or, equivalently, labeled graphs. Syntactic formulas that express statements about knowledge and other modalities are evaluated in terms of such models. -/- This dissertation (...) focuses on modal logics with dynamic operators for public announcements, belief revision, preference upgrades, and so on. These operators are defined in terms of mathematical operations on Kripke models. Thus, for example, a belief revision operator in the syntax would correspond to a belief revision operation on models. -/- The ‘dynamic’ semantics of dynamic modal logics are a clever way of extending languages without compromising on intuitiveness. We present ‘dynamic’ tableau proof systems for these dynamic semantics, with the express aim to make them conceptually simple, easy to use, modular, and extensible. This we do by reflecting the semantics as closely as possible in the components of our tableau system. For instance, dynamic operations on Kripke models have counterpart dynamic relations between tableaux. -/- Soundness, completeness, and decidability are three of the most important properties that a proof system may have. A proof system is sound if and only if any formula for which a proof exists, is true in every model. A proof system is complete if and only if for any formula that is true in all models, a proof exists. A proof system is decidable if and only if any formula can be proved to be a theorem or not a theorem in a finite number of steps. All proof systems in this dissertation are sound, complete, and decidable. -/- Part of our strategy to create modular tableau systems is to delay concerns over decidability until after soundness and completeness have been established. Decidability is attained through the operations of folding and through operations on ‘tableau cascades’, which are graphs of tableaux. -/- Finally, we provide a proof-of-concept implementation of our dynamic tableau system for public announcement logic in the Clojure programming language. (shrink)

This paper presents a logic combining Dynamic Epistemic Logic, a framework for reasoning about multi-agent communication, with a new multi-agent version of Justification Logic, a framework for reasoning about evidence and justification. This novel combination incorporates a new kind of multi-agent evidence elimination that cleanly meshes with the multi-agent communications from Dynamic Epistemic Logic, resulting in a system for reasoning about multi-agent communication and evidence elimination for groups of interacting rational agents.

The dynamic epistemic logic for actual knowledge models the phenomenon of actual knowledge change when new information is received. In contrast to the systems of dynamic epistemic logic which have been discussed in the past literature, our system is not burdened with the problem of logical omniscience, that is, an idealized assumption that the agent explicitly knows all classical tautologies and all logical consequences of his or her knowledge. We provide a sound and complete axiomatization for (...) this logic. (shrink)

Formal dialogue systems model rule-based interaction between agents and as such have multiple applications in multi-agent systems and AI more generally. Their conceptual roots are in formal theories of natural argumentation, of which Hamblin’s formal systems of argumentation in Hamblin (Fallacies. Methuen, London, 1970, Theoria 37:130–135, 1971) are some of the earliest examples. Hamblin cites the medieval theory of obligationes as inspiration for his development of formal argumentation. In an obligatio, two agents, the Opponent and the Respondent, engage in (...) an alternating-move dialogue, where the Respondent’s actions are governed by certain rules, and the goal of the dialogue is establishing the consistency of a proposition. We implement obligationes in the formal dialogue system framework of Prakken (Knowl Eng Rev 21(2):163–188, 2006) using Dynamic Epistemic Logic (van Ditmarsch et al. in Dynamic epistemic logic, Synthese Library Series. Springer, Berlin, 2007). The result is a new type of inter-agent dialogue, for consistency-checking, and analyzing obligationes in this way also sheds light on interpretational and historical questions concerning their use and purpose in medieval academia. (shrink)

This study realizes belief/reliability change of a judge in a legal judgment by dynamic epistemic logic. A key feature of DEL is that possibilities in an agent’s belief can be represented by a Kripke model. This study addresses two difficulties in applying DEL to a legal case. First, since there are several methods for constructing a Kripke model, our question is how we can construct the model from a legal case. Second, since this study employs several dynamic (...) operators, our question is how we can decide which operators are to be applied for belief/reliability change of a judge. In order to solve these difficulties, we have implemented a computer system which provides two functions. First, the system can generate a Kripke model from a legal case. Second, the system provides an inconsistency solving algorithm which can automatically perform several operations in order to reduce the effort needed to decide which operators are to be applied. By our implementation, the above questions can be adequately solved. With our analysis method, six legal cases are analyzed to demonstrate our implementation. (shrink)

This is the second paper in a two-part series introducing logics for reasoning about the dynamics of knowledge and beliefs. Part I introduced different logical systems that can be used to reason about the knowledge and beliefs of a group of agents. In this second paper, I show how to adapt these logical systems to reason about the knowledge and beliefs of a group of agents during the course of a social interaction or rational inquiry. Inference, communication and observation are (...) typical examples of informative events, which have been subjected to a logical analysis. The main goal of this article is to introduce the key conceptual and technical issues that drive much of the research in this area. (shrink)

We propose a general framework for dynamic epistemic logics. It consists of a generic language for DELs and a class of structures, called model transition systems, that describe model transformations in a static way. An MTS can be viewed as a two-layered Kripke model and consequently inherits standard concepts such as bisimulation and bounded morphism from the ordinary Kripke models. In the second half of this article we add the global operator to the language, which enables us to (...) define the notions of a canonical MTS and canonicity of a DEL formula for a property of MTSs. Using these notions, we clarify correspondences between axioms of DELs and properties of MTSs. (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)

Artemov and Protopopescu introduced a Brouwer-Heyting-Kolmogorov interpretation of knowledge operator to define the intuitionistic epistemic logic IEL, where the axiom A⊃KA\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A\supset KA$$\end{document} is accepted but the axiom KA⊃A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$KA\supset A$$\end{document} is refused. This paper studies the notion of distributed knowledge on an expansion of the multi agent variant of IEL. We provide a BHK interpretation of distributed knowledge operator to define the (...) intuitionistic epistemic logic with distributed knowledge DIEL. We construct Hilbert system and cut-free sequent calculus for DIEL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {DIEL}$$\end{document} and show that they are sound and complete for the intended Kripke semantics. (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)

Epistemic modal predicate logic raises conceptual problems not faced in the case of alethic modal predicate logic : Frege’s “Hesperus-Phosphorus” problem—how to make sense of ascribing to agents ignorance of necessarily true identity statements—and the related “Hintikka-Kripke” problem—how to set up a logical system combining epistemic and alethic modalities, as well as others problems, such as Quine’s “Double Vision” problem and problems of self-knowledge. In this paper, we lay out a philosophical approach to epistemic predicate logic, implemented (...) formally in Melvin Fitting’s First-Order Intensional Logic, that we argue solves these and other conceptual problems. Topics covered include: Quine on the “collapse” of modal distinctions; the rigidity of names; belief reports and unarticulated constituents; epistemic roles; counterfactual attitudes; representational vs. interpretational semantics; ignorance of co-reference vs. ignorance of identity; two-dimensional epistemic models; quantification into epistemic contexts; and an approach to multi-agent epistemic logic based on centered worlds and hybrid logic. (shrink)

In this paper we show how recent concepts from Dynamic Logic, and in particular from Dynamic Epistemic logic, can be used to model and interpret quantum behavior. Our main thesis is that all the non-classical properties of quantum systems are explainable in terms of the non-classical flow of quantum information. We give a logical analysis of quantum measurements (formalized using modal operators) as triggers for quantum information flow, and we compare them with other logical operators previously used (...) to model various forms of classical information flow: the “test” operator from Dynamic Logic, the “announcement” operator from Dynamic Epistemic Logic and the “revision” operator from Belief Revision theory. The main points stressed in our investigation are the following: (1) The perspective and the techniques of “logical dynamics” are useful for understanding quantum information flow. (2) Quantum mechanics does not require any modification of the classical laws of “static” propositional logic, but only a non-classical dynamics of information. (3) The main such non-classical feature is that, in a quantum world, all information-gathering actions have some ontic side-effects. (4) This ontic impact can affect in its turn the flow of information, leading to non-classical epistemic side-effects (e.g. a type of non-monotonicity) and to states of “objectively imperfect information”. (5) Moreover, the ontic impact is non-local: an information-gathering action on one part of a quantum system can have ontic side-effects on other, far-away parts of the system. (shrink)

The non-alethic systems N1 of da Costa and A of Grana are both paraconsistent and paracomplete. Based on them, a multi-agent doxastic logic NADK can be obtained by logical expansion. The soundness and completeness of NADK are proved and its special theorems are also presented. In this logic, the belief version of the laws of contradiction and excluded middle, as well as the principle of explosion are all invalid. Therefore, it may provide a reliable logical basis for any theory (...) which has paraconsistent or paracomplete epistemic conflicts, such as true contradictions, true contrarieties, and belief paradoxes. We also explain in detail how a non-alethic doxastic logic provides a reliable logical basis for tolerating these three types of epistemic conflicts. The present paper is the deepening and development of system N1 and A. (shrink)

In this paper we study automated reasoning in the modal logic CPDLreg which is a combination of CPDL (Propositional Dynamic Logic with Converse) and REGc (Regular Grammar Logic with Converse). The logic CPDL is widely used in many areas, including program verification, theory of action and change, and knowledge representation. On the other hand, the logic REGc is applicable in reasoning about epistemic states and ontologies (via Description Logics). The modal logic CPDLreg can serve as a technical foundation (...) for reasoning about agency. Even very rich multi-agent logics can be embedded into CPDLreg via a suitable translation. Therefore, CPDLreg can serve as a test bed to implement and possibly verify new ideas without providing specific automated reasoning techniques for the logic in question. This process can to a large extent be automated. The idea of embedding various logics into CPDLreg is illustrated on a rather advanced logic TEAMLOGK designed to specify teamwork in multi-agent systems. Apart from defining informational and motivational attitudes of groups of agents, TEAMLOGK allows for grading agents' beliefs, goals and intentions. The current paper is a companion to our paper (Dunin-Kęplicz et al., 2010a). The main contribution are proofs of soundness and completeness of the tableau calculus for CPDLreg provided in (Dunin-Kęplicz et al., 2010a). (shrink)

Many logical systems today describe intelligent interacting agents over time. Frameworks include Interpreted Systems (IS, Fagin et al. [8]), Epistemic-Temporal Logic (ETL, Parikh & Ramanujam [22]), STIT (Belnap et al. [5]), Process Algebra and Game Semantics (Abramsky [1]). This variety is an asset, as different modeling tools can be fine-tuned to specific applications. But it may also be an obstacle, when barriers between paradigms and schools go up. This paper takes a closer look at one particular interface, between two (...) systems that both address the dynamics of knowledge and information flow in multi-agent systems. One is IS/ETL (IS and ETL are, from a technical point of view, the same up to model transformations, cf. [20]), which uses linear or branching time models with added epistemic structure induced by agents’ different capabilities for observing events. These models provide a Grand Stage where histories of some process unfold constrained by a protocol, and a matching epistemic-temporal language describes what happens. The other framework is Dynamic Epistemic Logic (DEL, [10, 4, 34]) that describes interactive processes in terms of epistemic event models which may occur inside modalities of the language. Temporal evolution is then computed from some initial epistemic model through a process of successive ‘product updates’. It has long been unclear how to best compare IS/ETL and DEL. Various aspects have been investigated in [10, 30, 32], but in this paper, we study the interface in a more systematic way. Often, DEL and ETL are presented as alternative ways of adding dynamics to multi-agent epistemic models. In this paper, we rather focus on how merging the two different modeling choices leads to interesting new questions. Our leading interest here will be a view of informational processes as evolving over time. To see what we mean, consider the simplest version of DEL, viz. the logic of public announcements PAL ([23]) which adds a very specific type of communicative 1 action to epistemic models: a public announcement.. (shrink)

In this article, we present a new logical framework to think about surprise. This research does not just aim to better understand, model and predict human behaviour, but also attempts to provide tools for implementing artificial agents. Moreover, these artificial agents should then also be able to reap the same epistemic benefits from surprise as humans do. We start by discussing the dominant literature regarding propositional surprise and explore its shortcomings. These shortcomings are of both an empirical and a (...) conceptual nature. Next, we propose a philosophical solution to the problems that ail these systems, based on the notion of issue of epistemic interest. Finally, we give a formal framework to think about surprise. More specifically, we develop a probabilistic dynamic epistemic logic that succeeds at formalizing the relevant philosophical concepts. This will be done through an issue management system grounded in topology. As an added bonus, the additional expressive power allows us to capture a richer variety of scenarios, and it also enables a more careful analysis of said scenarios. (shrink)

The aim of this paper, is to provide a logical framework for reasoning about actions, agency, and powers of agents and coalitions in game-like multi-agent systems. First we define our basic Dynamic Logic of Agency ( ). Differently from other logics of individual and coalitional capability such as Alternating-time Temporal Logic (ATL) and Coalition Logic, in cooperation modalities for expressing powers of agents and coalitions are not primitive, but are defined from more basic dynamic logic operators of (...) action and (historic) necessity. We show that STIT logic can be reconstructed in . We then extend with epistemic operators, which allows us to distinguish capability and power. We finally characterize the conditions under which agents are aware of their capabilities and powers. (shrink)

Theory of mind refers to the human capacity for reasoning about others’ mental states based on observations of their actions and unfolding events. This type of reasoning is notorious in the cognitive science literature for its presumed computational intractability. A possible reason could be that it may involve higher-order thinking. To investigate this we formalize theory of mind reasoning as updating of beliefs about beliefs using dynamic epistemic logic, as this formalism allows to parameterize ‘order of thinking.’ (...) We prove that theory of mind reasoning, so formalized, indeed is intractable. Using parameterized complexity we prove, however, that the ‘order parameter’ is not a source of intractability. We furthermore consider a set of alternative parameters and investigate which of them are sources of intractability. We discuss the implications of these results for the understanding of theory of mind. (shrink)

Focused sequent calculi are a refinement of sequent calculi, where additional side-conditions on the applicability of inference rules force the implementation of a proof search strategy. Focused cut-free proofs exhibit a special normal form that is used for defining identity of sequent calculi proofs. We introduce a novel focused display calculus fD.LG and a fully polarized algebraic semantics FP.LG\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {FP.LG}$$\end{document} for Lambek–Grishin logic by generalizing the theory of multi-type (...) calculi and their algebraic semantics with heterogenous consequence relations. The calculus fD.LG has strong focalization and it is sound and complete w.r.t. FP.LG\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {FP.LG}$$\end{document}. This completeness result is in a sense stronger than completeness with respect to standard polarized algebraic semantics, insofar as we do not need to quotient over proofs with consecutive applications of shifts over the same formula. We also show a number of additional results. fD.LG is sound and complete w.r.t. LG-algebras: this amounts to a semantic proof of the so-called completeness of focusing, given that the standard (display) sequent calculus for Lambek–Grishin logic is complete w.r.t. LG-algebras. fD.LG and the focused calculus fLG of Moortgat and Moot are equivalent with respect to proofs, indeed there is an effective translation from fLG-derivations to fD.LG-derivations and vice versa: this provides the link with operational semantics, given that every fLG-derivation is in a Curry–Howard correspondence with a directional λ¯μμ~\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\overline{\lambda }\mu \widetilde{\mu }$$\end{document}-term. (shrink)

As far as logic is concerned, the conclusion of Michael Dummett's manifestability argument is that intuitionistic logic, as first developed by Heyting, satisfies the semantic requirements of antirealism. The argument may be roughly sketched as follows: since we cannot manifest a grasp of possibly justification-transcendent truth conditions, we must countenance conditions which are such that, at least in principle and by the very nature of the case, we are able to recognize that they are satisfied whenever they are. Intuitionistic logic (...) satisfies the semantic requirement that we should either eschew the notion of truth altogether and replace it by provability in principle, or constrain it by provability in principle (Dummett [1973] 1978). (Handout: 1-5). Some philosophers have argued that the traditional antirealist desideratum of decidability in principle is too weak, so that semantic antirealism properly construed must be committed to effective decidability. As such, it either leads to strict finitism (Wright [1982] 1993) [Handout: 6] or to a much stronger kind of logical revisionism than the one considered by intuitionists (whether or not they accept the manifestability argument): substructural logics, and in particular linear logics, rather than intuitionistic logic, satisfy the semantic requirements of strict antirealism (Dubucs and Marion 2004) [Handout: 8-9]. I shall develop two different kinds of replies. The first is concerned with the notion of meaning per se and looks to strict finitism directly, although not on the ground that it would provide a correct way of dealing with Soritic-type paradoxes (the original and primary focus of discussion in Wright [1982] 1993). The second is concerned with the justification of structural and logical rules in a natural deduction system à la Gentzen. It will deal in particular with the criticism of the structural rules of Weakening and Contraction [Handout: 10 and 11]. The first kind of reply, which Dummett has partially taken into consideration, is that if we jettison the effectively vs. in principle distinction, as applied to manifestability-type arguments, we end up with an unsatisfactory explanation of how the meaning of statements covering the practically unsurveyable or pro tempora undecided cases is fixed. The idea is that if we have a method which may be used over some small range, we have determined a way of applying the method everywhere in principle and that this is enough as far as fixing meaning is concerned. Decidability in principle is just what we need with respect to manifestation of grasp of meaning. In this perspective, antirealism shouldn't be strict and manifestability-type arguments need not be applied as far as the strict finitist would want to [Handout: 7]. It follows that there is no reason to think that practical feasibility should be built in assertibility conditions and proofs be construed dynamically as acts in the strict antirealist's acception of that term [Handout: 8]. I shall then look at one radical antirealist principle disqualifying structural rules, namely Token Preservation, arguing against Bonnay and Cozic's criticisms of Dubucs and Marion (Bonnay and Cozic 3 2007) that some conceptual support may be provided for Token Preservation, which doesn't rely on a causal misreading of the turnstile [Handout: 13, 14]. I shall then assess the merits and limits of radical antirealism and the logic of feasible proofs with respect to the original Dummettian argument in favour of semantic antirealism (provided it has indeed revisionist implications for logic), whether the radical antirealist merely stipulates what human feasibility amounts to, or dispenses with structural rules in order to argue in favour of a curb on the epistemic idealizations they unwarrantedly embed. It will be noted here that there is a great difference, conceptually speaking, between the rejection of classical logic via the curbing of the epistemic idealizations embedded in structural rules, and the rejection of classical logic via the criticism of the introduction and elimination rules which fix the meaning of the classical constants. The kind of logical revisionism envisaged by intuitionists from Heyting on is in many respects stronger than the one envisaged by advocates of linear logic, should they ground their arguments on an endorsement of strict antirealism. The crucial case of excluded middle is telling. Because of the splitting of the constants in linear logic (Handout: 12], two distinct laws of excluded middle may be formulated (Handout: 15), but the traditional arguments of Brouwer and Heyting against the classical law yield a stronger revision than the substructural revision with its admission of these two (very) weak versions of the law. (Project: a clearer conception is needed of how the introduction and elimination rules for the logical connectives in the intuitionistic calculus depend on the structural rules which the radical antirealist wishes to reject.). (shrink)

Since Plaza [1989], which is most of the time considered as the inaugural paper on announcement logics in public communication contexts, a lot of papers on dynamic epistemic logics have been published. The most famous dynamic epistemic logic is known by the name of PAL (Public Announcement Logic). The logic PAC is an extension of PAL with the common knowledge operator (CG). Soundness and completeness proofs of those logics are presented in van Ditmarsch et al. [2008], (...) in Balbiani et al. [2010] and in de Boer [2007]. Each of them used either a model-theoretic approach or a tableaux calculus. In the present paper, we propose an alternative approach to PAC based on the dialogical framework. (shrink)

Current dynamic epistemic logics for analyzing effects of informational events often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions involving common knowledge are essential to successful multi-agent communication. We propose new systems that extend the epistemic base language with a new notion of ‘relativized common knowledge’, in such a way that the resulting full dynamic logic of information flow allows for a compositional analysis of all epistemic postconditions (...) via perspicuous ‘reduction axioms’. We also show how such systems can deal with factual alteration, rather than just information change, making them cover a much wider range of realistic events. After a warm-up stage of analyzing logics for public announcements, our main technical results are expressivity and completeness theorems for a much richer logic that we call LCC. This is a dynamic epistemic logic whose static base is propositional dynamic logic (PDL), interpreted epistemically. This system is capable of expressing all model-shifting operations with finite action models, while providing a compositional analysis for a wide range of informational events. This makes LCC a serious candidate for a standard in dynamic epistemic logic, as we illustrate by analyzing some complex communication scenarios, including sending successive emails with both ‘cc’ and ‘bcc’ lines, and other private announcements to subgroups. Our proofs involve standard modal techniques, combined with a new application of Kleene’s theorem on finite automata, as well as new Ehrenfeucht games of model comparison. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large (...) cardinal axioms, undecidable propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal cognitivism and modal expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic two-dimensional semantics. Chapter \textbf{3} provides an abstraction principle for epistemic (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between the interpretational and objective modalities and truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals while bypassing the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large (...) cardinal axioms, undecidable propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter 2 argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal cognitivism and modal expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic epistemic two-dimensional hyperintensional semantics. Chapter 3 provides an abstraction principle for epistemic (hyper-)intensions. Chapter 4 advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter 5 applies the fixed points of the modal μ-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal μ-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal μ-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter 6 advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter 7 provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters 2 and 4 are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. Chapters 8-12 provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter 8 examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of Ω-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter 9 examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter 10 examines the philosophical significance of hyperintensional Ω-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter 11 provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter 12 avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between the interpretational and objective modalities and truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals while bypassing the category of Set in category theory. Chapter 13 examines modal responses to the alethic paradoxes. Chapter 14 examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)