In recent discussions in this journal, Moti Mizrahi defends the claim that knowledge equals epistemic certainty. Howard Sankey finds Mizrahi’s argument to be problematic, since, as he reads it, this would entail that justification must guarantee truth. In this article, I suggest that an account of the normativity of justification is able to bridge the gap between Mizrahi’s proposal and Sankey’s objections.

In this paper, we propose a unified account of conditionals inspired by Frank Ramsey. Most contemporary philosophers agree that Ramsey’s account applies to indicative conditionals only. We observe against this orthodoxy that his account covers subjunctive conditionals as well—including counterfactuals. In light of this observation, we argue that Ramsey’s account of conditionals resembles Robert Stalnaker’s possible worlds semantics supplemented by a model of belief. The resemblance suggests to reinterpret the notion of conditional degree of belief in order to overcome a (...) tension in Ramsey’s account. The result of the reinterpretation is a tenable account of conditionals that covers indicative and subjunctive as well as qualitative and probabilistic conditionals. (shrink)

Default logic has been a very active research topic in artificial intelligence since the early 1980s, but has not received as much attention in the philosophical literature thus far. This paper shows one way in which the technical tools of artificial intelligence can be applied in contemporary epistemology by modeling a paradigmatic case of deep disagreement using default logic. In §1 model-building viewed as a kind of philosophical progress is briefly motivated, while §2 introduces the case of deep disagreement we (...) aim to model. On the heels of this, §3 defines our formal framework, viz., a refined Horty-style default logic. §4 then uses the framework to model deep disagreement, and finally §5 provides a critical discussion of the result. (shrink)

Hyperintensionality – the failure of substitutivity salva veritate of intensionally equivalent expressions – is one of the most debated topics in recent philosophy of language. Being a phenomenon that affects a wide variety of different sentential contexts, a question concerning its source arises: is hyperintensionality something that can originate from actual features of the world, or it is simply some kind of representational phenomenon, which entirely depends on our conceptual faculties and preferred semantics? After a brief general introduction to the (...) topic from the semantic standpoint, in the present work I defend a view developed by Daniel Nolan, according to which hyperintensionality can be a worldly, non-representational phenomenon. I first reconstruct Nolan’s view and argument for worldly hyperintensionality, understood through the comparison with de re intensional modality. Then, I address the main criticism that has been raised against it, developing three objections. Evidence for worldly hyperintensionality is thereby presented, by focusing on a paradigmatic trigger: counterpossible conditionals. I provide two jointly sufficient criteria for a counterpossible to be a genuine instance of worldly hyperintensionality, then illustrate three case studies from scientific practices that all rely on counterpossible reasoning: reducibility in relative computability theory; scientific explanation of certain substances’ essential properties; and emergent molecular structure in chemistry. Each of them is evaluated by checking if it satisfies the criteria for worldly hyperintensionality, leading to the detection of patterns of counterpossible dependence occurring in at least some specific instances of the case studies discussed. Finally, I suggest a possible realist reading of such dependence relation, locating its relata in the world, independently from our representations. (shrink)

Technologies that deploy data science methods are liable to result in epistemic harms involving the diminution of individuals with respect to their standing as knowers or their credibility as sources of testimony. Not all harms of this kind are unjust but when they are we ought to try to prevent or correct them. Epistemically unjust harms will typically intersect with other more familiar and well-studied kinds of harm that result from the design, development, and use of data science technologies. However, (...) we argue that epistemic injustices can be distinguished conceptually from more familiar kinds of harm. We argue that epistemic harms are morally relevant even in cases where those who suffer them are unharmed in other ways. Via a series of examples from the criminal justice system, workplace hierarchies, and educational contexts we explain the kinds of epistemic injustice that can result from common uses of data science technologies. (shrink)

This paper contains a critical examination of the prospects for analyses of knowledge that weaken the factivity condition such that knowledge implies approximate truth.

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

Modeling a complex phenomena such as the mind presents tremendous computational complexity challenges. Modeling field theory (MFT) addresses these challenges in a non-traditional way. The main idea behind MFT is to match levels of uncertainty of the model (also, a problem or some theory) with levels of uncertainty of the evaluation criterion used to identify that model. When a model becomes more certain, then the evaluation criterion is adjusted dynamically to match that change to the model. This process is called (...) the Dynamic Logic of Phenomena (DLP) for model construction and it mimics processes of the mind and natural evolution. This paper provides a formal description of DLP by specifying its syntax, semantics, and reasoning system. We also outline links between DLP and other logical approaches. Computational complexity issues that motivate this work are presented using an example of polynomial models. (shrink)

Modelling a complex phenomenon such as the mind presents tremendous computational complexity challenges. Modelling field theory addresses these challenges in a non-traditional way. The main idea behind MFT is to match levels of uncertainty of the model with levels of uncertainty of the evaluation criterion used to identify that model. When a model becomes more certain, then the evaluation criterion is adjusted dynamically to match that change to the model. This process is called the Dynamic Logic of Phenomena for model (...) construction and it mimics processes of the mind and natural evolution. This paper provides a formal description of DLP by specifying its syntax, semantics, and reasoning system. We also outline links between DLP and other logical approaches. Computational complexity issues that motivate this work are presented using an example of polynomial models. (shrink)

Epistemic logic begins with the recognition that our everyday talk about knowing and believing has some systematic features that we can track and re‡ect upon. Epistemic logicians have studied and extended these glints of systematic structure in fascinating and important ways since the early 1960s. However, for one reason or another, mainstream epistemologists have shown little interest. It is striking to contrast the marginal role of epistemic logic in contemporary epistemology with the centrality of modal logic for metaphysicians. This article (...) is intended to help in correcting this oversight by presenting some important developments in epistemic logic and suggesting ways to understand their applicability to traditional epistemological problems. Obviously, by itself, tweaking the formal apparatus of epistemic logic does not solve traditional epistemological problems. Epistemic logic can help us to navigate through problems in a systematic fashion by unpacking the logic of the problematic concepts, it can also lead us to recognize problems that we had not anticipated. This is basically analogous to the role that modal logic has played in contemporary metaphysics. (shrink)

The Dunning–Kruger effect focuses our attention on the notion of invisibility of ignorance, i.e., the ignorance of ignorance. Such a phenomenon is not only important for everyday life, but also, above all, for some philosophical disciplines, such as epistemology of sciences. When someone tries to understand formally the phenomenon of ignorance of ignorance, they usually end up with a nested epistemic operator highly resistant to proper regimentation. In this paper, we argue that to understand adequately the ignorance of ignorance phenomenon (...) we have to understand satisfactorily the concept of disbelief and, as we call it, the concept of “radical ignorance”. We propose also prerequisites that a notion of radical ignorance useful for the philosophy of science ought to fulfill, and we sketch a possible formalization of this notion. Finally, we propose some comments on the problem of propagation of ignorance proposed by Fine. (shrink)

Suppose that I hold a ticket in a fair lottery and that I believe that my ticket will lose [L] on the basis of its extremely high probability of losing. What is the appropriate epistemic appraisal of me and my belief that L? Am I justified in believing that L? Do I know that L? While there is disagreement among epistemologists over whether or not I am justified in believing that L, there is widespread agreement that I do not know (...) that L. I defend the two-pronged view that I am justified in believing that my ticket will lose and that I know that it will lose. Along the way, I discuss four different but related versions of the lottery paradox—The Paradox for Rationality, The Paradox for Knowledge, The Paradox for Fallibilism, and The Paradox for Epistemic Closure—and offer a unified resolution of each of them. (shrink)

Doxastic TheoriesThe application of formal tools to questions related to epistemology is of course not at all new. However, there has been a surge of interest in the field now known as “formal epistemology” over the past decade, with two annual conference series and an annual summer school at Carnegie Mellon University, in addition to many one-off events devoted to the field. A glance at the programs of these series illustrates the wide-ranging set of topics that have been grouped under (...) this name, ranging from rational choice theory and the foundations of statistics, to logics of knowledge and formal measures of coherence, with much more besides.In this paper I will ignore most of these topics, and just trace some parts of the history of two ideas about belief whose current interaction may lead to future progress. One idea is the idea of belief, disbelief, and suspension of judgment as a meaningful tripartite dis .. (shrink)

Trying to overcome Dugundji’s result on uncharacterisability of modal logics by finite logical matrices, Kearns and Ivlev proposed, independently, a characterisation of some modal systems by means of four-valued multivalued truth-functions , as an alternative to Kripke semantics. This constitutes an antecedent of the non-deterministic matrices introduced by Avron and Lev . In this paper we propose a reconstruction of Kearns’s and Ivlev’s results in a uniform way, obtaining an extension to another modal systems. The first part of the paper (...) is devoted to four-valued Nmatrices, including Kearns’s and Ivlev’s. Besides proving with full details Kearns’s results for T, S4 and S5, we also obtain a characterisation of the system B by four-valued Nmatrices with level valuations. Concerning Ivlev’s results, two new modal systems are introduced and char.. (shrink)

Proceedings of the 2016 "one word" colloquium of the The Philosophical Society of Finland. The word was "Possibility".

A recent no-go theorem (Frauchiger and Renner in Nat Commun 9(1):3711, 2018) establishes a contradiction from a specific application of quantum theory to a multi- agent setting. The proof of this theorem relies heavily on notions such as ‘knows’ or ‘is certain that’. This has stimulated an analysis of the theorem by Nurgalieva and del Rio (in: Selinger P, Chiribella G (eds) Proceedings of the 15th international conference on quantum physics and logic (QPL 2018). EPTCS 287, Open Publishing Association, Waterloo, (...) 2018), in which they claim that it shows the “[i]nadequacy of modal logic in quantum settings” (ibid.). In this paper, we will offer a significantly extended and refined reconstruction of the theorem in multi-agent modal logic. We will then show that a thorough reconstruction of the proof as given by Frauchiger and Renner requires the reflexivity of access relations (system T). However, a stronger theorem is possible that already follows in serial frames, and hence also holds in systems of doxastic logic (such as KD45). After proving this, we will discuss the general implications for different interpretations of quantum probabilities as well as several options for dealing with the result. (shrink)

Possibilistic logic and modal logic are knowledge representation frameworks sharing some common features, such as the duality between possibility and necessity, and the decomposability of necessity for conjunctions, as well as some obvious differences since possibility theory is graded. At the semantic level, possibilistic logic relies on possibility distributions and modal logic on accessibility relations. In the last 30 years, there have been a series of attempts for bridging the two frameworks in one way or another. In this paper, we (...) compare the relational semantics of epistemic logics with simpler possibilistic semantics of a fragment of such logics that only uses modal formulas of depth 1. This minimal epistemic logic handles both all-or-nothing beliefs and explicitly ignored facts. We also contrast epistemic logic with the S5-based rough set logic. Finally, this paper presents extensions of generalized possibilistic logic with objective and non-nested multimodal formulas, in the style of modal logics KD45 and S5. (shrink)

While the epistemic significance of disagreement has been a popular topic in epistemology for at least a decade, little attention has been paid to logical disagreement. This monograph is meant as a remedy. The text starts with an extensive literature review of the epistemology of (peer) disagreement and sets the stage for an epistemological study of logical disagreement. The guiding thread for the rest of the work is then three distinct readings of the ambiguous term ‘logical disagreement’. Chapters 1 and (...) 2 focus on the Ad Hoc Reading according to which logical disagreements occur when two subjects take incompatible doxastic attitudes toward a specific proposition in or about logic. Chapter 2 presents a new counterexample to the widely discussed Uniqueness Thesis. Chapters 3 and 4 focus on the Theory Choice Reading of ‘logical disagreement’. According to this interpretation, logical disagreements occur at the level of entire logical theories rather than individual entailment-claims. Chapter 4 concerns a key question from the philosophy of logic, viz., how we have epistemic justification for claims about logical consequence. In Chapters 5 and 6 we turn to the Akrasia Reading. On this reading, logical disagreements occur when there is a mismatch between the deductive strength of one’s background logic and the logical theory one prefers (officially). Chapter 6 introduces logical akrasia by analogy to epistemic akrasia and presents a novel dilemma. Chapter 7 revisits the epistemology of peer disagreement and argues that the epistemic significance of central principles from the literature are at best deflated in the context of logical disagreement. The chapter also develops a simple formal model of deep disagreement in Default Logic, relating this to our general discussion of logical disagreement. The monograph ends in an epilogue with some reflections on the potential epistemic significance of convergence in logical theorizing. (shrink)

This paper generalizes the (epistemic) preface paradox beyond the principle of belief aggregation and constructs a similar paradox for deontic reasoning. The analysis of the deontic case yields a solution strategy---restricting belief/obligation aggregation rather than giving it up altogether---that can be transferred to the epistemic case. Our proposal amounts to a reasonable compromise between two goals: (i) sticking to bridge principles between evidence and belief, such as the Lockean Thesis, and (ii) obtaining a sufficiently strong logic of doxastic and deontic (...) reasoning. (shrink)

Reasoning about what other people know is an important cognitive ability, known as epistemic reasoning, which has fascinated psychologists, economists, and logicians. In this paper, we propose a computational model of humans’ epistemic reasoning, including higher-order epistemic reasoning—reasoning about what one person knows about another person’s knowledge—that we test in an experiment using a deductive card game called “Aces and Eights”. Our starting point is the model of perfect higher-order epistemic reasoners given by the framework of dynamic epistemic logic. We (...) modify this idealized model with bounds on the level of feasible epistemic reasoning and stochastic update of a player’s space of possibilities in response to new information. These modifications are crucial for explaining the variation in human performance across different participants and different games in the experiment. Our results demonstrate how research on epistemic logic and cognitive models can inform each other. (shrink)