Propositions such as are paradoxical, in that even though they can be true, they cannot be truly asserted or believed. This is Moore’s paradox. Sydney Shoemaker has recently ar- gued that the paradox arises from a constitutive relation that holds between first- and second-order beliefs. This paper explores this approach to the paradox. Although Shoemaker’s own account of the paradox is rejected, a different account along similar lines is endorsed. At the core of the endorsed account is the claim that (...) conscious beliefs are always partly about themselves; it will be shown to follow from this that conscious beliefs in Moorean propositions are self-contradictory. (shrink)

In this paper, I argue for a particular conception of impossible worlds. Possible worlds, as traditionally understood, can be used in the analysis of propositions, the content of belief, the truth of counterfactuals, and so on. Yet possible worlds are not capable of differentiating propositions that are necessarily equivalent, making sense of the beliefs of agents who are not ideally rational, or giving truth values to counterfactuals with necessarily false antecedents. The addition of impossible worlds addresses these issues. The kinds (...) of impossible worlds capable of performing this task are not mysterious sui generis entities, but sets of structured propositions that are themselves constructed out of possible worlds and relations. I also respond to a worry that these impossible worlds are unable to represent claims about the shape of modal space itself. (shrink)

The transition from form to meaning is not neatly layered: there is no point where form ends and content sets in. Rather, there is an almost continuous process that converts form into meaning. That process cannot always take a straight line. Very often we hit barriers in our mind, due to the inability to understand the exact content of the sentence just heard. The standard division between formula and interpretation (or value) should therefore be given up when talking about the (...) process of understanding. Interestingly, when we do this it turns out that there are 'easy' formulae, those we can understand without further help, and 'difficult' ones, which we cannot. (shrink)

In this paper I combine the dynamic epistemic logic ofGerbrandy (1999) with the probabilistic logic of Fagin and Halpern (1994). The resultis a new probabilistic dynamic epistemic logic, a logic for reasoning aboutprobability, information, and information change that takes higher orderinformation into account. Probabilistic epistemic models are defined, and away to build them for applications is given. Semantics and a proof systemis presented and a number of examples are discussed, including the MontyHall Dilemma.

Although the notion of common or mutual belief plays a crucial role in game theory, economics and social philosophy, no thoroughly representational account of it has yet been developed. In this paper, I propose two desiderata for such an account, namely, that it take into account the possibility of inconsistent data without portraying the human mind as logically and mathematically omniscient. I then propose a definition of mutual belief which meets these criteria. This account takes seriously the existence of computational (...) limitations. Finally, I point out that the epistemic logic (or theory) needed to make the definition work is subject to the Kaplan/Montague Paradox of the Knower. I argue that this is not a defect of the account, and I discuss briefly the bearing of recent work on the paradox of the Liar upon this problem. (shrink)

We study two logics of knowledge and belief stemming from the work of Stalnaker, omitting positive introspection for knowledge. The two systems are equivalent with positive introspection, but not without. We show that while the logic of beliefs remains unaffected by omitting introspection for knowledge in one system, it brings significant changes to the other. The resulting logic of belief is non-normal, and its complete axiomatization uses an infinite hierarchy of coherence constraints. We conclude by returning to the philosophical interpretation (...) underlying both models of belief, showing that neither is strong enough to support a probabilistic interpretation, nor an interpretation in terms of certainty or the “mental component” of knowledge. (shrink)

In the pair of articles of which this is the second, I present a set of problems and philosophical proposals that have in recent years been associated with the term “relativism”. These problems are related to the question of how we should represent thought and speech about certain topics. The main issue is whether we should model such mental states or linguistic acts as involving representational contents that are absolutely correct or incorrect, or whether, alternatively, their correctness should be thought (...) of as varying with some (more or less surprising) factor. In the first article, “Relativism 1: Representational Content”, I discussed the general issue of relativism about representational content. I argued for the conciliatory view that both relativist and absoutist conceptions of representational content can be legitimate. In the present continuation, I look in more detail at a special case of the general issue, namely the question of whether semantic contents, i.e. the contents assigned to linguistic utterances in the semantics of natural language, should be construed in an absolutist or in a relativist way. (shrink)

In recent work MacPherson argues that the standard method of modeling belief logically, as a necessity operator in a modal logic, is doomed to fail. The problem with normal modal logics as logics of belief is that they treat believers as "ideal" in unrealistic ways (i.e., as omnidoxastic); however, similar problems re-emerge for candidate non-normal logics. The authors argue that logics used to model belief in artificial intelligence (AI) are also flawed in this way. But for AI systems, omnidoxasticity is (...) impossible because of their finite nature, and this fact can be exploited to produce operational models of fallible belief. The relevance of this point to various philosophical views about belief is discussed. (shrink)

In this age of post-Moorean modesty, many of us are inclined to doubt that philosophy is in possession of arguments that might genuinely serve to undermine what we ordinarily believe. It may perhaps be conceded that the arguments of the skeptic appear to be utterly compelling; but the Mooreans among us will hold that the very plausibility of our ordinary beliefs is reason enough for supposing that there must be something wrong in the skeptic’s arguments, even if we are unable (...) to say what it is. In so far then, as the pretensions of philosophy to provide a world view rest upon its.. (shrink)

According to columnar higher-order vagueness, all orders of vagueness coincide: any borderline case is a borderline borderline case, and a third-order borderline case, etc. Bobzien has worked out many details of such a theory and models it with a modal logic closely related to S4. I take up a range of questions about the framework and argue that it is not suitable for modelling the structure of vagueness and higher-order vagueness.

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)

One of the fundamental properties inclassical equational reasoning isLeibniz's principle of substitution. Unfortunately, this propertydoes not hold instandard epistemic logic. Furthermore,Herbrand's lifting theorem which isessential to thecompleteness ofresolution andParamodulation in theclassical first order logic (FOL), turns out to be invalid in standard epistemic logic. In particular, unlike classical logic, there is no skolemization normal form for standard epistemic logic. To solve these problems, we introduce anintensional epistemic logic, based on avariation of Kripke's possible-worlds semantics that need not have a constant (...) domain. We show how a weaker notion of substitution through indexed terms can retain the Herbrand theorem. We prove how the logic can yield a satisfibility preserving skolemization form. In particular, we present an intensional principle for unifing indexed terms. Finally, we describe asound andcomplete inference system for a Horn subset of the logic withequality, based onepistemic SLD-resolution. (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)

Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked for being independent of other quantifiers. Dependence logic, introduced by Väänänen, is a logic with the complementary approach: for a quantifier it can be indicated on which quantifiers it depends. These logics are claimed to be useful for many phenomena, for instance natural language semantics. In this contribution we will compare these two logics by investigating their application in a compositional analysis of the de (...) dicto - de re ambiguity in natural language. It will be argued that Independence Friendly logic is suitable, whereas Dependence Logic is not. (shrink)

For deductive reasoning to be justified, it must be guaranteed to preserve truth from premises to conclusion; and for it to be useful to us, it must be capable of informing us of something. How can we capture this notion of information content, whilst respecting the fact that the content of the premises, if true, already secures the truth of the conclusion? This is the problem I address here. I begin by considering and rejecting several accounts of informational content. I (...) then develop an account on which informational contents are indeterminate in their membership. This allows there to be cases in which it is indeterminate whether a given deduction is informative. Nevertheless, on the picture I present, there are determinate cases of informative (and determinate cases of uninformative) inferences. I argue that the model I offer is the best way for an account of content to respect the meaning of the logical constants and the inference rules associated with them without collapsing into a classical picture of content, unable to account for informative deductive inferences. (shrink)

Real-world agents do not know all consequences of what they know. But we are reluctant to say that a rational agent can fail to know some trivial consequence of what she knows. Since every consequence of what she knows can be reached via chains of trivial cot be dismissed easily, as some have attempted to do. Rather, a solution must give adequate weight to the normative requirements on rational agents’ epistemic states, without treating those agents as mathematically ideal reasoners. I’ll (...) argue that agents can fail to know trivial consequences of what they know, but never determinately. Such cases are epistemic oversights on behalf of the agent in question, and the facts about epistemic oversights are always indeterminate facts. As a result, we are never in a position to assert that such-and-such constitutes an epistemic oversight for agent i (for we may rationally assert only determinate truths). I then develop formal epistemic models according to which epistemic accessibility relations are vague. Given these models, we can show that epistemic oversights always concern indeterminate cases of knowledge. (shrink)

Real-world agents do not know all consequences of what they know. But we are reluctant to say that a rational agent can fail to know some trivial consequence of what she knows. Since every consequence of what she knows can be reached via chains of trivial cot be dismissed easily, as some have attempted to do. Rather, a solution must give adequate weight to the normative requirements on rational agents’ epistemic states, without treating those agents as mathematically ideal reasoners. I’ll (...) argue that agents can fail to know trivial consequences of what they know, but never determinately. Such cases are epistemic oversights on behalf of the agent in question, and the facts about epistemic oversights are always indeterminate facts. As a result, we are never in a position to assert that such-and-such constitutes an epistemic oversight for agent i (for we may rationally assert only determinate truths). I then develop formal epistemic models according to which epistemic accessibility relations are vague. Given these models, we can show that epistemic oversights always concern indeterminate cases of knowledge. (shrink)

Impossible worlds are representations of impossible things and impossible happenings. They earn their keep in a semantic or metaphysical theory if they do the right theoretical work for us. As it happens, a worlds-based account provides the best philosophical story about semantic content, knowledge and belief states, cognitive significance and cognitive information, and informative deductive reasoning. A worlds-based story may also provide the best semantics for counterfactuals. But to function well, all these accounts need use of impossible and as well (...) as possible worlds. So what are impossible worlds? Graham Priest claims that any of the usual stories about possible worlds can be told about impossible worlds, too. But far from it. I'll argue that impossible worlds cannot be genuine worlds, of the kind proposed by Lewis, McDaniel or Yagisawa. Nor can they be ersatz worlds on the model proposed by Melia or Sider. Constructing impossible worlds, it turns out, requires novel metaphysical resources. (shrink)

The logical omniscience problem, whereby standard models of epistemic logic treat an agent as believing all consequences of its beliefs and knowing whatever follows from what else it knows, has received plenty of attention in the literature. But many attempted solutions focus on a fairly narrow specification of the problem: avoiding the closure of belief or knowledge, rather than showing how the proposed logic is of philosophical interest or of use in computer science or artificial intelligence. Sentential epistemic logics, as (...) opposed to traditional possible worlds approaches, do not suffer from the problems of logical omniscience but are often thought to lack interesting epistemic properties. In this paper, I focus on the case of rule-based agents, which play a key role in contemporary AI research but have been neglected in the logical literature. I develop a framework for modelling monotonic, nonmonotonic and introspective rule-based reasoners which have limited cognitive resources and prove that the resulting models have a number of interesting properties. An axiomatization of the resulting logic is given, together with completeness, decidability and complexity results. (shrink)

– We offer a new motivation for imprecise probabilities. We argue that there are propositions to which precise probability cannot be assigned, but to which imprecise probability can be assigned. In such cases the alternative to imprecise probability is not precise probability, but no probability at all. And an imprecise probability is substantially better than no probability at all. Our argument is based on the mathematical phenomenon of non-measurable sets. Non-measurable propositions cannot receive precise probabilities, but there is a natural (...) way for them to receive imprecise probabilities. The mathematics of non-measurable sets is arcane, but its epistemological import is far-reaching; even apparently mundane propositions are liable to be affected by non-measurability. The phenomenon of non-measurability dramatically reshapes the dialectic between critics and proponents of imprecise credence. Non-measurability offers natural rejoinders to prominent critics of imprecise credence. Non-measurability even reverses some of the critics’ arguments—by the very lights that have been used to argue against imprecise credences, imprecise credences are better than precise credences. (shrink)

Jaakko Hintikka proposed treating objectual perception sentences, such as “Alice sees Bob,” as de re propositional perception sentences. Esa Saarinen extended Hintikka’s idea to eventive perception sentences, such as “Alice sees Bob smile.” These approaches, elegant as they may be, are not philosophically neutral, for they presuppose, controversially, that the content of all perceptual experiences is propositional in nature. The aim of this paper is to propose a formal treatment of objectual and eventive perception sentences that builds on Hintikka’s modal (...) approach to propositional attitude ascriptions while avoiding controversial assumptions on the nature of perceptual experiences. Despite being simple and theoretically frugal, our approach is powerful enough to express a variety of interesting philosophical views about propositional, objectual, and eventive perception sentences, thus enabling the study of their inferential relationships. (shrink)

The verb ‘to know’ can be used both in ascriptions of propositional knowledge and ascriptions of knowledge of acquaintance. In the formal epistemology literature, the former use of ‘know’ has attracted considerable attention, while the latter is typically regarded as derivative. This attitude may be unsatisfactory for those philosophers who, like Russell, are not willing to think of knowledge of acquaintance as a subsidiary or dependent kind of knowledge. In this paper we outline a logic of knowledge of acquaintance in (...) which ascriptions like ‘Mary knows Smith’ are regarded as formally interesting in their own right, remaining neutral on their relation to ascriptions of propositional knowledge. The resulting logical framework, which is based on Hintikka’s modal approach to epistemic logic, provides a fresh perspective on various issues and notions at play in the philosophical debate on acquaintance. (shrink)

If we express our knowledge in sentences, we will find that these sentences are linked in complex patterns governed by our observations and our inferences from these observations. These inferences are to a large extent driven by logical rules. We ask whether the structure logic imposes on our knowledge restricts what we forget and what we remember. The model is a two period S5 logic. In this logic, we propose a memory loss operator: the agent forgets a sentence pif and (...) only if he knows pat time 1 and he does not know pat time 2. Equipped with the operator, we prove theorems on the relation between knowledge and memory loss. The main results point to classes of formulas that an agent cannot forget, and classes of formulas he must forget. A desirable feature is that most results hold in the S4 logic. The results illustrate bounds to memory loss, and thus to bounded rationality. We apply the model to single-agent conventions: conventions made between an agent and himself. (shrink)

The phrase ‘autoepistemic logic’ was introduced in Moore [1985] to refer to a study inspired in large part by criticisms in Stalnaker [1980] of a particular nonmonotonic logic proposed by McDermott and Doyle.1 Very informative discussions for those who have not encountered this area are provided by Moore [1988] and the wide-ranging survey article Konolige [1994], and the scant remarks in the present introductory section do not pretend to serve in place of those treatments as summaries of the field. A (...) good deal of the material omitted here pertains to the specifically nonmonotonic nature of autoepistemic logic as standardly developed, but as we shall urge, there is from one point of view nothing distinctively nonmonotonic about the basic motivating ideas of the subject. (shrink)

We recapitulate (Section 1) some basic details of the system of implicative BCSK logic, which has two primitive binary implicational connectives, and which can be viewed as a certain fragment of the modal logic S5. From this modal perspective we review (Section 2) some results according to which the pure sublogic in either of these connectives (i.e., each considered without the other) is an exact replica of the material implication fragment of classical propositional logic. In Sections 3 and 5 we (...) show that for the pure logic of one of these implicational connectives two – in general distinct – consequence relations (global and local) definable in the Kripke semantics for modal logic turn out to coincide, though this is not so for the pure logic of the other connective, and that there is an intimate relation between formulas constructed by means of the former connective and the local consequence relation. (Corollary 5.8. This, as we show in an Appendix, is connected to the fact that the ‘propositional operations’ associated with both of our implicational connectives are close to being what R. Quackenbush has called pattern functions.) Between these discussions Section 4 examines some of the replacement-of-equivalents properties of the two connectives, relative to these consequence relations, and Section 6 closes with some observations about the metaphor of identical twins as applied to such pairs of connectives. (shrink)

We investigate, for several modal logics but concentrating on KT, KD45, S4 and S5, the set of formulas B for which ${\square B}$ is provably equivalent to ${\square A}$ for a selected formula A (such as p, a sentence letter). In the exceptional case in which a modal logic is closed under the (‘cancellation’) rule taking us from ${\square C \leftrightarrow \square D}$ to ${C \leftrightarrow D}$ , there is only one formula B, to within equivalence, in this inverse image, (...) as we shall call it, of ${\square A}$ (relative to the logic concerned); for logics for which the intended reading of “ ${\square}$ ” is epistemic or doxastic, failure to be closed under this rule indicates that from the proposition expressed by a knowledge- or belief-attribution, the propositional object of the attitude in question cannot be recovered: arguably, a somewhat disconcerting situation. More generally, the inverse image of ${\square A}$ may comprise a range of non-equivalent formulas, all those provably implied by one fixed formula and provably implying another—though we shall see that for several choices of logic and of the formula A, there is not even such an ‘interval characterization’ of the inverse image (of ${\square A}$ ) to be found. (shrink)

Kroedel has proposed a new solution, the permissibility solution, to the lottery paradox. The lottery paradox results from the Lockean thesis according to which one ought to believe a proposition just in case one’s degree of belief in it is sufficiently high. The permissibility solution replaces the Lockean thesis by the permissibility thesis according to which one is permitted to believe a proposition if one’s degree of belief in it is sufficiently high. This note shows that the epistemology of belief (...) that results from the permissibility thesis and the epistemology of degrees of belief is empty in the sense that one need not believe anything, even if one’s degrees of belief are maximally bold. Since this result can also be achieved by simply dropping the Lockean thesis, or by replacing it with principles that are logically stronger than the permissibility thesis, the question arises what the permissibility solution is a solution of. (shrink)

The question I am addressing in this paper is the following: how is it possible to empirically test, or confirm, counterfactuals? After motivating this question in Section 1, I will look at two approaches to counterfactuals, and at how counterfactuals can be empirically tested, or confirmed, if at all, on these accounts in Section 2. I will then digress into the philosophy of probability in Section 3. The reason for this digression is that I want to use the way observable (...) absolute and relative frequencies, two empirical notions, are used to empirically test, or confirm, hypotheses about objective chances, a metaphysical notion, as a role-model. Specifically, I want to use this probabilistic account of the testing of chance hypotheses as a role-model for the account of the testing of counterfactuals, another metaphysical notion, that I will present in Sections 4 to 8. I will conclude by comparing my proposal to one non-probabilistic and one probabilistic alternative in Section 9. (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.

Philosophers typically rely on intuitions when providing a semantics for counterfactual conditionals. However, intuitions regarding counterfactual conditionals are notoriously shaky. The aim of this paper is to provide a principled account of the semantics of counterfactual conditionals. This principled account is provided by what I dub the Royal Rule, a deterministic analogue of the Principal Principle relating chance and credence. The Royal Rule says that an ideal doxastic agent’s initial grade of disbelief in a proposition \(A\) , given that the (...) counterfactual distance in a given context to the closest \(A\) -worlds equals \(n\) , and no further information that is not admissible in this context, should equal \(n\) . Under the two assumptions that the presuppositions of a given context are admissible in this context, and that the theory of deterministic alethic or metaphysical modality is admissible in any context, it follows that the counterfactual distance distribution in a given context has the structure of a ranking function. The basic conditional logic V is shown to be sound and complete with respect to the resulting rank-theoretic semantics of counterfactuals. (shrink)

This paper defends the view, put roughly, that to think that p is to guess that p is the answer to the question at hand, and that to think that p rationally is for one’s guess to that question to be in a certain sense non-arbitrary. Some theses that will be argued for along the way include: that thinking is question-sensitive and, correspondingly, that ‘thinks’ is context-sensitive; that it can be rational to think that p while having arbitrarily low credence (...) that p; that, nonetheless, rational thinking is closed under entailment; that thinking does not supervene on credence; and that in many cases what one thinks on certain matters is, in a very literal sense, a choice. Finally, since there are strong reasons to believe that thinking just is believing, there are strong reasons to think that all this goes for belief as well. (shrink)

This paper defends the simple view that in asserting that p, one lies iff one knows that p is false. Along the way it draws some morals about deception, knowledge, Gettier cases, belief, assertion, and the relationship between first- and higher-order norms.

A plausible principle about the felicitous use of indicative conditionals says that there is something strange about asserting an indicative conditional when you know whether its antecedent is true. But in most contexts there is nothing strange at all about asserting indicative conditionals like ‘If Oswald didn’t shoot Kennedy, then someone else did’. This paper argues that the only compelling explanation of these facts requires the resources of contextualism about knowledge.

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)

Conversational exculpature is a pragmatic process whereby information is subtracted from, rather than added to, what the speaker literally says. This pragmatic content subtraction explains why we can say “Rob is six feet tall” without implying that Rob is between 5'0.99" and 6'0.01" tall, and why we can say “Ellen has a hat like the one Sherlock Holmes always wears” without implying Holmes exists or has a hat. This article presents a simple formalism for understanding this pragmatic mechanism, specifying how, (...) in context, the result of such subtractions is determined. And it shows how the resulting theory of conversational exculpature accounts for a varied range of linguistic phenomena. A distinctive feature of the approach is the crucial role played by the question under discussion in determining the result of a given exculpature. (shrink)

Summary Ordinary language philosophers frequently draw on the fact that an appropriately selected sentential combination of the form p but not q can, or cannot, be uttered without absurdity; however, they do so without sufficient reflection on the methodology of such combination tests, which results in considerable shortcomings even in practical application. To improve things, I shall discuss two criteria for distinguishing ‘pragmatic’ from ‘non-pragmatic’ implications and for separating the latter into ‘linguistic’ (‘semantic’ and ‘syntactical’) and ‘non-linguistic’ ones (2–3); consider (...) the bearing of the principle of ‘sense-constancy‘ on the applicability of combination tests (4); and call attention to the important, though merely heuristic, function of investigating pragmatic, as opposed to semantic, implications (5.1–5.2). Finally, I shall hint at a striking analogy between the linguistic (yet non-empirical) method of combination tests, the phenomenological method of ‘fictional variation’, and the empirical method of ‘conjectures and refutations’ (5.3). (shrink)

This paper works within a model of ungraded belief that characterizes epistemic states as logically closed and consistent sets of sentences. The aim of this paper is to discuss three diachronic coherence conditions for such beliefs. These coherence conditions are formulated in terms of the reasoner's present beliefs about how his present beliefs will evolve in the future, for instance, in response to different pieces of future evidence.

Nelson Goodman cast the ‘problem of induction’ as the task of articulating the principles and standards by which to distinguish valid from invalid inductive inferences. This paper explores some logical bounds on the ability of a rational reasoner to accomplish this task. By a simple argument, either an inductive inference method cannot admit its own fallibility, or there exists some non-inferable hypothesis whose non-inferability the method cannot infer (violating the principle of ‘negative introspection’). The paper discusses some implications of this (...) limited self-knowledge for the justifiability of inductive inferences, auto-epistemic logic, and the epistemic foundations of game theory. (shrink)

There has been a recent surge of interest among economists in developing models of doxastic states that can account for some aspects of human cognitive limitations that are ignored by standard formal models, such as awareness. Epistemologists purport to have a principled reason for ignoring the question of awareness: under the equilibrium conception of doxastic states they favour, a doxastic state comprises the doxastic commitments an agent would recognise were he fully aware, so the question of awareness plays no role. (...) The objective of this paper is to scrutinize this argument. A thesis underlying the argument, which we call the independence of doxastic commitments with respect to awareness, is identified, and examples are given where it appears to be violated. By considering these examples, one can get an idea of the price of accepting this thesis. On the one hand, one can escape the conclusion that the thesis is violated, but only at the expense of another principle espoused by all major formal models of belief, which we call constant doxastic rest; and abandoning this principle necessitates extensive revision of current models of belief. On the other hand, there are epistemologically valid reasons for thinking that the thesis fails to hold in the examples, which have to be rebutted if the thesis, and the equilibrium justification for ignoring the issue of awareness, are to be retained. (shrink)

Rosenkranz has recently proposed a logic for propositional, non-factive, all-things-considered justification, which is based on a logic for the notion of being in a position to know, 309–338 2018). Starting from three quite weak assumptions in addition to some of the core principles that are already accepted by Rosenkranz, I prove that, if one has positive introspective and modally robust knowledge of the axioms of minimal arithmetic, then one is in a position to know that a sentence is not provable (...) in minimal arithmetic or that the negation of that sentence is not provable in minimal arithmetic. This serves as the formal background for an example that calls into question the correctness of Rosenkranz’s logic of justification. (shrink)