Many epistemologists call themselves ‘fallibilists’. But many philosophers of language hold that the meaning of epistemic usages of ‘possible’ ensures a close knowledge- possibility link : a subject’s utterance of ‘it’s possible that not-p’ is true only if the subject does not know that p. This seems to suggest that whatever the core insight behind fallibilism is, it can’t be that a subject could have knowledge which is, for them, possibly false. I argue that, on the contrary, subjects can have (...) such possibly false knowledge. My ultimate aim, then, is to vindicate a very robust form of fallibilism. Uniquely, however, the account I offer does this while also allowing that concessive knowledge attributions – sentences of the form “I know that p, but it’s possible that not-p” – are not only infelicitous but actually false whenever uttered. The account predicts this result without conceding KPL. I argue that my account has the resources to explain some related cases for which the KPL account yields the wrong predictions. Taken as a whole, the linguistic data not only do not support the proposal that subjects cannot have possibly false knowledge, but indeed positively favor the proposal that they can. (shrink)

Many philosophers think that requirements of rationality are “wide-scope”. That is to say: they are requirements to satisfy some material conditional, such that one counts as satisfying the requirement iff one either makes the conditional’s antecedent false or makes its consequent true. These contrast with narrow-scope requirements, where the requirement takes scope only over the consequent of the conditional. Many of the philosophers who have preferred wide-scope requirements to narrow-scope requirements have also endorsed a corresponding semantic claim, namely that ordinary (...) talk about rationality, despite appearances to the contrary, expresses wide-scope claims. In doing so, they seek to avoid attributing massive error to ordinary speakers. However, it is becoming increasingly clear that the wide-scope semantics inadequately captures the meaning of ordinary talk about rationality. It seems, then, that we are left with a dilemma: either give up the view that requirements of rationality are wide-scope, or accept an implausible semantics for ordinary talk about rationality, or attribute massive error to speakers. In this paper, I argue that this dilemma is only apparent, since we can appeal to a standard kind of contextualist semantics for modals to explain why narrow-scope talk comes out true in virtue of the wide-scope requirements. My view, then, combines wide-scoping about the explanatorily fundamental requirements of rationality with a contextualist variant of a narrow-scope semantics. I argue that this view gives us the best of both worlds, as well as solving related puzzles and challenges for the extant views in the literature. (shrink)

This paper offers a unified semantic explanation of two observations that prove to be problematic for classical analyses of modals, conditionals, and disjunctions: the fact that disjunctions scoping under possibility modals give rise to the free choice effect and the fact that counterfactuals license simplification of disjunctive antecedents. It shows that the data are well explained by a dynamic semantic analysis of modals and conditionals that uses ideas from the inquisitive semantic tradition in its treatment of disjunction. The analysis explains (...) why embedding a disjunctive possibility under negation reverts disjunction to its classical behavior, is general enough to predict less studied simplification patterns, and also makes progress toward a unified perspective on the distinction between informative, inquisitive, and attentive content. (shrink)

Schulz has shown that the suppositional view of indicative conditionals leads to a corresponding view of epistemic modals. But his case backfires: the resulting theory of epistemic modals gets the facts wrong, and so we end up with a good argument against the suppositional view. I show how and why a dynamic view of indicative conditionals leads to a better theory of epistemic modals.

In contemporary discussions of the Ramsey Test for conditionals, it is commonly held that (i) supposing the antecedent of a conditional is adopting a potential state of full belief, and (ii) Modus Ponens is a valid rule of inference. I argue on the basis of Thomason Conditionals (such as ' If Sally is deceiving, I do not believe it') and Moore's Paradox that both claims are wrong. I then develop a double-indexed Update Semantics for conditionals which takes these two results (...) into account while doing justice to the key intuitions underlying the Ramsey Test. The semantics is extended to cover some further phenomena, including the recent observation that epistemic modal operators give rise to something very like, but also very unlike, Moore's Paradox. (shrink)

Una Stojnić's Context and Coherence: The Logic and Grammar of Prominence offers a series of interesting criticisms of the classical dynamic paradigm in natural language semantics and offers a sophisticated alternative outlook, one that does recognize a dynamic, context change inducing dimension of meaning but at the same preserves the idea that (declarative) utterances express propositions in context. The purpose of this note is to set the record straight: existing dynamic analyses of modals and conditionals compare favorably with Stojnić's dynamic (...) propositionalism. (shrink)

A dynamic semantics for epistemically modalized sentences is an attractive alternative to the orthodox view that our best theory of meaning ascribes to such sentences truth-conditions relative to what is known. This essay demonstrates that a dynamic theory about might and must offers elegant explanations of a range of puzzling observations about epistemic modals. The first part of the story offers a unifying treatment of disputes about epistemic modality and disputes about matters of fact while at the same time avoiding (...) the complexities of alternative theories. The second part of the story extends the basic framework to cover some complicated data about retraction and the interaction between epistemic modality and tense. A comparison between the suggestion made in this essay and current versions of the orthodoxy is provided. (shrink)

Epistemic modals are a prominent topic in the literature on natural language semantics, with wide-ranging implications for issues in philosophy of language and philosophical logic. Considerations about the role that epistemic "might" and "must" play in discourse and reasoning have led to the development of several important alternatives to classical possible worlds semantics for natural language modal expressions. This is an opinionated overview of what I take to be some of the most exciting issues and developments in the field.

Every adequate semantics for conditionals and deontic ought must offer a solution to the miners paradox about conditional obligations. Kolodny and MacFarlane have recently argued that such a semantics must reject the validity of modus ponens. I demonstrate that rejecting the validity of modus ponens is inessential for an adequate solution to the paradox.

Metaethical noncognitivists have trouble arriving at a respectable semantic theory for moral language. The goal of this article is to make substantial progress toward demonstrating that these problems may be overcome. Replacing the predominant expressivist semantic agenda in metaethics with a dynamic perspective on meaning and communication allows noncognitivists to provide a satisfying analysis of negation and other constructions that have been argued to be problematic for metaethical noncognitivism, including disjunctions. The resulting proposal preserves some of the key insights from (...) recent work on the semantics of expressivism while highlighting the widely neglected early noncognitivists' sympathies to the kind of dynamic story I intend to tell here. A comparison between the advertised dynamic semantic story and current proposals that treat expressivism as a pragmatic rather than semantic theory about moral language is provided. (shrink)

Among the main reactions to scepticism, fallibilism is certainly the most popular nowadays. However, fallibilism faces a very strong and well-known objection. It has to grant that concessive knowledge attributions—assertions of the form “I know that p but it might be that not p”—can be true. Yet, these assertions plainly sound incoherent. Fallibilists have proposed to explain this incoherence pragmatically. The main proponents of this approach appeal to Gricean implicatures (Rysiew in Noûs 35(4):477514, 2001; Dougherty and Rysiew in Philos Phenomenol (...) Res 78(1):123132, 2009; Dougherty and Rysiew in Synthese 181(3):395403, 2011). Very recently, some philosophers have observed that fallibilists can also explain this apparent incoherence pragmatically if they embrace a (context-sensitive) certainty norm for assertion (Petersen in Synthese 196(11):4691–4710, 2019; Beddor in Philos Impr 20(8), 2020; Vollet in Dialectica 74:3, 2020). In this paper, I argue for the superiority of this latter explanation over its older rivals. (shrink)

In this paper we introduce a notion of context for Groenendijk & Stokhof's Dynamic Predicate Logic DPL. We use these contexts to give a characterization of the relations on assignments that can be generated by composition from tests and random resettings in the case that we are working over an infinite domain. These relations are precisely the ones expressible in DPL if we allow ourselves arbitrary tests as a starting point. We discuss some possible extensions of DPL and the way (...) these extensions interact with our notion of context. (shrink)

The development of the dynamic semantics of natural languagehas put issues of variable control on the agenda of formal semantics. Inthis paper we regard variables as names for stacks of values and makeexplicit several control actions as push and pop actions on stacks. Weapply this idea both to static and dynamic languages and compare theirfinite variable hierarchies, i.e., the relation between the number ofvariable stacks that is available and the expressivity of the language.This can be compared in natural languages with (...) relating the number ofpronouns available to the expressivity of the language.The results are obtained using techniques from static and dynamic modeltheory: model theoretic games, transition systems and bisimulation. (shrink)

This paper is concerned with the structure of texts in which aproof is presented. Some parts of such a text are assumptions, otherparts are conclusions. We show how the structural organisation of thetext into assumptions and conclusions helps to check the validity of theproof. Then we go on to use the structural information for theformulation of proof rules, i.e., rules for the (re-)construction ofproof texts. The running example is intuitionistic propositional logicwith connectives , and. We give new proofs of some (...) familiar results aboutthe proof theory of this logic to indicate how the new techniques workout. (shrink)

In this paper a semantics for dynamic predicate logic is developed that uses sequence valued assignments. This semantics is compared with the usual relational semantics for dynamic predicate logic: it is shown that the most important intuitions of the usual semantics are preserved. Then it is shown that the refined semantics reflects out intuitions about information growth. Some other issues in dynamic semantics are formulated and discussed in terms of the new sequence semantics.

This paper provides an update semantics for counterfactual conditionals. It does so by giving a dynamic twist to the ‘Premise Semantics’ for counterfactuals developed in Veltman (1976) and Kratzer (1981). It also offers an alternative solution to the problems with naive Premise Semantics discussed by Angelika Kratzer in ‘Lumps of Thought’ (Kratzer, 1989). Such an alternative is called for given the triviality results presented in Kanazawa et al. (2005, this issue).

In this paper, Universal any and Negative Polarity Item any are uniformly analyzed as ‘counterfactual’ donkey sentences (in disguise). Their difference in meaning is reduced here to the distinction between strong and weak readings of donkey sentences. It is shown that this explains the universal and existential character of Universal- and NPI-any, respectively, and the positive and negative contexts in which they are licensed. Our uniform analysis extends to the use of any in command and permission sentences. It predicts that (...) whereas the use of any in permission sentences is licensed and gives rise to a universal reading, it is not licensed in command sentences. (shrink)

This light piece reflects on analogies between two often disjoint streams of research: the logical semantics and pragmatics of natural language and dynamic logics of general information-driven agency. The two areas show significant overlap in themes and tools, and yet, the focus seems subtly different in each, defying a simple comparison. We discuss some unusual questions that emerge when the two are put side by side, without any pretense at covering the whole literature or at reaching definitive conclusions.

We identify a pervasive contrast between implicit and explicit stances in logical analysis and system design. Implicit systems change received meanings of logical constants and sometimes also the notion of consequence, while explicit systems conservatively extend classical systems with new vocabulary. We illustrate the contrast for intuitionistic and epistemic logic, then take it further to information dynamics, default reasoning, and other areas, to show its wide scope. This gives a working understanding of the contrast, though we stop short of a (...) formal definition, and acknowledge limitations and borderline cases. Throughout we show how awareness of the two stances suggests new logical systems and new issues about translations between implicit and explicit systems, linking up with foundational concerns about identity of logical systems. But we also show how a practical facility with these complementary working styles has philosophical consequences, as it throws doubt on strong philosophical claims made by just taking one design stance and ignoring alternative ones. We will illustrate the latter benefit for the case of logical pluralism and hyper-intensional semantics. (shrink)

Cimpian et al. observed that we accept generic statements of the form ‘Gs are f’ on relatively weak evidence, but that if we are unfamiliar with group G and we learn a generic statement about it, we still treat it inferentially in a much stronger way: all Gs are f. This paper makes use of notions like ‘representativeness’, ‘contingency’ and ‘relative difference’ from psychology to provide a uniform semantics of generics that explains why people accept generics based on weak evidence. (...) The spirit of the approach has much in common with Leslie’s cognition-based ideas about generics, but the semantics will be grounded on a strengthening of Cohen’s relative readings of generic sentences. In contrast to Leslie and Cohen, we propose a uniform semantic analysis of generics. The basic intuition is that a generic of the form ‘Gs are f’ is true because f is typical for G, which means that f is valuably associated with G. We will make use of Kahneman and Tversky’s Heuristics and Biases approach, according to which people tend to confuse questions about probability with questions about representativeness, to explain pragmatically why people treat many generic statements inferentially in a much stronger way. (shrink)

Epistemology and epistemic logic At first sight, the modern agenda of epistemology has little to do with logic. Topics include different definitions of knowledge, its basic formal properties, debates between externalist and internalist positions, and above all: perennial encounters with sceptics lurking behind every street corner, especially in the US. The entry 'Epistemology' in the Routledge Encyclopedia of Philosophy (Klein 1993) and the anthology (Kim and Sosa 2000) give an up-to-date impression of the field. Now, epistemic logic started as a (...) contribution to epistemology, or at least a tool in its modus operandi, with the seminal book Knowledge and Belief (Hintikka's 1962, 2005). Formulas like Ki for "the agent i knows that " Bi for "the agent i believes that " provided logical forms for stating and analyzing philosophical propositions and arguments. And more than that, their model-theoretic semantics in terms of ranges of alternatives provided an appealing extensional way of thinking about what agents know or believe in a given situation. In particular, on Hintikka's view, an agent knows those propositions which are true in all situations compatible with what she knows about the actual world; i.e., her current range of uncertainty. (shrink)

We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consists of definable update rules for changing plausibility relations between worlds, which have been proposed independently in the dynamic-epistemic literature on preference change. Our analysis yields two new types of modal result. First, we obtain complete logics for concrete mechanisms of belief revision, based on compositional reduction axioms. Next, we show how various abstract postulates for (...) belief revision can be analyzed by standard modal frame correspondences for model-changing operations. (shrink)

Statements not only update our current knowledge, but also have other dynamic effects. In particular, suggestions or commands ?upgrade' our preferences by changing the current order among worlds. We present a complete logic of knowledge update plus preference upgrade that works with dynamic-epistemic-style reduction axioms. This system can model changing obligations, conflicting commands, or ?regret'. We then show how to derive reduction axioms from arbitrary definable relation changes. This style of analysis also has a product update version with preferences between (...) actions, as well as worlds. Some illustrations are presented involving defaults and obligations. We conclude that our dynamic framework is viable, while admitting a further extension to more numerical ?utility update'. (shrink)

Take your average publication on the dynamics of knowledge. In one of its first paragraphs you will probably encounter a phrase like “a logic of public announcements was first proposed by Plaza in 1989 (Plaza 1989).” Tracking down this publication seems easy, because googling its title ‘Logics of Public Communications’ takes you straight to Jan Plaza’s website where it is online available in the author’s own version, including, on that page, very helpful and full bibliographic references to the proceedings in (...) which it originally appeared. Those proceedings are then somewhat harder to find. In fact, I have never seen them. Unfortunately, for the research community, Plaza’s work has never been followed up by a journal version. I am very grateful to the editor Wiebe van der Hoek of the journal ‘Knowledge, Rationality, and Action’ to correct this omission.Plaza’s work is reprinted as such, without an update encompassing more than fifteen additional years of research in this area. This commentary aims to provide some background to bridge that gap. (shrink)

This paper is on the update semantics for might of Veltman. Threeconsequence relations are introduced and studied in an abstract setting.Next we present sequent-style systems for each of the consequence relations.We show the logics to be complete and decidable. The paper ends with asyntactic cut elimination result.

In this paper we present an extension of (bunched) separation logic, Boolean BI, with epistemic and dynamic epistemic modalities. This logic, called action model separation logic ( \(\mathrm {AMSL}\) ), can be seen as a generalization of public announcement separation logic in which we replace public announcements with action models. Then we not only model public information change (public announcements) but also non-public forms of information change, such as private announcements. In this context the semantics for the connectives \(*\) and (...) \(\mathrel {-*}\) from separation logic are epistemic versions of their usual semantics. This is because formulas are interpreted in states, not in resources, and agents may be uncertain between different states representing the same resource. We present the logic \(\mathrm {AMSL}\) and its semantics, with a detailed case study that highlights its interest for modeling. We also prove the elimination of the dynamics modalities and discuss some alternative epistemic semantics for the separation connectives. (shrink)

Eventualities and worlds are analysed uniformly as schedules of certain descriptions of eventuality-types (reversing the reduction of eventuality-types to eventualities). The temporal interpretation of modals in Condoravdi 2002 is reformulated to bring out what it is about eventualities and worlds that is essential to the account. What is essential, it is claimed, can be recovered from schedules that may or may not include worlds.

While monadic second-order logic (MSO) has played a prominent role in model theoretic syntax, modal logics have been used in this context since its inception. When comparing propositional dynamic logic (PDL) to MSO over trees, Kracht (1997) noted that there are tree languages that can be defined in MSO that can only be defined in PDL by adding new features whose distribution is predictable. He named such features “inessential features”. We show that Kracht’s observation can be extended to other modal (...) logics of trees in two ways. First, we demonstrate that for each stronger logic, there exists a tree language that can only be defined in a weaker logic with inessential features. Second, we show that any tree language that can be defined in a stronger logic, but not in some weaker logic, can be defined with inessential features. Additionally, we consider Kracht’s definition of inessential features more closely. It turns out that there are features whose distribution can be predicted, but who fail to be inessential in Kracht’s sense. We will look at ways to modify his definition. (shrink)

Currently there is hardly any connection between philosophy of science and Artificial Intelligence research. We argue that both fields can benefit from each other. As an example of this mutual benefit we discuss the relation between Inductive-Statistical Reasoning and Default Logic. One of the main topics in AI research is the study of common-sense reasoning with incomplete information. Default logic is especially developed to formalise this type of reasoning. We show that there is a striking resemblance between inductive-statistical reasoning and (...) default logic. A central theme in the logical positivist study of inductive-statistical reasoning such as Hempels Criterion of Maximal Specificity turns out to be equally important in default logic. We also discuss to what extent the relevance of the results of Logical Positivism to AI research could contribute to a reevaluation of Logical Positivism in general. (shrink)

The modifier effect refers to the fact that the perceived likelihood of a property in a noun category is diminished if the noun is modified. For example, “Pigs live on farms” is rated as more likely than “Dirty pigs live on farms.” The modifier effect has been demonstrated in many studies, but the underlying cognitive mechanisms are still unclear. This paper reports two series of experiments that jointly point to the conclusion that the modifier effect is the result of a (...) superposition of three cognitive mechanisms: (a) probabilistically softened default inheritance, (b) pragmatic implicatures due to Gricean relevance assumptions, and (c) inference based on world knowledge. We present evidence that the pragmatic effects operate largely on an unconscious level and that their influence can be reduced by changing the presentation format of the cognitive task. (shrink)

The paper suggests a modal predicate logic that deals with classical quantification and modalities as well as intermediate operators, like “most” and “mostly”. Following up the theory of generalized quantifiers, we will understand them as two-placed operators and call them determiners. Quantifiers as well as modal operators will be constructed from them. Besides the classical deduction, we discuss a weaker probabilistic inference “therefore, probably” defined by symmetrical probability measures in Carnap’s style. The given probabilistic inference relates intermediate quantification to singular (...) statements: “Most S are P” does not logically entail that a particular individual S is also P, but it follows that this is probably the case, where the probability is not ascribed to the propositions but to the inference. We show how this system deals with single case expectations while predictions of statistical statements remain generally problematic. (shrink)

Like belief revision, conceptual change has rational aspects. The paper discusses this for predicate change. We determine the meaning of predicates by a set of imaginable instances, i.e., conceptually consistent entities that fall under the predicate. Predicate change is then an alteration of which possible entities are instances of a concept. The recent exclusion of Pluto from the category of planets is an example of such a predicate change. In order to discuss predicate change, we define a monadic predicate logic (...) with three different kinds of lawful belief: analytic laws, which hold for all possible instances; doxastic laws, which hold for the most plausible instances; and typicality laws, which hold for typical instances. We introduce predicate changing operations that alter the analytic laws of the language and show that the expressive power is not affected by the predicate change. One can translate the new laws into old laws and vice versa. Moreover, we discuss rational restrictions of predicate change. These limit its possible influence on doxastic and typicality laws. Based on the results, we argue that predicate change can be quite conservative and sometimes even hardly recognisable. (shrink)

Normality judgements are frequently used in everyday communication as well as in biological and social science. Moreover they became increasingly relevant to formal logic as part of defeasible reasoning. This paper distinguishes different kinds of normality statements. It is argued that normality laws like “Birds can normally fly” should be understood essentially in a statistical way. The argument has basically two parts: firstly, a statistical semantic core is mandatory for a descriptive reading of normality in order to explain the logical (...) features of normality laws. Secondly, a statistical justification of normality statements can be derived by game theoretic considerations if the normality law is understood as communication convention. (shrink)

It is a fact that human subjects rate sentences about typical properties such as “Ravens are black” as very likely to be true. In comparison, modified sentences such as “Feathered ravens are black” receive lower ratings, especially if the modifier is atypical for the noun, as in “Jungle ravens are black”. This is called the modifier effect. However, the likelihood of the unmodified statement influences the perceived likelihood of the modified statement: the higher the rated likelihood of the unmodified sentence, (...) the higher the rated likelihood of the modified one. That means the modifier effect does not fully block default inheritance of typical properties from nouns to modified nouns. This paper discusses this inheritance effect. In particular, I ask whether it is the direct result of composing concepts from nouns, that is, a bias toward “black” when processing “raven”. I report a series of experiments in which I find no evidence for a direct inheritance from composition. This supports the view that default inheritance is rather an inference than a bias. (shrink)

Some dynamic semantic theories include an attempt to derive truth-conditional meaning from context change potential. This implies defining truth in terms of context change. Focusing on presuppositions and epistemic modals, this paper points out some problems with how this project has been carried out. It then suggests a way of overcoming these problems. This involves appealing to a richer notion of context than the one found in standard dynamic systems.

An adequate semantics for generic sentences must stake out positions across a range of contested territory in philosophy and linguistics. For this reason the study of generic sentences is a venue for investigating different frameworks for understanding human rationality as manifested in linguistic phenomena such as quantification, classification of individuals under kinds, defeasible reasoning, and intensionality. Despite the wide variety of semantic theories developed for generic sentences, to date these theories have been almost universally model-theoretic and representational. This essay outlines (...) a range of proof-theoretic analyses for characterizing generics. Particular attention is given to an expressivist proof-theory that can be traced to 1) work on logical syntax that Carnap undertook prior to his turn toward truth-conditional model theory in the late 1930s, and 2) research on sequent calculi and natural deduction systems that originate in work from Gentzen and Prawitz.1. (shrink)

The standing tradition in theorizing about meaning, since at least Frege, identifies meaning with propositions, which are, or determine, the truth-conditions of a sentence in a context. But a recent trend has advocated a departure from this tradition: in particular, it has been argued that modal claims do not express standard propositional contents. This non-propositionalism has received different implementations in expressivist semantics and certain kinds of dynamic semantics. They maintain that the key aspect of interpretation of modal claims is the (...) characteristic dynamic effect they have on the context. I argue that pessimism about truth-conditions arises from an overly simplistic picture of content, context and their interaction. While I agree with the critics that an important aspect of modal meaning is the dynamic effect modals have on the context, I argue that they have mischaracterized the nature and the complexity of this effect. A more nuanced account of the interaction between modals and context shows that far from being incompatible with propositional meaning, the dynamic aspect of meaning is precisely what allows us to predict the correct propositional content of an utterance. (shrink)

A uniform theory of conditionals is one which compositionally captures the behavior of both indicative and subjunctive conditionals without positing ambiguities. This paper raises new problems for the closest thing to a uniform analysis in the literature (Stalnaker, Philosophia, 5, 269–286 (1975)) and develops a new theory which solves them. I also show that this new analysis provides an improved treatment of three phenomena (the import-export equivalence, reverse Sobel-sequences and disjunctive antecedents). While these results concern central issues in the study (...) of conditionals, broader themes in the philosophy of language and formal semantics are also engaged here. This new analysis exploits a dynamic conception of meaning where the meaning of a symbol is its potential to change an agent’s mental state (or the state of a conversation) rather than being the symbol’s content (e.g. the proposition it expresses). The analysis of conditionals is also built on the idea that the contrast between subjunctive and indicative conditionals parallels a contrast between revising and consistently extending some body of information. (shrink)

The paper focuses on interpreting ceteris paribus conditions as normal conditions. After discussing six basic problems for the explication of normal conditions and seven interpretations that do not well solve those problems I turn to what I call the epistemic account. According to it the normal is, roughly, the not unexpected. This is developed into a rigorous constructive account of normal conditions, which makes essential use of ranking theory and in particular allows to explain the phenomenon of multiply exceptional conditions. (...) Finally, this static account is extended to a schematic dynamic model of how we may learn about those normal and exceptional conditions. (shrink)

According to existing accounts of indicative conditionals, any argument of the following form is valid: ϕ → ψ, ( ϕ ∧ ψ ) → χ ∴ ϕ → χ. Here, I present a set of counterexamples to show that there exist invalid arguments of this form. I argue that this data poses serious problems to variably strict accounts of conditionals, as such accounts are structurally unable to accommodate it. Dynamic strict accounts, however, are a different story. While existing dynamic strict (...) accounts do not accommodate the data, they are in principle able to, and I propose a modified dynamic strict account, drawing from von Fintel, that does. The key modification is this: whereas existing dynamic strict accounts take into account only the effects of conditional antecedents in changing the semantic context, the data shows that we must also take into account the effects of conditional consequents in changing the semantic context. (shrink)

This paper develops a contextualist account of certain recalcitrant embedding phenomena with epistemic modals. I focus on three prominent objections to contextualism from embedding: first, that contextualism mischaracterizes subjects’ states of mind; second, that contextualism fails to predict how epistemic modals are obligatorily linked to the subject in attitude ascriptions; and third, that contextualism fails to explain the persisting anomalousness of so-called “epistemic contradictions” in suppositional contexts. Contextualists have inadequately appreciated the force of these objections. Drawing on a more general (...) framework for implementing a contextualist theory, I argue that we can derive the distinctive embedding behavior of epistemic modals from a particular contextualist interpretation of a standard semantics for modals, general mechanisms of local interpretation, and typical features of discourse contexts. Examining embedding phenomena with epistemic modals raises difficult broader issues about conventionalization and pragmatic reasoning, the varieties of context-sensitive language, and the roles of context in interpretation. The paper concludes by briefly examining how the proposed contextualist account compares with certain relativist/expressivist accounts. (shrink)

Kolodny and MacFarlane have made a pioneering contribution to our understanding of how the interpretation of deontic modals can be sensitive to evidence and information. But integrating the discussion of information-sensitivity into the standard Kratzerian framework for modals suggests ways of capturing the relevant data without treating deontic modals as “informational modals” in their sense. I show that though one such way of capturing the data within the standard semantics fails, an alternative does not. Nevertheless I argue that we have (...) good reasons to adopt an information-sensitive semantics of the general type Kolodny and MacFarlane describe. Contrary to the standard semantics, relative deontic value between possibilities sometimes depends on which possibilities are live. I develop an ordering semantics for deontic modals that captures this point and addresses various complications introduced by integrating the discussion of information-sensitivity into the standard semantic framework. By attending to these complexities, we can also illuminate various roles that information and evidence play in logical arguments, discourse, and deliberation. (shrink)

In this paper an approach to the exhaustive interpretation of answers is developed. It builds on a proposal brought forward by Groenendijk and Stokhof (1984). We will use the close connection between their approach and McCarthy's (1980, 1986) predicate circumscription and describe exhaustive interpretation as an instance of interpretation in minimal models, well-known from work on counterfactuals (see for instance Lewis (1973)). It is shown that by combining this approach with independent developments in semantics/pragmatics one can overcome certain limitations of (...) Groenenedijk and Stokhof's (1984) proposal. In the last part of the paper we will provide a Gricean motivation for exhaustive interpretation building on work of Schulz (to appear) and van Rooij and Schulz (2004). (shrink)

Stephen Read presented harmonious inference rules for identity in classical predicate logic. I demonstrate here how this approach can be generalised to a setting where predicate logic has been extended with epistemic modals. In such a setting, identity has two uses. A rigid one, where the identity of two referents is preserved under epistemic possibility, and a non-rigid one where two identical referents may differ under epistemic modality. I give rules for both uses. Formally, I extend Quantified Epistemic Multilateral Logic (...) with two identity signs. I argue that a uniform meaning for identity tout court can be given by adopting Maria Aloni’s account of reference using conceptual covers. We obtain a harmonious set of rules for identity that is sound and complete for Aloni’s model theory. (shrink)

This paper presents an information-based logic that is applied to the analysis of entailment, implicature and presupposition in natural language. The logic is very fine-grained and is able to make distinctions that are outside the scope of classical logic. It is independently motivated by certain properties of natural human reasoning, namely partiality, paraconsistency, relevance, and defeasibility: once these are accounted for, the data on implicature and presupposition comes quite naturally.The logic is based on the family of semantic spaces known as (...) bilattices, originally proposed by Ginsberg (1988), and used extensively by Fitting (1989, 1992). Specifically, the logic is based on a subset of bilattices that I call evidential bilattices, constructed as the Cartesian product of certain algebras with themselves. The specific details of the epistemic agent approach of the logical system is derived from the work of Belnap (1975, 1977), augmented by the use of evidential links for inferencing. An important property of the system is that it has been implemented using an extension of Fitting's work on bilattice logic programming (1989, 1991) to build a model-based inference engine for the augmented Belnap logic. This theorem prover is very efficient for a reasonably wide range of inferences. (shrink)

Todd (2016) proposes an analysis of future-directed sentences, in particular sentences of the form 'will(φ)', that is based on the classic Russellian analysis of definite descriptions. Todd's analysis is supposed to vindicate the claim that the future is metaphysically open while retaining a simple Ockhamist semantics of future contingents and the principles of classical logic, i.e. bivalence and the law of excluded middle. Consequently, an open futurist can straightforwardly retain classical logic without appeal to supervaluations, determinacy operators, or any further (...) controversial semantical or metaphysical complication. In this paper, we will show that this quasi-Russellian analysis of 'will' both lacks linguistic motivation and faces a variety of significant problems. In particular, we show that the standard arguments for Russell's treatment of definite descriptions fail to apply to statements of the form 'will(φ)'. (shrink)

Natural language contains simple lexical items for some but not all Boolean operators. English, for example, contains conjunction and, disjunction or, negated disjunction nor, but no word to express negated conjunction *nand nor any other Boolean connective. Natural language grammar can be described by a logic that expresses what the lexicon can express by its primitives, and the rest compositionally. Such logic for propositional connectives is described here as a bilateral extension of update semantics. The basic intuition is that a (...) context can be updated by assertion or by rejection, and by one or multiple propositions at once. These distinctions suffice to characterize the logic of the lexicon. (shrink)

Given a class \ of models, a binary relation \ between models, and a model-theoretic language L, we consider the modal logic and the modal algebra of the theory of \ in L where the modal operator is interpreted via \. We discuss how modal theories of \ and \ depend on the model-theoretic language, their Kripke completeness, and expressibility of the modality inside L. We calculate such theories for the submodel and the quotient relations. We prove a downward Löwenheim–Skolem (...) theorem for first-order language expanded with the modal operator for the extension relation between models. (shrink)