ABSTRACT First, I consider a few motivations to idealize epistemic logics1 in such a degree that brings up the problem of logical omniscience [LOP]. I argue that the main motivation to hold omniscience is of a philosophical-scientific2 background, in the sense philosophers have a not so peculiar way of investigating underlying mechanisms, i.e., the interaction of several different components of complex systems may be better understood in isolation, even if such components are not found isolated in a realistic context. It (...) is defended that the implicit and explicit knowledge distinction is compatible that view since idealizations made by modal epistemic logic are so strong that the agents they describe hardly have anything in common with real agents. I conclude by showing how LOP can be accommodated in the logic of being informed using the Inverse Relationship Principle. 1Epistemic modal logics and the logic of being informed may collapse in many scenarios, as shown in previous articles. 2Does not necessarily imply in a naturalized epistemology a la. For a plea for non-naturalism as constructionism see. (shrink)

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. (shrink)

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

We describe Peirce’s 1903 system of modal gamma graphs, its transformation rules of inference, and the interpretation of the broken-cut modal operator. We show that Peirce proposed the normality rule in his gamma system. We then show how various normal modal logics arise from Peirce’s assumptions concerning the broken-cut notation. By developing an algebraic semantics we establish the completeness of fifteen modal logics of gamma graphs. We show that, besides logical necessity and possibility, Peirce proposed an epistemic interpretation of the (...) broken-cut modality, and that he was led to analyze constructions of knowledge in the style of epistemic logic. (shrink)

Dynamic Epistemic Logic (DEL) is the study of how to reason about knowledge, belief, and communication. This paper studies the relative expressivity of certain fragments of the DEL language for public and private communication. It is shown that the language of public communication with common knowledge and the language of private communication with common knowledge are expressively incomparable for the class of all pointed Kripke models, which provides a formal proof that public and private communication are fundamentally different in the (...) presence of common knowledge. It is also shown that single-recipient private communication does not add expressive power to the language of modal logic with common knowledge for any class of transitive pointed Kripke models. The latter result provides a sense in which positive introspection—believing our own beliefs—induces a kind of self-dialog. (shrink)

In a previous article, I argued against the widespread reluctance of philosophers to treat skeptical challenges to oura prioriknowledge of necessary truths with the same seriousness as skeptical challenges to oura posterioriknowledge of contingent truths. Hamid Vahid has recently offered several reasons for thinking the unequal treatment of these two kinds of skepticism is justified, one of which isa prioriskepticism’s seeming dependence upon the widely scornedkkthesis. In the present article, I defenda prioriskepticism against Vahid’s criticisms.

One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong. In particular, I argue that computational complexity theory---the field that studies the resources needed to solve computational problems---leads to new perspectives on the nature of mathematical knowledge, the strong AI debate, computationalism, the problem of logical omniscience, Hume's problem of induction and Goodman's (...) grue riddle, the foundations of quantum mechanics, economic rationality, closed timelike curves, and several other topics of philosophical interest. I end by discussing aspects of complexity theory itself that could benefit from philosophical analysis. (shrink)

As Quine observed, the following sentence has a reading which, if true, would be of special interest to the authorities: Ralph believes that someone is a spy. This is the reading where the quantifier is naturally understood as taking wide scope relative to the attitude verb and as binding a variable within the scope of the attitude verb. This essay is interested in addressing the question what the semantic analysis of this kind of reading should look like from a Fregean (...) perspective—a perspective according to which attitude states are generally relations to structured Fregean thoughts composed of senses. The Fregean view faces a challenge of compositionality here. This essay describes the challenge and offers a response on the Fregean's behalf. (shrink)

I explain what exactly constrains presupposition projection in compound sentences and argue that the presuppositions that do not project are conditionalized, giving rise to inferable conditional presuppositions. I combine elements of and which, together with an additional, independently motivated assumption, make it possible to construct an analysis that makes correct predictions. The core of my proposal is as follows: When a speaker felicitously utters a compound sentence whose constituent clauses require presuppositions, the hearer will infer that the speaker presupposes those (...) propositions, unless the sentence contains some element that makes the hearer realize that, if the speaker actually presupposed them, she would be either uninformative or inconsistent in her beliefs. In these cases, the propositions that would have been presupposed, had the clauses been uttered in isolation, will not be presupposed, i.e. the clausal presuppositions will not project. (shrink)

The frequently used term "certainty" plays in the human life an important role, especially in specifying the goals of human activities. The presented study distinguishes two different meanings of this term: the certainty as a state of the mind and the certainty of anything, i.e. the certainty connected with a set of specific conditions. A certainty in the former meaning is usually presented as an important component of some ideologies. As an explanatory model of the certainty of anything, there could (...) be applied the approaches developed in the sphere of intensional or modal logics, especially the concept of epistemic attitudes. The contemporary scientific and technological thinking usually justifies an acceptable model od epistemic attitudes by means of various measures based on the scheme of decreasing uncertainty or, as it is typical for information models, by means of decreasing entropy level. (shrink)

The thesis includes six essays, each corresponding to a chapter, which have the target of widening the discussion on the limits of knowability through the consideration of some general problematics and the discussion of specific topics. The work is composed of two parts, each of three chapters. In the first part, the discussion is focused on a perspective proper of the philosophy of language. In particular, I consider the discussion on the limits of knowability from the point of view of (...) the debate between semantic realism and antirealism. The second part of the thesis is focused on the discussion on the limits of knowability from a perspective more strictly epistemological and proper of the philosophy of science. (shrink)

Dynamic epistemic logic describes the possible information-changing actions available to individual agents, and their knowledge pre-and post conditions. For example, public announcement logic describes actions in the form of public, truthful announcements. However, little research so far has considered describing and analysing rational choice between such actions, i.e., predicting what rational self-interested agents actually will or should do. Since the outcome of information exchange ultimately depends on the actions chosen by all the agents in the system, and assuming that agents (...) have preferences over such outcomes, this is a game theoretic scenario. This is, in our opinion, an interesting general research direction, combining logic and game theory in the study of rational information exchange. In this article we take some first steps in this direction: we consider the case where available actions are public announcements, and where each agent has a (typically epistemic) goal formula that she would like to become true. What will each agent announce? The truth of the goal formula also depends on the announcements made by other agents. We analyse such public announcement games. (shrink)

We propose a dynamic logic of lying, wherein a ‘lie that $\varphi $ ’ (where $\varphi $ is a formula in the logic) is an action in the sense of dynamic modal logic, that is interpreted as a state transformer relative to the formula $\varphi $ . The states that are being transformed are pointed Kripke models encoding the uncertainty of agents about their beliefs. Lies can be about factual propositions but also about modal formulas, such as the beliefs of (...) other agents or the belief consequences of the lies of other agents. We distinguish two speaker perspectives: (Obs) an outside observer who is lying to an agent that is modelled in the system, and (Ag) an agent who is lying to another agent, and where both are modelled in the system. We distinguish three addressee perspectives: (Cred) the credulous agent who believes everything that it is told (even at the price of inconsistency), (Skep) the skeptical agent who only believes what it is told if that is consistent with its current beliefs, and (Rev) the belief revising agent who believes everything that it is told by consistently revising its current, possibly conflicting, beliefs. The logics have complete axiomatizations, which can most elegantly be shown by way of their embedding in what is known as action model logic or in the extension of that logic to belief revision. (shrink)

Dylan Dodd offers a simple, yet forceful, argument for infallibilism. The argument relies upon two assumptions concerning the relationship between knowledge, epistemic possibility, and epistemic probability. We argue below that by endorsing a particular conception of epistemic possibility, a fallibilist can both plausibly reject one of Dodd’s assumptions and mirror the infallibilist’s explanation of the linguistic data. In fact, such a fallibilist may even be able to offer a more comprehensive explanation than the infallibilist. Our discussion is of interest due (...) in part to the fact that many fallibilists have rejected the conception of epistemic possibility employed in our response to Dodd. (shrink)

Epistemic transparency tells us that, if an agent S knows a given proposition p , then S knows that she knows that p . This idea is usually encoded in the so-called KK principle of epistemic logic. The paper develops an argument in favor of a moderate version of KK , which I dub quasi-transparency , as a normative rather than a descriptive principle. In the second Section I put forward the suggestion that epistemic transparency is not a demand of (...) ideal rationality, but of ideal epistemic responsibility, and hence that ideally responsible agents verify transparency principles of some sort; I also contend that their satisfaction should not be tied to an internalist epistemology. The central argument in favor of transparency is then addressed in Sections 3 to 8, through the development of a formal system. I show that, in a well-behaved formal setting, a moderate version of transparency is imposed upon us as a result of a number of independent decisions on the structure of higher-order probabilities, as long as we request that our probability and knowledge attributions cohere with each other. Thus I give a rationale to build a model for a hierarchy of languages with different levels of knowledge and probability operators; we obtain an analogous to KK for successive knowledge operators without actually demanding transitivity. The formal argument reinforces the philosophical intuition that epistemic transparency is an important desideratum we should not be too ready to dismiss. (shrink)

Fitch showed that not every true proposition can be known in due time; in other words, that not every proposition is knowable. Moore showed that certain propositions cannot be consistently believed. A more recent dynamic phrasing of Moore-sentences is that not all propositions are known after their announcement, i.e., not every proposition is successful. Fitch's and Moore's results are related, as they equally apply to standard notions of knowledge and belief (S 5 and KD45, respectively). If we interpret ‘successful’ as (...) ‘known after its announcement’ and ‘knowable’ as ‘known after some announcement’, successful implies knowable. Knowable does not imply successful: there is a proposition ϕ that is not known after its announcement but there is another announcement after which ϕ is known. We show that all propositions are knowable in the more general sense that for each proposition, it can become known or its negation can become known. We can get to know whether it is true: ◊(Kϕ ∨ K¬ϕ). This result comes at a price. We cannot get to know whether the proposition was true. This restricts the philosophical relevance of interpreting ‘knowable’ as ‘known after an announcement’. (shrink)

is used to give a formalization of Artemov’s knowledge based reasoning approach to game theory, (KBR), [ 4 , 5 ]. Epistemic states of players are represented explicitly and reasoned about formally. We give a detailed analysis of the Centipede game using both proof theoretic and semantic machinery. This helps make the case that PDL + E can be a useful basis for the logical investigation of game theory.

We discuss presupposition, the phenomenon whereby speakers mark linguistically the information that is presupposed or taken for granted, rather than being part of the main propositional content of a speech act. Expressions and constructions carrying presuppositions are called “presupposition triggers”, forming a large class including definites and factive verbs. The article first introduces the range of triggers, the basic properties of presuppositions such as projection and cancellability, and the diagnostic tests used to identify them. The reader is then introducedto major (...) models of presupposition from the last 50 years, separated into three classes: Frege-Strawson derived semantic models, pragmaticmodels such as that offered by Stalnaker, and dynamic models. Finallywe discuss some of the main current issues in presupposition theory. These involve accommodation, which occurs when a hearer's knowledge state is adjusted to meet the speaker's presuppositions; presupposition failure, which occurs when a presupposition is false; the interaction between presuppositions and attitudes; and the triggering problem, i.e., the problem of explaining why presuppositions occur in the first place. (shrink)

The principle of belief persistence, or conservativity principle, states that ’\Nhen changing beliefs in response to new evidence, you should continue to believe as many of the old beliefs as possible' (Harman, 1986, p. 46). In particular, this means that if an individual gets new information, she has to accommodate it in her new belief set (the set of propositions she believes), and, if the new information is not inconsistent with the old belief set, then (1) the individual has to (...) maintain all the beliefs she previously had and (2) the change should be minimal in the sense that every proposition in the new belief set must be deducible from the union of the old belief set and the new information (see, e.g., Gardenfors, 1988; Stalnaker, 1984). We focus on this minimal notion of belief persistence and characterize it both semantically and syntactically. A ’possible world' semantic formalization of the principle easily comes to mind. The set of all the propositions that the individual believes corresponds to the set of states of the world that she considers possible and is a subset of the set of states that are not ruled out by the individual's information (or knowledge). It is required that, if the individual considers a state possible and her new information does not exclude this state, then she continue to consider it possible. Furthermore, if the individual regards a particular state as impossible, then she should continue to regard it as impossible unless her new information excludes all the states that she previously regarded as possible. This is closely related to the.. (shrink)

Epistemology is the study of knowledge and justified belief. Belief is thus central to epistemology. It comes in a qualitative form, as when Sophia believes that Vienna is the capital of Austria, and a quantitative form, as when Sophia's degree of belief that Vienna is the capital of Austria is at least twice her degree of belief that tomorrow it will be sunny in Vienna. Formal epistemology, as opposed to mainstream epistemology (Hendricks 2006), is epistemology done in a formal way, (...) that is, by employing tools from logic and mathematics. The goal of this entry is to give the reader an overview of the formal tools available to epistemologists for the representation of belief. A particular focus will be the relation between formal representations of qualitative belief and formal representations of quantitative degrees of belief. (shrink)

The situation calculus is one of the most established formalisms for reasoning about action and change. In this paper we will review the basics of Reiter’s version of the situation calculus, show how knowledge and time have been addressed in this framework, and point to some of the weaknesses of the situation calculus with respect to time. We then present a modal version of the situation calculus where these problems can be overcome with relative ease and without sacrificing the advantages (...) of the original. (shrink)

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)

The Knower Paradox has had a brief but eventful history, and principles of epistemic closure (which say that a subject automatically knows any proposition she knows to be materially implied, or logically entailed, by a proposition she already knows) have been the subject of tremendous debate in epistemic logic and epistemology more generally, especially because the fate of standard arguments for and against skepticism seems to turn on the fate of closure. As far as I can tell, however, no one (...) working in either area has emphasized the result I emphasize in this paper: the Knower Paradox just falsifies even the most widely accepted general principles of epistemic closure. After establishing that result, I discuss five of its more important consequences. (shrink)

Evidence is presented to show that the role of a generative grammar of a natural language is not merely to generate the grammatical sentences of that language, but also to relate them to their logical forms. The notion of logical form is to be made sense of in terms a natural logic, a logical for natural language, whose goals are to express all concepts capable of being expressed in natural language, to characterize all the valid inferences that can be made (...) in natural language, and to mesh with adequate linguistic descriptions of all natural languages. The latter requirement imposes empirical linguistic constraints on natural logic. A number of examples are discussed. (shrink)

In this paper we will show that Hempel's covering law model can't deal very well with explanations that are based on incomplete knowledge. In particular the symmetry thesis, which is an important aspect of the covering law model, turns out to be problematic for these explanations. We will discuss an example of an electric circuit, which clearly indicates that the symmetry of explanation and prediction does not always hold. It will be argued that an alternative logic for causal explanation is (...) needed. And we will investigate to what extent non-monotonic epistemic logic can provide such an alternative logical framework. Finally we will show that our non-monotonic logical analysis of explanation is not only suitable for simple cases such as the electric circuit, but that it also sheds new light on more controversial causal explanations such as Milton Friedman's explanation of the business cycle. (shrink)

In discussion of the "Principle of Identity" in the Treatise Hume presents a puzzle about identity - not a puzzle for semantics, like Frege's, but a puzzle for a theory of representation. In this essay I am less concerned with issues of Hume interpretation and more concerned with the puzzle itself.

Konolige''s technical notion of belief based on deduction structures is briefly reviewed and its usefulness for the design of artificial agents with limited representational and deductive capacities is pointed out. The design of artificial agents with more sophisticated representational and deductive capacities is then taken into account. Extended representational capacities require in the first place a solution to the intensional context problems. As an alternative to Konolige''s modal first-order language, an approach based on type-free property theory is proposed. It considers (...) often neglected issues, such as the need for a more general account of thede dicto-de re distinction, and quasi-indicators. Extended deductive capacities require a subdivision of Konolige''s notion of belief into two distinct technical notions,potential anddispositional belief. The former has to do with what an artificial agent could in principle come to actively believe, given enough time and its specific logical competence; the latter with what an agent can be assumed to believe with respect to a specific goal to be fulfilled. (shrink)

This paper provides a logic framework for investigations of game theoretical problems. We adopt an infinitary extension of classical predicate logic as the base logic of the framework. The reason for an infinitary extension is to express the common knowledge concept explicitly. Depending upon the choice of axioms on the knowledge operators, there is a hierarchy of logics. The limit case is an infinitary predicate extension of modal propositional logic KD4, and is of special interest in applications. In Part I, (...) we develop the basic framework, and show some applications: an epistemic axiomatization of Nash equilibrium and formal undecidability on the playability of a game. To show the formal undecidability, we use a term existence theorem, which will be proved in Part II. (shrink)

The paper highlights a certain kind of self-falsifying utterance, which I shall call antiperformative assertions, not noted in speech-act theory thus far. By taking such assertions into account, the old question whether explicit performatives have a truth-value can be resolved. I shall show that explicit performatives are in fact self-verifyingly true, but they are not related to propositions the way ordinary assertions are; antiperformatives have the same unusual relation to propositions, but are self-falsifyingly false. Explicit performatives are speech acts performed (...) in situations where it is important that the speaker is self-reflectively aware of what he is doing in the speech act. Antiperformatives, on the other hand, are speech acts performed in situations where lack of direct self-reflectiveness is required. In order to situate performatives and antiperformatives, the analysis is embedded within a more general discussion of self-falsifying and self-verifying assertions. (shrink)

We define cut-free display calculi for knowledge logics wherean indiscernibility relation is associated to each set of agents, andwhere agents decide the membership of objects using thisindiscernibility relation. To do so, we first translate the knowledgelogics into polymodal logics axiomatised by primitive axioms and thenuse Kracht's results on properly displayable logics to define thedisplay calculi. Apart from these technical results, we argue thatDisplay Logic is a natural framework to define cut-free calculi for manyother logics with relative accessibility relations.

We study a knowledge logic that assumes that to each set of agents, an indiscernibility relation is associated and the agents decide the membership of objects or states up to this indiscernibility relation. Its language contains a family of relative knowledge operators. We prove the decidability of the satisfiability problem, we show its EXPTIME-completeness and as a side-effect, we define a complete Hilbert-style axiomatization.

Since belief revision deals with the interaction of belief and information over time, branching-time temporal logic seems a natural setting for a theory of belief change. We propose two extensions of a modal logic that, besides the next-time temporal operator, contains a belief operator and an information operator. The first logic is shown to provide an axiomatic characterization of the first six postulates of the AGM theory of belief revision, while the second, stronger, logic provides an axiomatic characterization of the (...) full set of AGM postulates. © 2006 Elsevier B.V. All rights reserved. (shrink)

Justified belief is a core concept in epistemology and there has been an increasing interest in its logic over the last years. While many logical investigations consider justified belief as an operator, in this paper, we propose a logic for justified belief in which the relevant notion is treated as a predicate instead. Although this gives rise to the possibility of liar-like paradoxes, a predicate treatment allows for a rich and highly expressive framework, which lives up to the universal ambitions (...) of investigating epistemological concepts. We start with a base theory for justified belief, and then systematically present putative additional axioms for justified belief. We provide an overview of consistency results when the additional principles are added to the base theory, and discuss their philosophical plausibility. (shrink)

La lógica de la conciencia es una extensión de la lógica epistémica que solventa el problema de la omnisciencia lógica incorporando un operador de conciencia para separar el conocimiento explícito del implícito. Este informe recopila los principales textos tanto de los orígenes de esta lógica, así como de sus desarrollos en las últimas tres décadas. En concreto analiza los enfoques desde la lógica epistémica dinámica, desde su combinación con otras lógicas y los enfoques de teoría de juegos.

In this paper, I develop and defend a novel account of Moore’s paradox, which locates its source in self-reference. The main insight comes from Gareth Evans’s discussion of Transparency, which says that a normal person takes p to be directly relevant to the truth of “I believe that p.” It has been noticed by many philosophers that Moore’s paradox is closely related to Evans’s Transparency. However, Evans’s claim that Transparency is constitutively related to self-reference has received relatively little attention from (...) those philosophers. I claim that once we get the two links straight and join them, a novel and plausible account of Moore’s paradox emerges. According to this account, the absurdity involved in Moore’s paradox is traceable to a constitutive relation between Transparency and self-reference. Asserting “p but I do not believe that p” sounds absurd, because the use of “I” indicates that the subject thinks of the individual referred to as herself, while her failing to conform to Transparency implies the opposite. (shrink)

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

Jaakko Hintikka points out the power of Skolem functions to affect both what there is and what we know. There is a tension in his presupposition that these functions actually extend the realm of logic. He claims to have resolved the tension by “reconstructing constructivism” along epistemological lines, instead of by a typical ontological construction; however, after the collapse of the distinction between first and second order, that resolution is not entirely satisfactory. Still, it does throw light on the conceptual (...) analysis Hintikka proposes. (shrink)

This paper defends Lewis’ influential treatment of de se attitudes from recent criticism to the effect that a key explanatory notion—self-ascription—goes unexplained. It is shown that Lewis’ treatment can be reconstructed in a way which provides clear responses. This sheds light on the explanatory ambitions of those engaged in Lewis’ project.