This handbook article gives a critical overview of recent discussions of epistemic authority. It favors an account that brings into balance the dictates of rational deference with the ideals of intellectual self-governance. A plausible starting point is the conjecture that neither should rational deference to authorities collapse into total epistemic submission, nor the ideal of mature intellectual self-governance be conflated with (illusions of) epistemic autarky.

One of the key tenets of Linda Zagzebski’s book " Epistemic Authority" is the Preemption Thesis. It says that, when an agent learns that an epistemic authority believes that p, the rational response for her is to adopt that belief and to replace all of her previous reasons relevant to whether p by the reason that the authority believes that p. I argue that such a “Hobbesian approach” to epistemic authority yields problematic results. This becomes especially virulent when we apply (...) Preemption to cases in which the agent and the authority share their belief, maybe even for the same reasons, or in which both have either a positive or a negative graded doxastic attitude toward a given proposition. As an alternative I propose a “Socratic account”, according to which the authority will not only motivate us to adopt her belief, but also provide us with higher-order reasons for re-assigning our own considerations their proper place in the web of reasons for and against the view in question. (shrink)

We discuss the social-epistemic aspects of Catherine Elgin’s theory of reflective equilibrium and understanding and argue that it yields an argument for the view that a crucial social-epistemic function of epistemic authorities is to foster understanding in their communities. We explore the competences that enable epistemic authorities to fulfil this role and argue that among them is an epistemic virtue we call “epistemic empathy”.

I raise two objections against Christian List and Peter Menzies' influential account of high-level causation. Improving upon some of Stephen Yablo's earlier work, I develop an alternative theory which evades both objections. The discussion calls into question List and Menzies' main contention, namely, that the exclusion principle, applied to difference-making, is false.

This paper explores the phenomenon of meta-emotions. Meta-emotions are emotions people have about their own emotions. We analyze the intentional structure of meta-emotions and show how psychological findings support our account. Acknowledgement of meta-emotions can elucidate a number of important issues in the philosophy of mind and, more specifically, the philosophy and psychology of emotions. Among them are (allegedly) ambivalent or paradoxical emotions, emotional communication, emotional self-regulation, privileged access failure for repressed emotions, and survivor guilt.

Gärdenfors (Conceptual spaces, 2000) argues that the semantic domains that natural language deals with have a geometrical structure. He gives evidence that simple natural language adjectives usually denote natural properties, where a natural property is a convex region of such a “conceptual space.” In this paper I will show that this feature of natural categories need not be stipulated as basic. In fact, it can be shown to be the result of evolutionary dynamics of communicative strategies under very general assumptions.

There are many psychic mechanisms by which people engage with their selves. We argue that an important yet hitherto neglected one is self-appraisal via meta-emotions. We discuss the intentional structure of meta-emotions and explore the phenomenology of a variety of examples. We then present a pilot study providing preliminary evidence that some facial displays may indicate the presence of meta-emotions. We conclude by arguing that meta-emotions have an important role to play in higher-order theories of psychic harmony.

This paper is mainly concerned with proof-theoretic analysis of some second-order systems of explicit mathematics with a non-constructive minimum operator. By introducing axioms for variable types we extend our first-order theory BON to the elementary explicit type theory EET and add several forms of induction as well as axioms for μ. The principal results then state: EET plus set induction is proof-theoretically equivalent to Peano arithmetic PA <0).

An epistemic agent A is a false epistemic authority for others iff they falsely believe A to be in a position to help them accomplish their epistemic ends. A major divide exists between what I call "epistemic quacks", who falsely believe themselves to be relevantly competent, and "epistemic charlatans", i.e., false authorities who believe or even know that they are incompetent. Both types of false authority do not cover what Lackey (2021) calls "predatory experts": experts who systematically misuse their social-epistemic (...) status as a cover for predatory behavior. Qua experts, predatory experts are competent and thus could (and maybe sometimes do) help their clients. But should we count them as genuine epistemic authorities? No, I argue, they are false epistemic authorities because, in addition to their practical and moral misconduct, such experts systematically deceive their clients, thereby thwarting the clients’ epistemic ends. (shrink)

Feferman, S. and G. Jäger, Systems of explicit mathematics with non-constructive μ-operator. Part I, Annals of Pure and Applied Logic 65 243-263. This paper is mainly concerned with the proof-theoretic analysis of systems of explicit mathematics with a non-constructive minimum operator. We start off from a basic theory BON of operators and numbers and add some principles of set and formula induction on the natural numbers as well as axioms for μ. The principal results then state: BON plus set induction (...) is proof-theoretically equivalent to Peano arithmetic PA; BON plus formula induction is proof-theoretically equivalent to the system <0 of second-order arithmetic. (shrink)

Two classes of account have been proposed to explain the memory processes subserving the processing of reflexive-antecedent dependencies. Structure-based accounts assume that the retrieval of the antecedent is guided by syntactic tree-configurational information without considering other kinds of information such as gender marking in the case of English reflexives. By contrast, unconstrained cue-based retrieval assumes that all available information is used for retrieving the antecedent. Similarity-based interference effects from structurally illicit distractors which match a non-structural retrieval cue have been interpreted (...) as evidence favoring the unconstrained cue-based retrieval account since cue-based retrieval interference from structurally illicit distractors is incompatible with the structure-based account. However, it has been argued that the observed effects do not necessarily reflect interference occurring at the moment of retrieval but might equally well be accounted for by interference occurring already at the stage of encoding or maintaining the antecedent in memory, in which case they cannot be taken as evidence against the structure-based account. We present three experiments (self-paced reading and eye-tracking) on German reflexives and Swedish reflexive and pronominal possessives in which we pit the predictions of encoding interference and cue-based retrieval interference against each other. We could not find any indication that encoding interference affects the processing ease of the reflexive-antecedent dependency formation. Thus, there is no evidence that encoding interference might be the explanation for the interference effects observed in previous work. We therefore conclude that invoking encoding interference may not be a plausible way to reconcile interference effects with a structure-based account of reflexive processing. (shrink)

This article provides the proof-theoretic analysis of the transfinitely iterated fixed point theories $\widehat{ID}_\alpha and \widehat{ID}_{ the exact proof-theoretic ordinals of these systems are presented.

First published in 2002. Routledge is an imprint of Taylor & Francis, an informa company.

In this article we discuss the notion of a linguistic universal, and possible sources of such invariant properties of natural languages. In the first part, we explore the conceptual issues that arise. In the second part of the paper, we focus on the explanatory potential of horizontal evolution. We particularly focus on two case studies, concerning Zipf's Law and universal properties of color terms, respectively. We show how computer simulations can be employed to study the large scale, emergent, consequences of (...) psychologically and psychologically motivated assumptions about the working of horizontal language transmission. (shrink)

Jäger, G., Fixed points in Peano arithmetic with ordinals, Annals of Pure and Applied Logic 60 119-132. This paper deals with some proof-theoretic aspects of fixed point theories over Peano arithmetic with ordinals. It studies three such theories which differ in the principles which are available for induction on the natural numbers and ordinals. The main result states that there is a natural theory in this framework which is a conservative extension of Peano arithmeti.

According to Fred Dretske's externalist theory of knowledge a subject knows that p if and only if she believes that p and this belief is caused or causally sustained by the information that p. Another famous feature of Dretske's epistemology is his denial that knowledge is closed under known entailment. I argue that, given Dretske's construal of information, he is in fact committed to the view that both information and knowledge are closed under known entailment. Hence, if it is true (...) that, as Dretske also believes, accepting closure leads to skepticism, he must either embrace skepticism or abandon his information theory of knowledge. (shrink)

Keith DeRose has argued that ‘the knowledge account of assertion – according to which what one is in a position to assert is what one knows – ... provides a ... powerful positive argument in favor of contextualism’ (2009: 80). The truth is that it yields a powerful argument against contextualism, at least against its most popular, anti-sceptical versions. The following argument shows that, if we conjoin (such versions of) epistemic contextualism with an appropriate meta-linguistic formulation of the knowledge account (...) of assertion, contextualism cannot coherently be stated. (shrink)

In this article we discuss the notion of a linguistic universal, and possible sources of such invariant properties of natural languages. In the first part, we explore the conceptual issues that arise. In the second part of the paper, we focus on the explanatory potential of horizontal evolution. We particularly focus on two case studies, concerning Zipf’s Law and universal properties of color terms, respectively. We show how computer simulations can be employed to study the large scale, emergent, consequences of (...) psychologically and psychologically motivated assumptions about the working of horizontal language transmission. (shrink)

In this article we study several reduction principles in the context of Simpson’s set theory ATR0S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ATR_{0}^{S}$$\end{document} and Kripke-Platek set theory KP (with infinity). Since ATR0S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ATR_{0}^{S}$$\end{document} is the set-theoretic version of ATR0 there is a direct link to second order arithmetic and the results for reductions over ATR0S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ATR_{0}^{S}$$\end{document} are as expected and more or less (...) straightforward. However, over KP we obtain several interesting new results and are lead to some open questions. (shrink)

In this article we introduce systems for metapredicative Mahlo in explicit mathematics and admissible set theory. The exact upper proof-theoretic bounds of these systems are established.

We reopen the investigation into the formal and conceptual relationship between bidirectional optimality theory (Blutner in J Semant 15(2):115–162, 1998 , J Semant 17(3):189–216, 2000 ) and game theory. Unlike a likeminded previous endeavor by Dekker and van Rooij (J Semant 17:217–242, 2000 ), we consider signaling games not strategic games, and seek to ground bidirectional optimization once in a model of rational step-by-step reasoning and once in a model of reinforcement learning. We give sufficient conditions for equivalence of bidirectional (...) optimality and the former, and show based on numerical simulations that bidirectional optimization may be thought of as a process of reinforcement learning with lateral inhibition. (shrink)

We study and some of its most important extensions primarily from a proof-theoretic perspective, determine their consistency strengths by exhibiting equivalent systems in the realm of traditional set theory and introduce a new and interesting extension of which is conservative over.

An important finding of the game theoretic research on signaling games is the insight that under many circumstances, a signal obtains credibility by incurring costs to the sender. Therefore it seems questionable whether or not cheap talk—signals that are not payoff relevant—can serve to transmit information among rational agents. This issue is non-trivial in strategic interactions where the preferences of the players are not aligned. Researchers like Crawford & Sobel, Rabin, and Farrell demonstrated, however, that even in the case of (...) partially divergent interests, cheap talk may be informative. They assume that signals have an exogenously given meaning that is common knowledge between the players, and they explore the conditions under which such a signal is credible. This discussion has obvious relevance to the program of Gricean pragmatics in linguistics. According to Grice’s "Cooperative Principle”, this research tradition only considers scenarios where the interests of the players are aligned. Nevertheless, the assumption of differential signaling costs introduces an element of non-aligned interests. The present paper proposes a framework that combines these two research strands. Using an inference protocol of iterated best response, it gives a recipe for how the interlocutors derive rationalizable strategies from exogeneously given "literal” meanings of signals. No special assumptions about the alignment of interests or signaling costs are made. After introducing the formal model, the paper sketches several applications of this model to problems in linguistic pragmatics, like scalar implicatures, the division of pragmatic labor, and the interpretation of measure terms. (shrink)

In this paper we study applicative theories of operations and numbers with the non-constructive minimum operator in the context of a total application operation. We determine the proof-theoretic strength of such theories by relating them to well-known systems like Peano Arithmetic PA and the system <0 of second order arithmetic. Essential use will be made of so-called fixed-point theories with ordinals, certain infinitary term models and Church-Rosser properties.

In this paper we discuss extensions of Feferman's theory T 0 for explicit mathematics by the so-called limit and Mahlo axioms and present a novel approach to constructing natural recursion-theoretic models for systems of explicit mathematics which is based on nonmonotone inductive definitions.

In ‘A reductio of coherentism’ (Analysis 67, 2007) Tom Stoneham offers a novel argument against epistemological coherentism. ‘On the face of it’, he writes, ‘the argument gives a conclusive reductio ad absurdum of any coherence theory of justification. But that cannot be right, can it?’ (p. 254). It could be right, but it isn’t. I argue that coherentists need not accept the central premises of Stoneham’s argument and that, even if these premises were acceptable and true, Stoneham’s reductio would not (...) follow. (shrink)

This article provides the proof-theoretic analysis of the transfinitely iterated fixed point theories $\widehat{ID}_\alpha and \widehat{ID}_{<\alpha};$ the exact proof-theoretic ordinals of these systems are presented.

We study the extension of Feferman’s operational set theory provided by adding operational versions of unbounded existential quantification and power set and determine its proof-theoretic strength in terms of a suitable theory of sets and classes.

Goldman and Olsson ( 2009 ) have responded to the common charge that reliabilist theories of knowledge are incapable of accounting for the value knowledge has beyond mere true belief. We examine their “conditional probability solution” in detail, and show that it does not succeed. The conditional probability relation is too weak to support instrumental value, and the specific relation they describe is inessential to the value of knowledge. At best, they have described conditions in which knowledge indicates that additional (...) epistemic value is likely to be forthcoming in the future. We also argue that their motive analogy breaks down. The problem, we conclude, is that being produced by a reliable process is not sufficient for a belief to be justified. (shrink)

In this paper, we discuss some formal properties of the model ofbidirectional Optimality Theory that was developed inBlutner (2000). We investigate the conditions under whichbidirectional optimization is a well-defined notion, and we give aconceptually simpler reformulation of Blutner's definition. In thesecond part of the paper, we show that bidirectional optimization can bemodeled by means of finite state techniques. There we rely heavily onthe related work of Frank and Satta (1998) about unidirectionaloptimization.

This paper deals with universes in explicit mathematics. After introducing some basic definitions, the limit axiom and possible ordering principles for universes are discussed. Later, we turn to least universes, strictness and name induction. Special emphasis is put on theories for explicit mathematics with universes which are proof-theoretically equivalent to Feferman's.

The notions of common knowledge or common belief play an important role in several areas of computer science , in philosophy, game theory, artificial intelligence, psychology and many other fields which deal with the interaction within a group of “agents”, agreement or coordinated actions. In the following we will present several deductive systems for common knowledge above epistemic logics –such as K, T, S4 and S5 –with a fixed number of agents. We focus on structural and proof-theoretic properties of these (...) calculi. (shrink)

This paper deals with some structural properties of the sequent calculus and describes strong symmetries between cut-free derivations and derivations, which do not make use of identity axioms. Both of them are discussed from a semantic and syntactic point of view. Identity axioms and cuts are closely related to the treatment of negation in the sequent calculus, so the results of this article explain some nice symmetries of negation.

In this paper we establish the proof-theoretic equivalence of (i) $\hbox {\sf ATR}$ and $\widehat{\hbox{\sf ID}}_{\omega}$ , (ii) $\hbox{\sf ATR}_0+ (\Sigma^1_1-\hbox{\sf DC})$ and $\widehat{\hbox {\sf ID}}_{<\omega^\omega} , and (iii) $\hbox {\sf ATR}+(\Sigma^1_1-\hbox{\sf DC})$ and $\widehat{\hbox {\sf ID}}_{<\varepsilon_0} $.

The article presents proofs of the context freeness of a family of typelogical grammars, namely all grammars that are based on a uni- ormultimodal logic of pure residuation, possibly enriched with thestructural rules of Permutation and Expansion for binary modes.

According to one of the most influential views in the philosophy of self-knowledge each person enjoys some special cognitive access to his or her own current mental states and episodes. This view faces two fundamental tasks. First, it must elucidate the general conceptual structure of apparent asymmetries between beliefs about one’s own mind and beliefs about other minds. Second, it must demarcate the mental territory for which first-person-special-access claims can plausibly be maintained. Traditional candidates include sensations, experiences (of various kinds), (...) thoughts, beliefs, desires, and also affective states such as emotions. I reconstruct five prominent privileged access claims that have traditionally been maintained for emotions and discuss logical relations among them. I then argue that none of these claims stands up to scrutiny. The truth is that we often suffer from affective ignorance, and that third-person ascriptions of emotional states should often be credited with more rather than less authority than corresponding self-ascriptions. I conclude by considering, and rejecting, five potential objections to my argument. (shrink)

We discuss several ontological properties of explicit mathematics and operational set theory: global choice, decidable classes, totality and extensionality of operations, function spaces, class and set formation via formulas that contain the definedness predicate and applications.