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)

This contributed volume includes both theoretical research on philosophical logic and its applications in artificial intelligence, mostly employing the concepts and techniques of modal logic. It collects selected papers presented at the Second Asia Workshop on Philosophical Logic, held in Guangzhou, China in 2014, as well as a number of invited papers by specialists in related fields. The contributions represent pioneering philosophical logic research in Asia.

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)

We propose a logic of imagination, based on simulated belief revision, that intends to uncover the logical patterns governing the development of imagination in pretense. Our system complements the currently prominent logics of imagination in that ours in particular formalises the algorithm that specifies what goes on in between receiving a certain input for an imaginative episode and what is imagined in the resulting imagination, as well as the goal-orientedness of imagination, by allowing the context to determine, what we call, (...) the overall topic of the imaginative episode. To achieve this, we employ well-developed tools and techniques from dynamic epistemic logic and belief revision theory, enriched with a topicality component which has been exploited in the recent literature. As a result, our logic models a great number of cognitive theories of pretense and imagination [cf. Currie and Ravenscroft ; Nichols and Stich ; Byrne ; Williamson ; Langland-Hassan Knowledge through imaginaion, Oxford University Press, Oxford, 2016]. (shrink)

This work proposes an understanding of deductive, default and abductive reasoning as different instances of the same phenomenon: epistemic dynamics. It discusses the main intuitions behind each one of these reasoning processes, and suggest how they can be understood as different epistemic actions that modify an agent’s knowledge and/or beliefs in a different way, making formal the discussion with the use of the dynamic epistemic logic framework. The ideas in this paper put the studied processes under the same umbrella, thus (...) highlighting their relationship and allowing a better understanding of how they interact together. (shrink)

Epistemic logic with its possible worlds semantic model is a powerful framework that allows us to represent an agent’s information not only about propositional facts, but also about her own information. Nevertheless, agents represented in this framework are logically omniscient: their information is closed under logical consequence. This property, useful in some applications, is an unrealistic idealisation in some others. Many proposals to solve this problem focus on weakening the properties of the agent’s information, but some authors have argued that (...) solutions of this kind are not completely adequate because they do not look at the heart of the matter: the actions that allow the agent to reach such omniscient state. Recent works have explored how acts of observation, inference, consideration and forgetting affect an agent’s implicit and explicit knowledge; the present work focuses on acts that affect an agent’s implicit and explicit beliefs. It starts by proposing a framework in which these two notions can be represented, and then it looks into their dynamics, first by reviewing the existing notion of belief revision, and then by introducing a rich framework for representing diverse forms of inference that involve both knowledge and beliefs. (shrink)

Among the non-monotonic reasoning processes, abduction is one of the most important. Usually described as the process of looking for explanations, it has been recognized as one of the most commonly used in our daily activities. Still, the traditional definitions of an abductive problem and an abductive solution mention only theories and formulas, leaving agency out of the picture. Our work proposes a study of abductive reasoning from an epistemic and dynamic perspective. In the first part we explore syntactic definitions (...) of both an abductive problem in terms of an agent’s information and an abductive solution in terms of the actions that modify the agent’s information. We look at diverse kinds of agents, including not only omniscient ones but also those whose information is not closed under logical consequence and those whose reasoning abilities are not complete. In the second part, we look at an existing logical framework whose semantic model allows us to interpret the previously stated formulas, and we define two actions that represent forms of abductive reasoning. (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)

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)

Counterfactual scepticism holds that most ordinary counterfactuals are false. The main argument for this view appeals to a ‘chance undermines would’ principle: if ψ would have some chance of not obtaining had ϕ obtained, then ϕ □→ ψ is false. This principle seems to follow from two fairly weak principles, namely, that ‘chance ensures could’ and that ϕ □→ ψ and ϕ ⋄→ ¬ ψ clash. Despite their initial plausibility, I show that these principles are independently problematic: given some modest (...) closure principles, they entail absurdities. Moreover, on the most promising strategy for saving these principles, they do not, in the relevant sense, entail the chance-undermines-would principle. Instead, they entail a principle that only supports counterfactual indeterminism, the view that most ordinary counterfactuals are chancy, that is, not settled true. I demonstrate this by developing an indeterminist semantics that vindicates the clash and chance-ensures-could principles but not the chance-undermines-would principle. This view, I argue, offers a better account of our credal and linguistic judgements than counterfactual scepticism. (shrink)

– We offer a new motivation for imprecise probabilities. We argue that there are propositions to which precise probability cannot be assigned, but to which imprecise probability can be assigned. In such cases the alternative to imprecise probability is not precise probability, but no probability at all. And an imprecise probability is substantially better than no probability at all. Our argument is based on the mathematical phenomenon of non-measurable sets. Non-measurable propositions cannot receive precise probabilities, but there is a natural (...) way for them to receive imprecise probabilities. The mathematics of non-measurable sets is arcane, but its epistemological import is far-reaching; even apparently mundane propositions are liable to be affected by non-measurability. The phenomenon of non-measurability dramatically reshapes the dialectic between critics and proponents of imprecise credence. Non-measurability offers natural rejoinders to prominent critics of imprecise credence. Non-measurability even reverses some of the critics’ arguments—by the very lights that have been used to argue against imprecise credences, imprecise credences are better than precise credences. (shrink)

We investigate, for several modal logics but concentrating on KT, KD45, S4 and S5, the set of formulas B for which ${\square B}$ is provably equivalent to ${\square A}$ for a selected formula A (such as p, a sentence letter). In the exceptional case in which a modal logic is closed under the (‘cancellation’) rule taking us from ${\square C \leftrightarrow \square D}$ to ${C \leftrightarrow D}$ , there is only one formula B, to within equivalence, in this inverse image, (...) as we shall call it, of ${\square A}$ (relative to the logic concerned); for logics for which the intended reading of “ ${\square}$ ” is epistemic or doxastic, failure to be closed under this rule indicates that from the proposition expressed by a knowledge- or belief-attribution, the propositional object of the attitude in question cannot be recovered: arguably, a somewhat disconcerting situation. More generally, the inverse image of ${\square A}$ may comprise a range of non-equivalent formulas, all those provably implied by one fixed formula and provably implying another—though we shall see that for several choices of logic and of the formula A, there is not even such an ‘interval characterization’ of the inverse image (of ${\square A}$ ) to be found. (shrink)

The Paradox of the Surprise Examination has been a testing ground for a variety of frameworks in formal epistemology, from epistemic logic to probability theory to game theory and more. In this paper, I treat a related paradox, the Paradox of the Undiscoverable Position, as a test case for the possible-worlds style representation of epistemic states. I argue that the paradox can be solved in this framework, further illustrating the power of possible-worlds style modeling. The solution also illustrates an important (...) distinction between anti-performatory and unassimilable announcements of information. (shrink)

The picture of information acquisition as the elimination of possibilities has proven fruitful in many domains, serving as a foundation for formal models in philosophy, linguistics, computer science, and economics. While the picture appears simple, its formalization in dynamic epistemic logic reveals subtleties: given a valid principle of information dynamics in the language of dynamic epistemic logic, substituting complex epistemic sentences for its atomic sentences may result in an invalid principle. In this article, we explore such failures of uniform substitution. (...) First, we give epistemic examples inspired by Moore, Fitch, and Williamson. Second, we answer affirmatively a question posed by van Benthem: can we effectively decide when every substitution instance of a given dynamic epistemic principle is valid? In technical terms, we prove the decidability of this schematic validity problem for public announcement logic (PAL and PAL-RC) over models for finitely many fully introspective agents, as well as models for infinitely many arbitrary agents. The proof of this result illuminates the reasons for the failure of uniform substitution. (shrink)

We investigate, in a logical setting, the expressivist proposal that assertion primarily functions to express and coordinate doxastic states and that ‘might’ fundamentally expresses lack of belief. We provide a formal model of an agent’s doxastic state and novel assertability conditions for an associated formal language. We thereby prove that an arbitrary assertion always succeeds in expressing a well-defined doxastic state, and propose a fully general and intuitive update operation as a model of an agent coming to accept an arbitrary (...) assertion. Leaving a comprehensive philosophical and linguistic defense for elsewhere, we explore technical aspects of our framework, providing, for instance, a complete logic of assertability and reduction axioms for the novel update operations related to our proposal. Finally, we contrast our work with related proposals in the logic literature. (shrink)

Past public announcement operators have been defined in Hoshi and Yap :259–281, 2009) and Yap, to describe an agent’s knowledge before an announcement occurs. These operators rely on branching-time structures that do not mirror the traditional, relativization-based semantics of public announcement logic, and favor a historical reading of past announcements. In this paper, we introduce reverse public announcement operators that are interpreted on expanded models. Our model expansion adds accessibility links from an epistemic model \ to a filtrated submodel of (...) the canonical model for \. Here \ is the minimal normal modal logic together with \ axioms for the universal operator U. This yields a highly general pre-announcement version of \ that makes our operators potentially useful for studying non-standard interpretations of rescinded announcements in PAL. Indeed, we find that our reverse announcement operators cannot be represented by product update, and that they have an intimate connection with the knowledge forgetting of Zhang and Zhou :1525–1537, 2009). We show that the logic resulting from adding reverse announcements to PAL is sound and complete. (shrink)

The paper develops an interface between syntax-based logical models of awareness and dynamic epistemic logic. The framework is shown to be able to accommodate a variety of notions of awareness and knowledge, as well as their dynamics. This, it is argued, offers a natural formal environment for the analysis of epistemic phenomena typical of multi-agent information exchange, such as how agents become aware of relevant details, how they perform inferences and how they share their information within a group. Technically, the (...) logics presented are all simple refinements of the logic of public announcements. (shrink)

A true lie is a lie that becomes true when announced. In a logic of announcements, where the announcing agent is not modelled, a true lie is a formula that becomes true when announced. We investigate true lies and other types of interaction between announced formulas, their preconditions and their postconditions, in the setting of Gerbrandy’s logic of believed announcements, wherein agents may have or obtain incorrect beliefs. Our results are on the satisfiability and validity of instantiations of these semantically (...) defined categories, on iterated announcements, including arbitrarily often iterated announcements, and on syntactic characterization. We close with results for iterated announcements in the logic of knowledge, and for lying as private announcements to different agents. Detailed examples illustrate our lying concepts. (shrink)

In van Benthem (2008), van Benthem proposes a dynamic consequence relation defined as${\psi _1}, \ldots,{\psi _n}{ \models ^d}\phi \,{\rm{iff}}{ \models ^{pa}}[{\psi _1}] \ldots [{\psi _n}]\phi,$where the latter denotes consequence in public announcement logic, a dynamic epistemic logic. In this paper we investigate the structural properties of a conditional dynamic consequence relation$\models _{\rm{\Gamma }}^d$extending van Benthem’s proposal. It takes into account a set of background conditions Γ, inspired by Makinson (2003) wherein Makinson calls this reasoning ‘modulo’ a set Γ. In the (...) presence of common knowledge, conditional dynamic consequence is definable from (unconditional) dynamic consequence. An open question is whether dynamic consequence is compact. We further investigate a dynamic consequence relation for soft instead of hard announcements. Surprisingly, it shares many properties with (hard) dynamic consequence. Dynamic consequence relations provide a novel perspective on reasoning about protocols in multi-agent systems. (shrink)

Contingency and accident are two important notions in philosophy and philosophical logic. Their meanings are so close that they are mixed up sometimes, in both daily life and academic research. This indicates that it is necessary to study them in a unified framework. However, there has been no logical research on them together. In this paper, we propose a language of a bimodal logic with these two concepts, investigate its model-theoretical properties such as expressivity and frame definability. We axiomatize this (...) logic over various classes of frames, whose completeness proofs are shown with the help of a crucial schema. The interactions between contingency and accident can sharpen our understanding of both notions. Then we extend the logic to a dynamic case: public announcements. By finding the required reduction axioms, we obtain a complete axiomatization, which gives us a good application to Moore sentences. (shrink)

This paper proposes a new model of graded modal judgment. It begins by problematizing the phenomenon: given plausible constraints on the logic of epistemic modality, it is impossible to model graded attitudes toward modal claims as judgments of probability targeting epistemically modal propositions. This paper considers two alternative models, on which modal operators are non-proposition-forming: (1) Moss (2015), in which graded attitudes toward modal claims are represented as judgments of probability targeting a “proxy” proposition, belief in which would underwrite belief (...) in the modal claim. (2) A model on which graded attitudes toward modal claims are represented as judgments of credence taking as their objects (non-propositional) modal representations (rather than proxy propositions). The second model, like Moss’ model, is shown to be semantically and mathematically tractable. The second model, however, can be straightforwardly integrated into a plausible model of the role of graded attitudes toward modal claims in cognition and normative epistemology. (shrink)

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

The combination of logic and game theory provides a fine-grained perspective on information and interaction dynamics, a Theory of Play. In this paper we lay down the main components of such a theory, drawing on recent advances in the logical dynamics of actions, preferences, and information. We then show how this fine-grained perspective has already shed new light on the long-term dynamics of information exchange, as well as on the much-discussed question of extensive game rationality.

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)