Aybüke Özgün

We propose a new account of indicative conditionals, giving acceptability and logical closure conditions for them. We start from Adams’ Thesis: the claim that the acceptability of a simple indicative equals the corresponding conditional probability. The Thesis is widely endorsed, but arguably false and refuted by empirical research. To fix it, we submit, we need a relevance constraint: we accept a simple conditional 'If φ, then ψ' to the extent that (i) the conditional probability p(ψ|φ) is high, provided that (ii) φ is relevant for ψ. How (i) should work is well-understood. It is (ii) that holds the key to improve our understanding of conditionals. Our account has (i) a probabilistic component, using Popper functions; (ii) a relevance component, given via an algebraic structure of topics or subject matters. We present a probabilistic logic for simple indicatives, and argue that its (in)validities are both theoretically desirable and in line with empirical results on how people reason with conditionals.

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.

When one thinks—knows, believes, imagines—that something is the case, one’s thought has a topic: it is about something, towards which one’s mind is directed. What is the logic of thought, so understood? This book begins to explore the idea that, to answer the question, we should take topics seriously. It proposes a hyperintensional account of the propositional contents of thought, arguing that these are individuated not only by the set of possible worlds at which they are true, but also by their topic: what they are about. The book then builds epistemic, doxastic, probabilistic, and conditional logics based on this view. It applies them to issues ranging from dogmatism, scepticism, and epistemic fallibilism, to imagination and suppositional reasoning, belief revision, framing effects, and the acceptability of indicative conditionals.

_Framing effects_ concern the having of different attitudes towards logically or necessarily equivalent contents. Framing is of crucial importance for cognitive science, behavioral economics, decision theory, and the social sciences at large. We model a typical kind of framing, grounded in (i) the structural distinction between beliefs activated in working memory and beliefs left inactive in long term memory, and (ii) the topic- or subject matter-sensitivity of belief: a feature of propositional attitudes which is attracting growing research attention. We introduce a class of models featuring (i) and (ii) to represent, and reason about, agents whose belief states can be subject to framing effects. We axiomatize a logic which we prove to be sound and complete with respect to the class.

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.

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.

We explore some possibilities for developing epistemic logic using truthmaker semantics. We identify three possible targets of analysis for the epistemic logician. We then list some candidate epistemic principles and review the arguments that render some controversial. We then present the classic Hintikkan approach to epistemic logic and note—as per the ‘problem of logical omniscience’—that it validates all of the aforementioned principles, controversial or otherwise. We then lay out a truthmaker framework in the style of Kit Fine and present six different ways of extending this semantics with a conditional knowledge operator, drawing on notions of implication and content that are prominent in Fine’s work. We demonstrate that different logics are thereby generated, bearing on the aforementioned epistemic principles. Finally, we offer preliminary observations about the prospects for each logic.

Stalnaker, 169–199 2006) introduced a combined epistemic-doxastic logic that can formally express a strong concept of belief, a concept of belief as ‘subjective certainty’. In this paper, we provide a topological semantics for belief, in particular, for Stalnaker’s notion of belief defined as ‘epistemic possibility of knowledge’, in terms of the closure of the interior operator on extremally disconnected spaces. This semantics extends the standard topological interpretation of knowledge with a new topological semantics for belief. We prove that the belief logic KD45 is sound and complete with respect to the class of extremally disconnected spaces and we compare our approach to a different topological setting in which belief is interpreted in terms of the derived set operator. We also study belief revision as well as belief dynamics by providing a topological semantics for conditional belief and belief update modalities, respectively. Our setting based on extremally disconnected spaces, however, encounters problems when extended with dynamic updates. We then propose a solution consisting in interpreting belief in a similar way based on hereditarily extremally disconnected spaces, and axiomatize the belief logic of hereditarily extremally disconnected spaces. Finally, we provide a complete axiomatization of the logic of conditional belief and knowledge, as well as a complete axiomatization of the corresponding dynamic logic.

We propose a multi-agent logic of knowledge, public announcements and arbitrary announcements, interpreted on topological spaces in the style of subset space semantics. The arbitrary announcement modality functions similarly to the effort modality in subset space logics, however, it comes with intuitive and semantic differences. We provide axiomatizations for three logics based on this setting, with S5 knowledge modality, and demonstrate their completeness. We moreover consider the weaker axiomatizations of three logics with S4 type of knowledge and prove soundness and completeness results for these systems.

In recent work, Stalnaker proposes a logical framework in which belief is realized as a weakened form of knowledge. Building on Stalnaker’s core insights, we employ topological tools to refine and, we argue, improve on this analysis. The structure of topological subset spaces allows for a natural distinction between what is known and what is knowable; we argue that the foundational axioms of Stalnaker’s system rely intuitively on both of these notions. More precisely, we argue that the plausibility of the principles Stalnaker proposes relating knowledge and belief relies on a subtle equivocation between an “evidence-in-hand” conception of knowledge and a weaker “evidence-out-there” notion of what could come to be known. Our analysis leads to a trimodal logic of knowledge, knowability, and belief interpreted in topological subset spaces in which belief is definable in terms of knowledge and knowability. We provide a sound and complete axiomatization for this logic as well as its uni-modal belief fragment. We then consider weaker logics that preserve suitable translations of Stalnaker’s postulates, yet do not allow for any reduction of belief. We propose novel topological semantics for these irreducible notions of belief, generalizing our previous semantics, and provide sound and complete axiomatizations for the corresponding logics.

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.

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].

We introduce Arbitrary Public Announcement Logic with Memory (APALM), obtained by adding to the models a ‘memory’ of the initial states, representing the information before any communication took place (“the prior”), and adding to the syntax operators that can access this memory. We show that APALM is recursively axiomatizable (in contrast to the original Arbitrary Public Announcement Logic, for which the corresponding question is still open). We present a complete recursive axiomatization, that includes a natural finitary rule, and study this logic’s expressivity and the appropriate notion of bisimulation. We then examine Group Announcement Logic with Memory (GALM), the extension of APALM obtained by adding to its syntax group announcement operators, and provide a complete finitary axiomatization (again in contrast to the original Group Announcement Logic, for which the only known axiomatization is infinitary). We also show that, in the memory-enhanced context, there is a natural reduction of the so-called coalition announcement modality to group announcements (in contrast to the memory-free case, where this natural translation was shown to be invalid).

We propose a new topological semantics for evidence, evidence-based justifications, belief, and knowledge. Resting on the assumption that an agent’s rational belief is based on the available evidence, we try to unveil the concrete relationship between an agent’s evidence, belief, and knowledge via a rich formal framework afforded by topologically interpreted modal logics. We prove soundness, completeness, decidability, and the finite model property for the associated logics, and apply this setting to analyze key epistemological issues such as “no false lemma” Gettier examples, misleading defeaters, undefeated justification versus undefeated belief, as well as the defeasibility theories of knowledge.

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 $$\varphi $$ φ, while all the other agents observe that group G is informed, but are uncertain whether the information provided is $$\varphi $$ φ or $$\lnot \varphi $$ ¬φ. 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.

We propose a multi-agent logic of knowledge, public announcements and arbitrary announcements, interpreted on topological spaces in the style of subset space semantics. The arbitrary announcement modality functions similarly to the effort modality in subset space logics, however, it comes with intuitive and semantic differences. We provide axiomatizations for three logics based on this setting, with S5 knowledge modality, and demonstrate their completeness. We moreover consider the weaker axiomatizations of three logics with S4 type of knowledge and prove soundness and completeness results for these systems.