Crosslinguistically, causative constructions conform to the following generalization: If the causal relation is syntactically concealed, then it is semantically direct. Concealed causatives span a wide syntactic spectrum, ranging from resultative complements in English to causative subjects in Miskitu. A unified type-driven theory is proposed which attributes the understood causal relation—and other elements of constructional meaning—to type lifting operations predictably licensed by type mismatch at LF. The proposal has far-reaching theoretical implications not only for the theory of compositionality and causation, but (...) also for the underlying theory of events, space, and time, in natural language discourse. (shrink)

I present two Triviality results for Kratzer's standard “restrictor” analysis of indicative conditionals. I both refine and undermine the common claim that problems of Triviality do not arise for Kratzer conditionals since they are not strictly conditionals at all.

Kratzer semantics for modals and conditionals generates the prediction that sentences of the form if p, ought p are trivially true. As Frank and Zvolenszky show, for certain flavors of modality, like deontic modality, this prediction is false. I explain some conservative solutions to the problem, and then argue that they are inadequate to account for puzzle cases involving self-frustrating oughts. These cases illustrate a general problem: there are two forms of information-sensitivity in deontic modals. Even generalizations of Kratzer semantics (...) that predict these two roles for information, e.g. Kolodny and MacFarlane, predict that they vary together. I propose a generalization of Kratzer semantics that allows the two roles for information to vary independently of each other. (shrink)

This paper considers some questions related to the determination of epistemic modal domains. Specifically, given situations in which groups of agents have epistemic states that bear on a modal domain, how is the domain best restricted? This is a metasemantic project, in which I combine a standard semantics for epistemic modals, as developed by Kratzer, with a standard story about conversational dynamics, as developed by Stalnaker. I show how a standard framework for epistemic logic can model their interaction. I contend (...) that if groups have epistemic states that bear on the modal domain, as the data suggests, then careful attention must be paid to the method of combination selected for the epistemic states of the individuals within the group. Specifically, there should be some explanation of the flow of information in a group-deliberative setting. Through this study we find a novel explanation of modal disagreement and uptake. (shrink)

Epistemic modals in consequent place of indicative conditionals give rise to apparent counterexamples to Modus Ponens and Modus Tollens. Familiar assumptions of fa- miliar truth conditional theories of modality facilitate a prima facie explanation—viz., that the target cases harbor epistemic modal equivocations. However, these explana- tions go too far. For they foster other predictions of equivocation in places where in fact there are no equivocations. It is argued here that the key to the solution is to drop the assumption that (...) modal claims are inherently relational (i.e., that they ex- press a logical relation between a prejacent and a premise-set) in favor of a view that treats them as inherently quantificational. In particular it is suggested that modals are mass noun descriptions of information. We demonstrate how this approach unlocks the equivocation problem. (shrink)

Ways of Scope Taking is concerned with syntactic, semantic and computational aspects of scope. Its starting point is the well-known but often neglected fact that different types of quantifiers interact differently with each other and other operators. The theoretical examination of significant bodies of data, both old and novel, leads to two central claims. (1) Scope is a by-product of a set of distinct Logical Form processes; each quantifier participates in those that suit its particular features. (2) Scope interaction is (...) further constrained by the semantics of the interacting operators. The arguments are developed using Minimalist syntax, Generalized Quantify theory, Discourse Representation Theory, and algebraic semantics. The contributors (Beghelli, Ben-Shalom, Doetjes, Farkas, Gutiérrez Rexach, Honcoop, Stabler, Stowell, Szabolcsi and Zwarts) make tightly related theoretical assumptions and focus on related empirical phenomena, which include the direct and inverse scope of quantifiers, distributivity, negation, modal and intensional contexts, weak islands, event-related readings, interrogatives, wh/quantifier interactions, and Hungarian syntax. An introduction to the formal semantics background is provided. Audience: Linguists, philosophers, computational and psycholinguists; advanced undergraduates, graduate students and researchers in these fields. (shrink)

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

The 2007 edition of the Amsterdam Colloquium is the Sixteenth in a series which started in 1976. Originally, the Amsterdam Colloquium was an initiative of the Department of Philosophy of the University of Amsterdam. Since 1984 the Colloquium is organized by the Institute for Logic, Language and Computation (ILLC) of the University of Amsterdam.

The natural interpretation of counterfactuals with disjunctive antecedents involves selecting from each of the disjuncts the worlds that come closest to the world of evaluation. It has been long noticed that capturing this interpretation poses a problem for a minimal change semantics for counterfactuals, because selecting the closest worlds from each disjunct requires accessing the denotation of the disjuncts from the denotation of the disjunctive antecedent, which the standard boolean analysis of or does not allow (Creary and Hill, Philosophy of (...) Science 43:341–344, 1975; Nute, Journal of Philosophy 72:773–778, 1975; Fine, Mind 84(335):451–458, 1975; Ellis et al. Journal of Philosophical Logic 6:335–357, 1977). This paper argues that the failure to capture the natural interpretation of disjunctive counterfactuals provides no reason to abandon a minimal change semantics. It shows that the natural interpretation of disjunctive counterfactuals is expected once we refine our assumptions about the semantics of or and the logical form of conditionals, and (i) we assume that disjunctions introduce propositional alternatives in the semantic derivation, in line with independently motivated proposals about the semantics of or (Aloni, 2003a; Simons, Natural Language Semantics 13:271–316, 2005; Alonso-Ovalle, Disjunction in Alternative Semantics. PhD thesis, 2006); and (ii) we treat conditionals as correlative constructions, as advocated in von Fintel (1994), Izvorski (Proceedings of NELS 26, 1996), Bhatt and Pancheva (2006), and Schlenker (2004). (shrink)

This essay aims to vindicate the thesis that cognitive computational properties are abstract objects implemented in physical systems. I avail of Voevodsky's Univalence Axiom and function type equivalence in Homotopy Type Theory, in order to specify an abstraction principle for epistemic (hyper-)intensions. The homotopic abstraction principle for epistemic (hyper-)intensions provides an epistemic conduit for our knowledge of (hyper-)intensions as abstract objects. Higher observational type theory might be one way to make first-order abstraction principles defined via inference rules, although not higher-order (...) abstraction principles, computable. The truth of my first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable i.e. Turing computable and the Turing machine being physically implementable. Epistemic modality and hyperintensionality can thus be shown to be both a compelling and a materially adequate candidate for the fundamental structure of mental representational states, comprising a fragment of the language of thought. (shrink)

We introduce an expected-value theory of linguistic modality that makes reference to expected utility and a likelihood-based confirmation measure for deontics and epistemics, respectively. The account is a probabilistic semantics for deontics and epistemics, yet it proposes that deontics and epistemics share a common core modal semantics, as in traditional possible-worlds analysis of modality. We argue that this account is not only theoretically advantageous, but also has far-reaching empirical consequences. In particular, we predict modal versions of reasoning fallacies from the (...) heuristics and biases literature. Additionally, we derive the modal semantics in an entirely transparent manner, as it is based on the compositional semantics of Korean modal expressions that are morphosyntactically decomposed into a conditional and an evaluative predicate. (shrink)

This paper investigates the metaphysics in higher-order counterfactual logic. I establish the necessity of identity and distinctness and show that the logic is committed to vacuism, which entails that all counteridenticals are true. I prove the Barcan, Converse Barcan, Being Constraint and Necessitism. I then show how to derive the Identity of Indiscernibles in counterfactual logic. I study a form of maximalist ontology which has been claimed to be so expansive as to be inconsistent. I show that it is equivalent (...) to the collapse of the counterfactual into the material conditional---which is itself equivalent to the modal logic TRIV. TRIV is consistent, from which it follows that maximalism is, surprisingly, consistent. I close by arguing that stating the limit assumption requires a higher-order logic. (shrink)

A counterpossible is a counterfactual whose antecedent is impossible. The vacuity thesis says all counterpossibles are true solely because their antecedents are impossible. Recently, some have rejected the vacuity thesis by citing purported non-vacuous counterpossibles in science. One limitation of this work, however, is that it is not grounded in experimental data. Do scientists actually reason non-vacuously about counterpossibles? If so, what is their basis for doing so? We presented biologists (N = 86) with two counterfactual formulations of a well-known (...) model in biology, the antecedents of which contain what many philosophers would characterize as a metaphysical impossibility. Participants consistently judged one counterfactual to be true, the other to be false, and they explained that they formed these judgments based on what they perceived to be the mathematical relationship between the antecedent and consequent. Moreover, we found no relationship between participants’ judgments about the (im)possibility of the antecedent and whether they judged a counterfactual to be true or false. These are the first experimental results on counterpossibles in science with which we are familiar. We present a modal semantics that can capture these judgments, and we deal with a host of potential objections that a defender of the vacuity thesis might make. (shrink)

This is the second part of a two-part series on the logic of hyperlogic, a formal system for regimenting metalogical claims in the object language (even within embedded environments). Part A provided a minimal logic for hyperlogic that is sound and complete over the class of all models. In this part, we extend these completeness results to stronger logics that are sound and complete over restricted classes of models. We also investigate the logic of hyperlogic when the language is enriched (...) with hyperintensional operators such as counterfactual conditionals and belief operators. (shrink)

This paper is about two controversial inference-patterns involving counterfactual or subjunctive conditionals. Given a plausible assumption about the truth-conditions of counterfactuals, it is shown that one can't go wrong in applying hypothetical syllogism (i.e., transitivity) so long as the set of worlds relevant for the conclusion is a subset of the sets of worlds relevant for the premises. It is also shown that one can't go wrong in applying antecedent strengthening so long as the set of worlds relevant for the (...) conclusion is a subset of that for the premise. These results are then adapted to Lewis's theory of counterfactuals. (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)

A counterpossible is a counterfactual with an impossible antecedent. Counterpossibles present a puzzle for standard theories of counterfactuals, which predict that all counterpossibles are semantically vacuous. Moreover, counterpossibles play an important role in many debates within metaphysics and epistemology, including debates over grounding, causation, modality, mathematics, science, and even God. In this article, we will explore various positions on counterpossibles as well as their potential philosophical consequences.

The paper defends a variant of the material implication approach to the meaning of conditional sentences against some arguments that are considered to be widely subscribed to and/or important in the philosophical, psychological and linguistic literature. These arguments are shown to be wrong, debatable, or to miss their aim if the truth conditions defining material implication are viewed as determining nothing but the denotation of conditional sentences and if the function of conditional sentences in deduction (logic) is focused on rather (...) than in inferencing (reasoning). It is shown that some ‘paradoxes of material implication’ are due to inconsistent premises of deductions introduced by semantic relations between clauses constituting the premises, a fact which does not invalidate the approach. Other ‘paradoxes’ are shown to arise because they are based on uninformative deductions, violating a basic pragmatic principle. In addition, the paper introduces the distinction between the set of possible states of a mental model of the actual world and of alternative worlds. It is argued that material implication determines the denotation of an indicative conditional as a subset of the former set and the denotation of a subjunctive conditional as a subset of the latter set, thus unifying these two types of conditionals. (shrink)

This paper aims to provide a mathematically tractable background against which to model both modal and hyperintensional cognitivism and modal and hyperintensional expressivism. I argue that epistemic modal algebras, endowed with a hyperintensional, topic-sensitive epistemic two-dimensional truthmaker semantics, comprise a materially adequate fragment of the language of thought. I demonstrate, then, how modal expressivism can be regimented by modal coalgebraic automata, to which the above epistemic modal algebras are categorically dual. I examine five methods for modeling the dynamics of conceptual (...) engineering for intensions and hyperintensions. I develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic epistemic two-dimensional hyperintensional semantics. I examine then the virtues unique to the modal and hyperintensional expressivist approaches here proffered in the setting of the foundations of mathematics, by contrast to competing approaches based upon both the inferentialist approach to concept-individuation and the codification of speech acts via intensional semantics. (shrink)

This paper aims to provide a mathematically tractable background against which to model both modal cognitivism and modal expressivism. I argue that epistemic modal algebras comprise a materially adequate fragment of the language of thought. I demonstrate, then, how modal expressivism can be regimented by modal coalgebraic automata, to which the above epistemic modal algebras are dual. I examine, in particular, the virtues unique to the modal expressivist approach here proffered in the setting of the foundations of mathematics, by contrast (...) to competing approaches based upon both the inferentialist approach to concept-individuation and the codification of speech acts via intensional semantics. (shrink)

This paper has three main goals. First, to motivate a puzzle about how ignorance-expressing terms like maybe and if interact: they iterate, and when they do they exhibit scopelessness. Second, to argue that there is an ambiguity in our theoretical toolbox, and that exposing that opens the door to a solution to the puzzle. And third, to explore the reach of that solution. Along the way, the paper highlights a number of pleasing properties of two elegant semantic theories, explores some (...) meta-theoretic properties of dynamic notions of meaning, dips its toe into some hazardous waters, and offers characterization theorems for the space of meanings an indicative conditional can have. (shrink)

Several theists, including Linda Zagzebski, have claimed that theism is somehow committed to nonvacuism about counterpossibles. Even though Zagzebski herself has rejected vacuism, she has offered an argument in favour of it, which Edward Wierenga has defended as providing strong support for vacuism that is independent of the orthodox semantics for counterfactuals, mainly developed by David Lewis and Robert Stalnaker. In this paper I show that argument to be sound only relative to the orthodox semantics, which entails vacuism, and give (...) an example of a semantics for counterfactuals countenancing impossible worlds for which it fails. (shrink)

A counterpossible conditional is a counterfactual with an impossible antecedent. Common sense delivers the view that some such conditionals are true, and some are false. In recent publications, Timothy Williamson has defended the view that all are true. In this paper we defend the common sense view against Williamson’s objections.

This paper aims to vindicate the thesis that cognitive computational properties are abstract objects implemented in physical systems. I avail of the equivalence relations countenanced in Homotopy Type Theory, in order to specify an abstraction principle for epistemic intensions. The homotopic abstraction principle for epistemic intensions provides an epistemic conduit into our knowledge of intensions as abstract objects. I examine, then, how intensional functions in Epistemic Modal Algebra are deployed as core models in the philosophy of mind, Bayesian perceptual psychology, (...) and the program of natural language semantics in linguistics, and I argue that this provides abductive support for the truth of homotopic abstraction. Epistemic modality can thus be shown to be both a compelling and a materially adequate candidate for the fundamental structure of mental representational states, comprising a fragment of the Language of Thought. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...) propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. Elohim develops a novel, topic-sensitive truthmaker semantics for dynamic epistemic logic, and develops a novel, dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for two-dimensional (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} is availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between Elohim's hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. Elohim countenances a hyperintensional semantics for novel epistemic abstractionist modalities. Elohim suggests, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for two-dimensional hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. Elohim invents a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Elohim provides a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...) propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. Elohim develops a novel, topic-sensitive truthmaker semantics for dynamic epistemic logic, and develops a novel, dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for two-dimensional (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} is availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between Elohim's hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. Elohim countenances a hyperintensional semantics for novel epistemic abstractionist modalities. Elohim suggests, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for two-dimensional hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. Elohim invents a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Elohim provides a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

Epistemic modals in consequent place of indicative conditionals give rise to apparent counterexamples to Modus Tollens. Familiar assumptions behind familiar truth conditional theories of embedded modality facilitate a prima facie explanation—viz., that the target cases harbor epistemic modal equivocations. However, this sort of explanation goes too far. It fosters other predictions of equivocation in places where in fact there are none. It is argued that the solution is to drop the credo that modal claims are inherently relational in favor of (...) a view that treats them as inherently quantificational. In particular it is suggested that epistemic modals express covert mass noun descriptions of information of the form “the actionable information stands in logical relation L to prejacent p”. We demonstrate how this approach unlocks the equivocation problem. (shrink)

The connection between the probabilities of conditionals and the corresponding conditional probabilities has long been explored in the philosophical literature, but its implementation faces both technical obstacles and objections on empirical grounds. In this paper I ?rst outline the motivation for the probabilistic turn and Lewis’ triviality results, which stand in the way of what would seem to be its most straightforward implementation. I then focus on Richard Jeffrey’s ’random-variable’ approach, which circumvents these problems by giving up the notion that (...) conditionals denote propositions in the usual sense. Even so, however, the random-variable approach makes counterintuitive predictions in simple cases of embedded conditionals. I propose to address this problem by enriching the model with an explicit representation of causal dependencies. The addition of such causal information not only remedies the shortcomings of Jeffrey’s conditional, but also opens up the possibility of a uni?ed probabilistic account of indicative and counterfactual conditionals. (shrink)

Indicative and subjunctive conditionals are in non-complimentary distribution: there are conversational contexts at which both are licensed (Stalnaker 1975; Karttunen and Peters 1979; von Fintel 1998). This means we can ask an important, but under-explored, question: in contexts which license both, what relations hold between the two? In this paper, I’ll argue for an initially surprising conclusion: when attention is restricted to the relevant contexts, indicatives and subjunctives are co-entailing. §1 introduces the indicative/subjunctive distinction, along with a discussion of the (...) relevant notion of entailment; §2 presents the main argument of the paper, and §3 considers some of the philosophical implications of the argument in §2. Finally, §4 argues that we can reconcile the equivalence of indicatives and subjunctives with apparently conflicting judgements. (shrink)

In a recent paper, Pruss proves the validity of the rule beta-2 relative to Lewis’s semantics for counterfactuals, which is a significant step forward in the debate about the consequence argument. Yet, we believe there remain intuitive counter-examples to beta-2 formulated with the actuality operator and rigidified descriptions. We offer a novel and two-dimensional formulation of the Lewisian semantics for counterfactuals and prove the validity of a new transfer rule according to which a new version of the consequence argument can (...) be formulated. This new transfer rule is immune to the counter-examples involving the actuality operator and rigidified descriptions. However, we show that counter-examples to this new rule can also be generated, demanding that the Lewisian semantics be generalized for higher dimensions where counter-examples can always be generated. (shrink)

Higginbotham (1986) observed that quantified conditionals have a stronger meaning than might be expected, as attested by the apparent equivalence of examples like No student will pass if he goofs off and Every student will fail if he goofs off. Higginbotham's observation follows straightforwardly given the validity of conditional excluded middle (CEM; as observed by von Fintel & Iatridou 2002), and as such could be taken as evidence thereof (e.g. Williams forthcoming). However, the empirical status of CEM has been disputed, (...) and it is invalid under many prominent theories of conditionals—notably Lewis (1973) for counterfactuals, also Kratzer (1979, 1991). More acutely, Higginbotham's observation holds even for quantified counterparts of conditionals that appear not to obey CEM (Higginbotham 2003), and the standard way of explaining (away) such apparent counterexamples to the principle, à la Stalnaker (1981), does not directly yield an account of our apparent truth-conditional intuitions about the quantified counterparts (Leslie 2009). This article provides an explanation for the latter intuitions within Stalnaker's framework, the upshot being that CEM does remain a viable explanation, in principle, for Higginbotham's observation. (shrink)

In this dissertation I provide a novel logic of the ordinary-language conditional. First, however, I endeavor to make clearer and more precise just what the objects of the study of the conditional are, as a lack of clarity as to what counts as an instance of a given category of conditional has resulted in deep and significant confusions in subsequent analysis. I motivate for a factual/counterfactual distinction, though not at the level of particular instances of the conditional. Instead, I argue (...) that each individual instance of the conditional may be interpreted either factually or counterfactually, rather than these instances dividing into distinct types. I examine the classic Oswald–Kennedy pair of sentences, typically taken to be the quintessential example of how conditionals must be split into two different categories, to show that they in fact do not demonstrate this. I then present my account of the logic underlying the ordinary-language conditional, the system C3, and a justification of the form it takes. This logic provides distinct interpretations of the conditional as it concerns what is factual or what is counterfactual, respectively. The factual interpretation is true when both antecedent and consequent are true at the actual world, false when the antecedent is true and consequent false, and not truth-apt otherwise. The counterfactual interpretation incorporates a ceteris paribus clause, ensuring that it is not falsified by extraordinary, unforeseeable occurrences, and is true when, at all worlds at which the antecedent is ceteris paribus true, the consequent too is true. It is false when, at any of these worlds the consequent is false; and not truth-apt otherwise. I go on to examine alternative theories of the conditional—from the suppositionalist approach to evaluating the putative indicative conditional, to Stalnaker’s combined indicative and counterfactual account, and Lewis’s analysis of the counterfactual; among a number of others—and offer comparison to my own theory. Finally, I look at various challenges to my account of the conditional. Being a strict conditional (albeit variably so), that of C3 is open to the objection that it fails to match ordinary speakers’ intuitions as regards its truth-value assignments to, for instance, conditionals with necessarily true consequents. I address these so- called paradoxes of the strict conditional, and also discussion the question of truth-preservation in the C3 system in the case of such inferences as those relying on transitivity and that of modus ponens. I maintain that these inferences are indeed truth-preserving under certain, specifiable, conditions, and I close by offering possible avenues for further research. (shrink)

We carry out the Karttunen-Stalnaker pragmatic account of presupposition projection within a state-of-the art version of dynamic epistemic logic. It turns out that the basic projection facts can all be derived from a Gricean maxim ‘be informative’. This sheds light on a recent controversy on the appropriateness of dynamic semantics as a tool for analysing presupposition.

I develop a challenge for a widely suggested knowledge-first account of belief that turns, primarily, on unknowable propositions. I consider and reject several responses to my challenge and sketch a new knowledge-first account of belief that avoids it.

There is a renewed debate about modus ponens. Strikingly, the recent counterexamples in Cantwell, Dreier and MacFarlane and Kolodny are generated by restricted readings of the ‘if’-clause. Moreover, it can be argued on general grounds that the restrictor view of conditionals developed in Kratzer and Lewis leads to counterexamples to modus ponens. This paper provides a careful analysis of modus ponens within the framework of the restrictor view. Despite appearances to the contrary, there is a robust sense in which modus (...) ponens is valid, owing to the fact that conditionals do not only allow for restricted readings but have bare interpretations, too. (shrink)

The pattern of credences we are inclined to assign to counterfactuals challenges standard accounts of counterfactuals. In response to this problem, the paper develops a semantics of counterfactuals in terms of the epsilon-operator. The proposed semantics stays close to the standard account: the epsilon-operator substitutes the universal quantifier present in standard semantics by arbitrarily binding the open world-variable. Various applications of the suggested semantics are explored including, in particular, an explanation of how the puzzling credences in counterfactuals come about.

Weak ontic necessity is the ontic necessity expressed by “should” or “ought to”. An example of it is “I should be dead by now”. A feature of this necessity is that whether it holds is irrelevant to whether its underlying proposition holds. This necessity essentially involves time. This paper presents a logic for conditional weak ontic necessity in branching time. The logic’s language includes the next instant operator, the last instant operator, and the operator for conditional weak ontic necessity. Formulas (...) are evaluated at tuples consisting of a tree-based model, a context, a timeline, and an instant. A context is a set of ordered ontic laws determining expected timelines. When evaluating conditional weak ontic necessity, we first update the context with the antecedent, then check whether the consequent holds with respect to the updated context. We discuss some consequences of the formalization and compare it to some related work. We study the logic’s expressivity and axiomatize a special validity of it. (shrink)

This is the second part of a two-part series on the logic of hyperlogic, a formal system for regimenting metalogical claims in the object language (even within embedded environments). Part A provided a minimal logic for hyperlogic that is sound and complete over the class of all models. In this part, we extend these completeness results to stronger logics that are sound and complete over restricted classes of models. We also investigate the logic of hyperlogic when the language is enriched (...) with hyperintensional operators such as counterfactual conditionals and belief operators. (shrink)

Weak ontic necessity is the ontic necessity expressed by “should/ought to” in English. An example of it is “I should be dead by now”. A feature of this necessity is that whether it holds at the present world is irrelevant to whether its prejacent holds at the present world. In this paper, by combining premise semantics and update semantics for conditionals, we present a logical theory for conditional weak ontic necessity based on context update. A context is a set of (...) ordered defaults, determining expected possible states of the present world. Sentences are evaluated with respect to contexts. When evaluating the conditional weak ontic necessity with respect to a context, we first update the context with the antecedent, then check whether the consequent holds with respect to the updated context. We compare this theory to some related works. The logic’s expressivity is studied. (shrink)

Proves Completeness for the Evidential Conditional.

The exclusive component of unembedded disjunctions is standardly derived as a conversational implicature by assuming that or forms a lexical scale with and. It is well known, however, that this assumption does not suffice to determine the required scalar competitors of disjunctions with more than two atomic disjuncts (McCawley, Everything that linguists have always wanted to know about logic* (But were ashamed to ask). Chicago University Press, Chicago, 1993, p. 324; Simons, “Or”: Issues in the semantics and pragmatics of disjunction. (...) Ph.D. thesis, Cornell University, Ithaca, NY, 1998). To solve this, Sauerland (Linguist Philos 27(3): 367–391, 2004) assumes that or forms a lexical scale with two otherwise unattested silent connectives ( ${\mathbb{L}}$ and ${\mathbb{R}}$ ) that retrieve the left and right terms of a disjunction. A number of recent works have proposed an Alternative Semantics for indefinites and disjunction to account for their interaction with modals and other propositional operators (Kratzer and Shimoyama, In: Otsu Y (ed) The Proceedings of the Third Tokyo Conference on Psycholinguistics. Hituzi Syobo, Tokyo, pp. 1–25, 2002; Aloni, In: Weisgerber M (ed) Proceedings of the Conference “SuB7—Sinn und Bedeutung”. Arbeitspapier Nr. 114. Konstanz, pp. 28–37, 2003; Simons, Nat Lang Semantics 13: 271–316, 2005; Alonso-Ovalle, Disjunction in alternative semantics. Ph.D. thesis, University of Massachusetts, Amherst, MA, 2006). We note that the McCawley–Simons problem does not arise in an Alternative Semantics, if we assume that the set of pragmatic competitors to a disjunction is the closure under intersection of the set of propositions that it denotes. An adaptation of the strengthening mechanism presented in Fox (In: Sauerland U, Stateva P (eds) Presupposition and implicature in compositional semantics. MacMillan, Palgrave, pp. 71–120, 2007) allows for the derivation of the exclusive component of disjunctions with more than two atomic disjuncts without having to rely on the ${\mathbb{L}}$ and ${\mathbb{R}}$ operators. The proposal extends to the case of disjunctions with logically dependent disjuncts. (shrink)