Brian Rabern

A common view relating compositional semantics and the objects of assertion holds the following: Sentences φ and ψ expresses the same proposition iff φ and ψ have the same modal profile. Following Dummett, Evans, and Lewis, Stanley argues that this view is fundamentally mistaken. According to Dummett, we must distinguish the semantic contribution a sentence makes to more complex expressions in which it occurs from its assertoric content. Stojnić insists that views which distinguish the roles of content and semantic value must nevertheless ensure a tight connection between the two. But, she contends, there is a crucial disanalogy between the views that follow Lewis and the views that follow Dummett. Stanley’s Dummettian view is argued to contain a fatal flaw: On such views, there is no way to secure an appropriate connection between semantic value and a theoretically motivated notion of assertoric content. I will review the background issues from Dummett, Evans, Lewis, and Stanley, and provide a principled way of bridging the gap between semantic value and a theoretically motivated notion of assertoric content.

The semantic paradoxes are often associated with self-reference or referential circularity. Yablo (Analysis 53(4):251–252, 1993), however, has shown that there are infinitary versions of the paradoxes that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality. In this essay, we lay the groundwork for a general investigation into the nature of reference structures that support the semantic paradoxes and the semantic hypodoxes. We develop a functionally complete infinitary propositional language endowed with a denotation assignment and extract the reference structural information in terms of graph-theoretic properties. We introduce the new concepts of dangerous and precarious reference graphs, which allows us to rigorously define the task: classify the dangerous and precarious directed graphs purely in terms of their graph-theoretic properties. Ungroundedness will be shown to fully characterize the precarious reference graphs and fully characterize the dangerous finite graphs. We prove that an undirected graph has a dangerous orientation if and only if it contains a cycle, providing some support for the traditional idea that cyclic structure is required for paradoxicality. This leaves the task of classifying danger for infinite acyclic reference graphs. We provide some compactness results, which give further necessary conditions on danger in infinite graphs, which in conjunction with a notion of self-containment allows us to prove that dangerous acyclic graphs must have infinitely many vertices with infinite out-degree. But a full characterization of danger remains an open question. In the appendices we relate our results to the results given in Cook (J Symb Log 69(3):767–774, 2004) and Yablo (2006) with respect to more restricted sentences systems, which we call $\mathcal{F}$ -systems

At least since Aristotle’s famous 'sea-battle' passages in On Interpretation 9, some substantial minority of philosophers has been attracted to the doctrine of the open future--the doctrine that future contingent statements are not true. But, prima facie, such views seem inconsistent with the following intuition: if something has happened, then (looking back) it was the case that it would happen. How can it be that, looking forwards, it isn’t true that there will be a sea battle, while also being true that, looking backwards, it was the case that there would be a sea battle? This tension forms, in large part, what might be called the problem of future contingents. A dominant trend in temporal logic and semantic theorizing about future contingents seeks to validate both intuitions. Theorists in this tradition--including some interpretations of Aristotle, but paradigmatically, Thomason (1970), as well as more recent developments in Belnap, et. al (2001) and MacFarlane (2003, 2014)--have argued that the apparent tension between the intuitions is in fact merely apparent. In short, such theorists seek to maintain both of the following two theses: (i) the open future: Future contingents are not true, and (ii) retro-closure: From the fact that something is true, it follows that it was the case that it would be true. It is well-known that reflection on the problem of future contingents has in many ways been inspired by importantly parallel issues regarding divine foreknowledge and indeterminism. In this paper, we take up this perspective, and ask what accepting both the open future and retro-closure predicts about omniscience. When we theorize about a perfect knower, we are theorizing about what an ideal agent ought to believe. Our contention is that there isn’t an acceptable view of ideally rational belief given the assumptions of the open future and retro-closure, and thus this casts doubt on the conjunction of those assumptions.

Those who wish to claim that all facts about grounding are themselves grounded (“the meta-grounding thesis”) must defend against the charge that such a claim leads to infinite regress and violates the well-foundedness of ground. In this paper, we defend. First, we explore three distinct but related notions of “well-founded”, which are often conflated, and three corresponding notions of infinite regress. We explore the entailment relations between these notions. We conclude that the meta-grounding thesis need not lead to tension with any of the three notions of “well-founded”. Finally, we explore the details of and motivations for further conditions on ground that one might add to generate a conflict between the meta-grounding thesis and a well-founded constraint. We explore these topics by developing and utilizing a formal framework based on the notion of a grounding structure.

Kaplan (1989) famously claimed that monsters--operators that shift the context--do not exist in English and "could not be added to it". Several recent theorists have pointed out a range of data that seem to refute Kaplan's claim, but others (most explicitly Stalnaker 2014) have offered a principled argument that monsters are impossible. This paper interprets and resolves the dispute. Contra appearances, this is no dry, technical matter: it cuts to the heart of a deep disagreement about the fundamental structure of a semantic theory. We argue that: (i) the interesting notion of a monster is not an operator that shifts some formal parameter, but rather an operator that shifts parameters that play a certain theoretical role; (ii) one cannot determine whether a given semantic theory allows monsters simply by looking at the formal semantics; (iii) theories which forbid shifting the formal "context" parameter are perfectly compatible with the existence of monsters (in the interesting sense). We explain and defend these claims by contrasting two kinds of semantic theory--Kaplan's (1989) and Lewis's (1980).

This essay investigates whether or not we should think that the things we say are identical to the things our sentences mean. It is argued that these theoretical notions should be distinguished, since assertoric content does not respect the compositionality principle. As a paradigmatic example, Kaplan's formal language LD is shown to exemplify a failure of compositionality. It is demonstrated that by respecting the theoretical distinction between the objects of assertion and compositional values certain conflicts between compositionality and contextualism are avoided. This includes the conflict between eternalism and the semantics of tense, the embedding problems for contextualism about epistemic modals and taste claims, and the conflict between direct reference and the semantics of bound pronouns (and monstrous operators). After presenting the theoretical picture which distinguishes assertoric content from compositional semantic value, some objections to the picture are addressed. In so doing, the objection from King (2003) stemming from apparent complications with the interaction of temporal expressions and attitude reports is assessed and shown to be non-threatening.