I discuss three ways of responding to the logical omniscience problems faced by traditional ‘possible worlds’ epistemic logics. Two of these responses were put forward by Hintikka and the third by Cresswell; all three have been influential in the literature on epistemic logic. I show that both of Hintikka's responses fail and present some problems for Cresswell’s. Although Cresswell's approach can be amended to avoid certain unpalatable consequences, the resulting formal framework collapses to a sentential model of knowledge, which defenders (...) of the ‘possible worlds’ approach are frequently critical of. (shrink)

Recent years witnessed a growing interest in non-standard epistemic logics of knowing whether, knowing how, knowing what, knowing why and so on. The new epistemic modalities introduced in those logics all share, in their semantics, the general schema of ∃x◻φ, e.g., knowing how to achieve φ roughly means that there exists a way such that you know that it is a way to ensure that φ. Moreover, the resulting logics are decidable. Inspired by those particular logics, in this work, we (...) propose a very general and powerful framework based on quantifier-free predicate language extended by a new modality, which packs exactly ∃x◻ together. We show that the resulting language, though much more expressive, shares many good properties of the basic propositional modal logic over arbitrary models, such as finite-tree-model property and van Benthem-like characterization w.r.t.\ first-order modal logic. We axiomatize the logic over S5 frames with intuitive axioms to capture the interaction between the new modality and know-that operator in an epistemic setting. (shrink)

La noción de mundos posibles, sostiene que nuestro mundo es un mundo entre otros, un subconjunto de todas las cosas que existen. Esto implica aceptar que existen mundos estructuralmente equivalentes con sus propios lenguajes [formales], que entre sí no tienen ningún estatuto privilegiado, p.e., el mundo y lenguaje del arte o el mundo y lenguaje de la física; no obstante, la idea de aceptar otros mundos equivalentes como mundos posibles epistémica y ontológicamente legítimos para acceder y expresar lo cognoscible del (...) mundo no goza de gran aceptación. En este sentido, de entre las múltiples dimensiones de la noción de mundos posibles anotada, su dimensión lógica, es una de las más extendidas, ésta se entiende como un posible estado de cosas o un posible curso de eventos. Empero, esta concepción es la más restrictiva de la noción de mundos posibles, no sólo porque dicha noción transmuta en una especie de «técnica predictiva» que nos permite analizar y visualizar posibles escenarios de un estado de cosas o un curso de eventos, sino porque fundamentalmente, la noción de mundos posibles pierde gran parte de su potencia conceptual. Hablar de proposiciones como conjuntos de mundos posibles, no es un error, pero es limitar innecesariamente el alcance y campo de acción de la noción de mundos posibles. Si entendemos dicha noción en la versión primaría de Lewis [«Nuestro mundo actual es sólo un mundo entre otros»], sería plausible recuperar, entre otras, las dimensiones ontológica y epistémica de la noción de mundos posibles, y por ende la posibilidad objetiva de indagar en formas alternativas y legitimas de acceder y expresar lo cognoscible del mundo; en este sentido, en este trabajo me propongo: (1) retomar la noción primaria de mundos posibles de Lewis, para analizar y explicitar brevemente sus limitaciones, virtudes y requerimientos; (2) examinar las condiciones de posibilidad de un mundo; y, (3) sugerir los lineamientos epistémicos que deberían considerarse y explicitarse cuando se habla de y desde un mundo posible a la hora de expresar un enunciado. (shrink)

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

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)

In an information state where various agents have both factual knowledge and knowledge about each other, announcements can be made that change the state of information. Such informative announcements can have the curious property that they become false because they are announced. The most typical example of that is 'fact p is true and you don't know that', after which you know that p, which entails the negation of the announcement formula. The announcement of such a formula in a given (...) information state is called an unsuccessful update. A successful formula is a formula that always becomes common knowledge after being announced. Analysis of information systems and 'philosophical puzzles' reveals a growing number of dynamic phenomena that can be described or explained by unsuccessful updates. This increases our understanding of such philosophical problems. We also investigate the syntactic characterization of the successful formulas. (shrink)

In this paper certain aspects of rigidity are studied through Hintikka’s work in modal semantics. The paper surveys Hintikka’s extraordinary struggles with rigidity from the late 50’s to this millennium. I argue that Hintikka’s many ambivalent remarks concerning rigidity become more comprehensible if, first, three different variants of rigidity are distinguished and, second, Hintikka’s largely implicit doctrine of semantic neo-Kantianism is made explicit.

Since it is desirable to be able to talk about rational agents forming attitudes toward their concrete agency, we suggest an introduction of doxastic, volitional, and intentional modalities into the multi-agent logic of deliberatively seeing to it that, dstit logic. These modalities are borrowed from the well-known BDI (belief-desire-intention) logic. We change the semantics of the belief and desire operators from a relational one to a monotonic neighbourhood semantic in order to handle ascriptions of conflicting but not inconsistent beliefs and (...) desires as being satisfiable. The proposed bdi-stit logic is defined with respect to branching time frames, and it is shown that this logic is a generalization of a bdi logic based on branching time possible worlds frames (but without temporal operators) and dstit logic. The new bdi-stit logic generalizes bdi and dstit logic in the sense that for any model of bdi or dstit logic, there is an equivalent bdi-stit model. (shrink)

The article introduces substructural epistemic logics of belief supported by evidence. The logics combine normal modal epistemic logics with distributive substructural logics. Pieces of evidence are represented by points in substructural models and availability of evidence is modelled by a function on the point set. The main technical result is a general completeness theorem. Axiomatisations are provided by means of two-sorted Hilbert-style calculi. It is also shown that the framework presents a natural solution to the problem of logical omniscience.

Aprimoro o bem-conhecido Quebra-Cabeça da Data de Aniversário com uma nova versão que requer somente seis datas possíveis. Depois, provo que não há versão mais simples desse quebracabeça. Essa versão, ao contrário da original, produz o seguinte curioso estado de coisas epistêmico: nós, espectadores, sabemos que Albert e Bernard conhecem a data de aniversário de Cheryl, mas nós mesmos não sabemos a data de aniversário dela. Finalmente, discuto uma versão mais sofisticada desse quebra-cabeça.

What is the minimal algebraic structure to reason about information flow? Do we really need the full power of Boolean algebras with co-closure and de Morgan dual operators? How much can we weaken and still be able to reason about multi-agent scenarios in a tidy compositional way? This paper provides some answers.

The paper explores a structural account of propositional justification in terms of the notion of being in a position to know and negation. Combined with a non-normal logic for being in a position to know, the account allows for the derivation of plausible principles of justification. The account is neutral on whether justification is grounded in internally individuated mental states, and likewise on whether it is grounded in facts that are already accessible by introspection or reflection alone. To this extent, (...) it is compatible both with internalism and with externalism about justification. Even so, the account allows for the proof of principles that are commonly conceived to depend on an internalist conception of justification. The account likewise coheres both with epistemic contextualism and with its rejection, and is compatible both with the knowledge-first approach and with its rejection. Despite its neutrality on these issues, the account makes propositional justification luminous and so is controversial. However, it proves quite resilient in the light of recent anti-luminosity arguments. (shrink)

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

Recent work on the development of a dialogical approach to the logic of fiction stresses the notion of existence as choice. Moreover, this approach to existence has been combined with the notion of ontolog-ical dependence as deployed by A. Thomasson’s artifactual theory of fiction. In order to implement such a combination within the dialogical frame several predicates of ontological dependence have been de-fined. However, the definition of such predicates seems to lean on a model-theoretic semantics for mod-al logic after all. (...) The main aim of the present paper is to set a dialogical frame for the study of fictions in the context of the dialogical approach of CTT recently developed by S. Rahman and N. Clerbout where a fully-interpreted language is unfolded. We will herewith develop the idea that in such a setting fiction-al entities are understood as hypothetical objects, that is, objects (functions) the existence of which is dependent upon one or more hypotheses that restrict the scope of choices available. We will finish the paper by suggesting that this provides both a natural and genuinely dialogical way to understand R. Frigg’s take on scientific models as fictions and a new perspective on Thomasson’s notion of generic ontological dependence. Keywords: fiction, dialogues, dialogical logic, hypothetical objects, scientific models. (shrink)

What epistemic defect needs to show up in a skeptical scenario if it is to effectively target some belief? According to the false belief account, the targeted belief must be false in the skeptical scenario. According to the competing ignorance account, the targeted belief must fall short of being knowledge in the skeptical scenario. This paper argues for two claims. The first is that, contrary to what is often assumed, the ignorance account is superior to the false belief account. The (...) second is that the ignorance account ultimately hobbles the skeptic. It does so for two reasons. First, when this account is joined with either a closure-based skeptical argument or a skeptical underdetermination argument, the best the skeptic can do is show that we don’t know that we know. And second, the ignorance account directly implies the maligned KK principle. (shrink)

After introducing Millianism and touching on two problems raised by genuinely empty names for Millianism (section I), I provide a brief exposition of the Gappy Proposition View (GPV) and of how different versions of this view can reply to the problems in question (section II). In the following sections I develop my reasons against the GPV. First, I will try to argue that apparently promising arguments for the claim that gappy propositions are propositions are not successful (section III). Then, I (...) will develop two arguments against GPs via demonstrating two odd consequences of the GPV: (a) that there can be an atomic proposition which contains other propositions that are not the semantic contents of any part of the .. (shrink)

I discuss what I call practical Moore sentences: sentences like ‘You must close your door, but I don’t know whether you will’, which combine an order together with an avowal of agnosticism about whether the order will be obeyed. I show that practical Moore sentences are generally infelicitous. But this infelicity is surprising: it seems like there should be nothing wrong with giving someone an order while acknowledging that you do not know whether it will obeyed. I suggest that this (...) infelicity points to a striking psychological fact, with potentially broad ramifications concerning the structure of norms of speech acts: namely, when giving an order, we must act as if we believe we will be obeyed. (shrink)

What does 'might' mean? One hypothesis is that 'It might be raining' is essentially an avowal of ignorance like 'For all I know, it's raining'. But it turns out these two constructions embed in different ways, in particular as parts of larger constructions like Wittgenstein's 'It might be raining and it's not' and Moore's 'It's raining and I don't know it', respectively. A variety of approaches have been developed to account for those differences. All approaches agree that both Moore sentences (...) and Wittgenstein sentences are classically consistent. In this paper I argue against this consensus. I adduce a variety of new data which I argue can best be accounted for if we treat Wittgenstein sentences as being classically inconsistent. This creates a puzzle, since there is decisive reason to think that 'Might p' is classically consistent with 'Not p'. How can it also be that 'Might p and not p' and 'Not p and might p' are classically inconsistent? To make sense of this situation, I propose a new theory of epistemic modals and their interaction with embedding operators. This account makes sense of the subtle embedding behavior of epistemic modals, shedding new light on their meaning and, more broadly, the dynamics of information in natural language. -/- . (shrink)

Karttunen observes that a presupposition triggered inside an attitude ascription, can be filtered out by a seemingly inaccessible antecedent under the scope of a preceding belief ascription. This poses a major challenge for presupposition theory and the semantics of attitude ascriptions. I solve the problem by enriching the semantics of attitude ascriptions with some independently argued assumptions on the structure and interpretation of mental states. In particular, I propose a DRT-based representation of mental states with a global belief-layer and a (...) variety of labeled attitude compartments embedded within it. Hence, desires and other non-doxastic attitudes are asymmetrically dependent on beliefs. I integrate these mental state representations into a general semantic account of attitude ascriptions which relies on the parasitic nature of non-doxastic attitudes to solve Karttunen’s puzzle. (shrink)

In this paper, we present several extensions of epistemic logic with update operators modelling public information change. Next to the well-known public announcement operators, we also study public substitution operators. We prove many of the results regarding expressivity and completeness using so-called reduction axioms. We develop a general method for using reduction axioms and apply it to the logics at hand.

This essay defends a principle that promises to help illuminate the nature of reflective knowledge. The principle in question belongs to a broader category called knows-knows principles, or KK principles for short. Such principles say that if you know some proposition, then you're in a position to know that you know it.KK principles were prominent among various historical philosophers and can be fruitfully integrated with many views in contemporary epistemology and beyond—and yet almost every contemporary analytic epistemologist thinks that they (...) are false.Regarding their historical pedigree: they've been endorsed by Plato, Aristotle, Augustine, Averroes, Aquinas, Spinoza, and Schopenhauer, among others.1Regarding... (shrink)

The paper provides an argument for the thesis that an agent’s degrees of disbelief should obey the ranking calculus. This Consistency Argument is based on the Consistency Theorem. The latter says that an agent’s belief set is and will always be consistent and deductively closed iff her degrees of entrenchment satisfy the ranking axioms and are updated according to the ranktheoretic update rules.

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)

Epistemic closure has been a central issue in epistemology over the last forty years. According to versions of the relevant alternatives and subjunctivist theories of knowledge, epistemic closure can fail: an agent who knows some propositions can fail to know a logical consequence of those propositions, even if the agent explicitly believes the consequence (having “competently deduced” it from the known propositions). In this sense, the claim that epistemic closure can fail must be distinguished from the fact that agents do (...) not always believe, let alone know, the consequences of what they know—a fact that raises the “problem of logical omniscience” that has been central in epistemic logic. This paper, part I of II, is a study of epistemic closure from the perspective of epistemic logic. First, I introduce models for epistemic logic, based on Lewis’s models for counterfactuals, that correspond closely to the pictures of the relevant alternatives and subjunctivist theories of knowledge in epistemology. Second, I give an exact characterization of the closure properties of knowledge according to these theories, as formalized. Finally, I consider the relation between closure and higher-order knowledge. The philosophical repercussions of these results and results from part II, which prompt a reassessment of the issue of closure in epistemology, are discussed further in companion papers. As a contribution to modal logic, this paper demonstrates an alternative approach to proving modal completeness theorems, without the standard canonical model construction. By “modal decomposition” I obtain completeness and other results for two non-normal modal logics with respect to new semantics. One of these logics, dubbed the logic of ranked relevant alternatives, appears not to have been previously identified in the modal logic literature. More broadly, the paper presents epistemology as a rich area for logical study. (shrink)

In this paper we investigate a logic for modelling individual and collective acceptances that is called acceptance logic. The logic has formulae of the form $A_{Gx} \phi $ reading 'if the agents in the set of agents G identify themselves with institution x then they together accept that φ'. We extend acceptance logic by two kinds of dynamic modal operators. The first kind are public announcements of the form x!ψ, meaning that the agents learn that ψ is the case in (...) context x. Formulae of the form [x!ψ]φ mean that φ is the case after every possible occurrence of the event x!ψ. Semantically, public announcements diminish the space of possible worlds accepted by agents and sets of agents. The announcement of ψ in context x makes all ¬ψ-Worlds inaccessible to the agents in such context. In this logic, if the set of accessible worlds of G in context x is empty, then the agents in G are not functioning as members of x, they do not identify themselves with x. In such a situation the agents in G may have the possibility to join x. To model this we introduce here a second kind of dynamic modal operator of acceptance shifting of the form G:x↑ψ. The latter means that the agents in G shift (change) their acceptances in order to accept ψ in context x. Semantically, they make ψ-worlds accessible to G in the context x, which means that, after such operation, G is functioning as member of x (unless there are no ψ-worlds). We show that the resulting logic has a complete axiomatization in terms of reduction axioms for both dynamic operators. In the paper we also show how the logic of acceptance and its dynamic extension can be used to model some interesting aspects of judgement aggregation. In particular, we apply our logic of acceptance to a classical scenario in judgment aggregation, the so-called 'doctrinal paradox' or 'discursive dilemma' (Pettit, Philosophical Issues 11: 268-299, 2001; Kornhauser and Sager, Yale Law Journal 96: 82-117, 1986). (shrink)

Theories of causation may imply that your birth causes your death, which seems odd in the way that it is not odd to say that your birth precedes your death. Theories of knowledge may imply that the object of knowledge is the same as the object of belief, although we know but do not believe facts and we can know a proposition without knowing whether it is true.

Theoria , the international Swedish philosophy journal, was founded in 1935. Its contributors in the first 75 years include the major Swedish philosophers from this period and in addition a long list of international philosophers, including A. J. Ayer, C. D. Broad, Ernst Cassirer, Hector Neri Castañeda, Arthur C. Danto, Donald Davidson, Nelson Goodman, R. M. Hare, Carl G. Hempel, Jaakko Hintikka, Saul Kripke, Henry E. Kyburg, Keith Lehrer, Isaac Levi, David Lewis, Gerald MacCallum, Richard Montague, Otto Neurath, Arthur N. (...) Prior, W. V. Quine, Nicholas Rescher, Ernest Sosa, Robert C. Stalnaker, P. F. Strawson, Patrick Suppes, Johan van Benthem, Georg Henrik von Wright and many others. Hempel's confirmation paradoxes, Ross's deontic paradox, Montague's universal grammar and Lindström's theorem are among the contributions to philosophy that were first published in Theoria. (shrink)

This paper discusses the possibility of modelling inductive inference (Gold 1967) in dynamic epistemic logic (see e.g. van Ditmarsch et al. 2007). The general purpose is to propose a semantic basis for designing a modal logic for learning in the limit. First, we analyze a variety of epistemological notions involved in identification in the limit and match it with traditional epistemic and doxastic logic approaches. Then, we provide a comparison of learning by erasing (Lange et al. 1996) and iterated epistemic (...) update (Baltag and Moss 2004) as analyzed in dynamic epistemic logic. We show that finite identification can be modelled in dynamic epistemic logic, and that the elimination process of learning by erasing can be seen as iterated belief-revision modelled in dynamic doxastic logic. Finally, we propose viewing hypothesis spaces as temporal frames and discuss possible advantages of that perspective. (shrink)

The combination of quantifiers with a semantics for epistemic operators in a modal framework is one of the major contributions of Hintikka in intensional logic. Hintikka’s starting point is his diagnosis of the failure of existential generalization and the substitution of identicals in terms of referential multiplicity. In this paper, I introduce Hintikka as a free logician. Indeed, Hintikka’s first-order epistemic logic is grounded on a logic free of ontological presuppositions with respect to singular terms. It is also a logic (...) free of presuppositions of uniqueness of reference. After having focused on the use of quantifiers and singular terms in Hintikka’s epistemic logic, I discuss some consequences from a semantico-logical perspective, but also from a philosophical one. By arguing against the so-called contingent a priori truths defended by Kripke, I conclude with a proposal in favour of Hintikka’s non-rigid interpretation of proper names. (shrink)

All reasoners described in the most widespread models of a rational reasoner exhibit logical omniscience, which is impossible for finite reasoners (real reasoners). The most common strategy for dealing with the problem of logical omniscience is to interpret the models using a notion of beliefs different from explicit beliefs. For example, the models could be interpreted as describing the beliefs that the reasoner would hold if the reasoner were able reason indefinitely (stable beliefs). Then the models would describe maximum rationality, (...) which a finite reasoner can only approach in the limit of a reasoning sequence. This strategy has important consequences for epistemology. If a finite reasoner can only approach maximum rationality in the limit of a reasoning sequence, then the efficiency of reasoning is epistemically (and not only pragmatically) relevant. In this paper, I present an argument to this conclusion and discuss its consequences, as, for example, the vindication of the principle 'no rationality through brute-force'. (shrink)

Our article aims to show, on the one hand, the preeminence of the interactive paradigm as a determining element in the process of constitution of logical meaning and, on the other hand, to examine the contents of the linguistic expressions of pragmatic semantics. To do this, we expose three major figures of the logic of mathematical obedience in particular those of Gottfreid Leibniz, George Boole and Gottlob Frege. If this approach to mathematical logic has seen meritorious progress, it should be (...) pointed out that it does not favor the emphasis on epistemic and interactive aspects in the notions of logical consequences and inference. Our contribution is therefore to demonstrate that these weaknesses can be solved with the revolutionary approach of Robert Brandom based on the framework that promotes the interactive game of supply and demand of reasons. This analysis leads to the idea that interactive play is the basis of contemporary logical approaches. (shrink)

This paper examines the paradox of revisability. This paradox was proposed by Jerrold Katz as a problem for Quinean naturalised epistemology. Katz employs diagonalisation to demonstrate what he takes to be an inconsistency in the constitutive principles of Quine's epistemology. Specifically, the problem seems to rest with the principle of universal revisability which states that no statement is immune to revision. In this paper it is argued that although there is something odd about employing universal revisability to revise itself, there (...) is nothing paradoxical about this. At least, there is no paradox along the lines suggested by Katz. (shrink)

Traditional approaches to the semantics of questions analyze questions indirectly, via the notion of an answer. In recent work on inquisitive semantics, a different perspective is taken: the meaning of a question is equated with its resolution conditions, just like the meaning of a statement is traditionally equated with its truth-conditions. In this paper I argue that this proposal improves on previous approaches, combining the formal elegance and explanatory power of Groenendijk and Stokhof’s partition theory with the greater generality afforded (...) by answer-set theories. (shrink)

The beliefs involved in the placebo effect are often assumed to be self-fulfilling, that is, the truth of these beliefs would merely require the patient to hold them. Such a view is commonly shared in epistemology. Many epistemologists focused, in fact, on the self-fulfilling nature of these beliefs, which have been investigated because they raise some important counterexamples to Nozick’s “tracking theory of knowledge.” We challenge the self-fulfilling nature of placebo-based beliefs in multi-agent contexts, analyzing their deep epistemological nature and (...) the role of higher-order beliefs involved in the placebo effect. (shrink)

I present a formal theory of the logic and aboutness of imagination. Aboutness is understood as the relation between meaningful items and what they concern, as per Yablo and Fine’s works on the notion. Imagination is understood as per Chalmers’ positive conceivability: the intentional state of a subject who conceives that p by imagining a situation—a configuration of objects and properties—verifying p. So far aboutness theory has been developed mainly for linguistic representation, but it is natural to extend it to (...) intentional states. The proposed framework combines a modal semantics with a mereology of contents: imagination operators are understood as variably strict quantifiers over worlds with a content-preservation constraint. (shrink)

Classical epistemic logic describes implicit knowledge of agents about facts and knowledge of other agents based on semantic information. The latter is produced by acts of observation or communication that are described well by dynamic epistemic logics. What these logics do not describe, however, is how significant information is also produced by acts of inference— and key axioms of the system merely postulate "deductive closure". In this paper, we take the view that all information is produced by acts, and hence (...) we also need a dynamic logic of inference steps showing what effort on the part of the agent makes a conclusion explicit knowledge. Strong omniscience properties of agents should be seen not as static idealizations, but as the result of dynamic processes that agents engage in. This raises two questions: (a) how to define suitable information states of agents and matching notions of explicit knowledge, (b) how to define natural processes over these states that generate new explicit knowledge. To this end, we use a static base from the existing awareness literature, extending it into a dynamic system that includes traditional acts of observation, but also adding and dropping formulas from the current ' awareness' set. We give a completeness theorem, and we show how this dynamics updates explicit knowledge. Then we extend our approach to multi-agent scenarios where awareness changes may happen privately. Finally, we mention further directions and related approaches. Our contribution can be seen as a ' dynamification' of existing awareness logics. (shrink)

The present study focuses on a grammatical category called evidentiality. The primary meaning of evidentiality is concerned with information source. That is, it expresses whether something has been seen, heard or inferred. The aim here is to conduct a conceptual study of evidentiality in which use is made of formal tools. The fundamental intuition is that the distinction between ‘evidence’as ‘proof’and ‘evidentiality’as ‘to do with proof’is a crucial one. Evidentiality is a dynamic notion to be analysed through the use of (...) knowledge by the agents, a knowledge in action, which involves an in-coming state and an out-coming state that is typical of the transmission of information. We propose our own approach in which the dynamics of knowledge in action is grasped in the context of a dynamic epistemic logic. (shrink)

We generalize AGM belief revision theory to the multi-agent case. To do so, we first generalize the semantics of the single-agent case, based on the notion of interpretation, to the multi-agent case. Then we show that, thanks to the shape of our new semantics, all the results of the AGM framework transfer. Afterwards we investigate some postulates that are specific to our multi-agent setting. Finally, we give an example of revision operator that fulfills one of these new postulates and give (...) an example of revision on a concrete example. (shrink)

In epistemic logic, some axioms dealing with the notion of knowledge are rather convoluted and difficult to interpret intuitively, even though some of them, such as the axioms.2 and.3, are considered to be key axioms by some epistemic logicians. We show that they can be characterized in terms of understandable interaction axioms relating knowledge and belief or knowledge and conditional belief. In order to show it, we first sketch a theory dealing with the characterization of axioms in terms of interaction (...) axioms in modal logic. We then apply the main results and methods of this theory to obtain specific results related to epistemic and doxastic logics. (shrink)

Representing an epistemic situation involving several agents obviously depends on the modeling point of view one takes. We start by identifying the types of modeling points of view which are logically possible. We call the one traditionally followed by epistemic logic the perfect external approach, because there the modeler is assumed to be an omniscient and external observer of the epistemic situation. In the rest of the paper we focus on what we call the internal approach, where the modeler is (...) one of the agents involved in the situation. For this approach we propose and axiomatize a logical formalism based on epistemic logic. This leads us to formalize some intuitions about the internal approach and about its connections with the external ones. Finally, we show that our internal logic is decidable and PSPACE-complete. (shrink)

This paper is a guide to the main ideas and innovations in Robert Stalnaker's "Indicative Conditionals". The paper is for a volume of essays on twenty-one classics of formal semantics edited by Louise McNally and Zoltàn Gendler Szabò.

When do we judge that someone was forced to do what they did? One relatively well-established finding is that subjects tend to judge that agents were not forced to do actions when those actions violate norms. A surprising discovery of Young & Phillips 2011 is that this effect seems to disappear when we frame the relevant ‘force’-claim in the active rather than passive voice ('X forced Y to φ ' vs. 'Y was forced to φ by X'). Young and Phillips (...) found a similar contrast when the scenario itself shifts attention from Y (the forcee) to X (the forcer). We propose that these effects can be (at least partly) explained by way of the role of attention in the setting of quantifier domains which in turn play a role in the evaluation of ‘force’- claims. We argue for this hypothesis by way of an experiment which shows that sequences of active vs. passive ‘force’-claims display the characteristic “stickiness” of quantifier domain expansion, using a paradigm which we argue provides a useful general paradigm for testing quantifier domain hypotheses. Finally, we sketch a semantics for ‘force’ which we argue is suitable for capturing these effects. (shrink)

Information is often modelled as a set of relevant possibilities, treated as logically possible worlds. However, this has the unintuitive consequence that the logical consequences of an agent's information cannot be informative for that agent. There are many scenarios in which such consequences are clearly informative for the agent in question. Attempts to weaken the logic underlying each possible world are misguided. Instead, I provide a genuinely psychological notion of epistemic possibility and show how it can be captured in a (...) formal model, which I call a fan. I then show how to use fans to build formal models of being informed, as well as knowledge, belief and information update. (shrink)

Modal logic is one of philosophy’s many children. As a mature adult it has moved out of the parental home and is nowadays straying far from its parent. But the ties are still there: philosophy is important to modal logic, modal logic is important for philosophy. Or, at least, this is a thesis we try to defend in this chapter. Limitations of space have ruled out any attempt at writing a survey of all the work going on in our field—a (...) book would be needed for that. Instead, we have tried to select material that is of interest in its own right or exemplifies noteworthy features in interesting ways. Here are some themes that have guided us throughout the writing: • The back-and-forth between philosophy and modal logic. There has been a good deal of give-and-take in the past. Carnap tried to use his modal logic to throw light on old philosophical questions, thereby inspiring others to continue his work and still others to criticise it. He certainly provoked Quine, who in his turn provided—and continues to provide—a healthy challenge to modal logicians. And Kripke’s and David Lewis’s philosophies are connected, in interesting ways, with their modal logic. Analytic philosophy would have been a lot different without modal logic! • The interpretation problem. The problem of providing a certain modal logic with an intuitive interpretation should not be conflated with the problem of providing a formal system with a model-theoretic semantics. An intuitively appealing model-theoretic semantics may be an important step towards solving the interpretation problem, but only a step. One may compare this situation with that in probability theory, where definitions of concepts like ‘outcome space’ and ‘random variable’ are orthogonal to questions about “interpretations” of the concept of probability. • The value of formalisation. Modal logic sets standards of precision, which are a challenge to—and sometimes a model for—philosophy. Classical philosophical questions can be sharpened and seen from a new perspective when formulated in a framework of modal logic. On the other hand, representing old questions in a formal garb has its dangers, such as simplification and distortion. • Why modal logic rather than classical (first or higher order) logic? The idioms of modal logic—today there are many!—seem better to correspond to human ways of thinking than ordinary extensional logic. (Cf. Chomsky’s conjecture that the NP + VP pattern is wired into the human brain.) In his An Essay in Modal Logic (1951) von Wright distinguished between four kinds of modalities: alethic (modes of truth: necessity, possibility and impossibility), epistemic (modes of being known: known to be true, known to be false, undecided), deontic (modes of obligation: obligatory, permitted, forbidden) and existential (modes of existence: universality, existence, emptiness). The existential modalities are not usually counted as modalities, but the other three categories are exemplified in three sections into which this chapter is divided. Section 1 is devoted to alethic modal logic and reviews some main themes at the heart of philosophical modal logic. Sections 2 and 3 deal with topics in epistemic logic and deontic logic, respectively, and are meant to illustrate two different uses that modal logic or indeed any logic can have: it may be applied to already existing (non-logical) theory, or it can be used to develop new theory. (shrink)

A well-known open problem in epistemic logic is to give a syntactic characterization of the successful formulas. Semantically, a formula is successful if and only if for any pointed model where it is true, it remains true after deleting all points where the formula was false. The classic example of a formula that is not successful in this sense is the “Moore sentence” p ∧ ¬BOXp, read as “p is true but you do not know p.” Not only is the (...) Moore sentence unsuccessful, it is self-refuting, for it never remains true as described. We show that in logics of knowledge and belief for a single agent (extended by S5), Moorean phenomena are the source of all self-refutation; moreover, in logics for an introspective agent (extending KD45), Moorean phenomena are the source of all unsuccessfulness as well. This is a distinctive feature of such logics, for with a non-introspective agent or multiple agents, non-Moorean unsuccessful formulas appear. We also consider how successful and self-refuting formulas relate to the Cartesian and learnable formulas, which have been discussed in connection with Fitch’s “paradox of knowability.” We show that the Cartesian formulas are exactly the formulas that are not eventually self-refuting and that not all learnable formulas are successful. In an appendix, we give syntactic characterizations of the successful and the self-refuting formulas. (shrink)

Degrees of belief are familiar to all of us. Our confidence in the truth of some propositions is higher than our confidence in the truth of other propositions. We are pretty confident that our computers will boot when we push their power button, but we are much more confident that the sun will rise tomorrow. Degrees of belief formally represent the strength with which we believe the truth of various propositions. The higher an agent’s degree of belief for a particular (...) proposition, the higher her confidence in the truth of that proposition. For instance, Sophia’s degree of belief that it will be sunny in Vienna tomorrow might be .52, whereas her degree of belief that the train will leave on time might be .23. The precise meaning of these statements depends, of course, on the underlying theory of degrees of belief. These theories offer a formal tool to measure degrees of belief, to investigate the relations between various degrees of belief in different propositions, and to normatively evaluate degrees of belief. (shrink)