We have a propositional language \(\mathcal {L}\) with an indefinitely large set \(\mathcal {L}_{AT}\) of atomic formulas, p, q, r (\(p_{1}, p_{2}, ...\)). We have negation \(\lnot\), conjunction \(\wedge\), disjunction \(\vee\), a conditional \(\rightarrow\), square and round brackets, [, ], (, ). We use A, B, C, ..., as metavariables for formulas of \(\mathcal {L}\). The well-formed formulas are items in \(\mathcal {L}_{AT}\) and, if A and B are formulas:
$$\begin{aligned} \lnot A \ | \ (A \wedge B) \ | \ (A \vee B) \ | \ (A \rightarrow B) \ | \ [A]B \end{aligned}$$
(Outermost brackets are normally omitted.) We can then identify \(\mathcal {L}\) with the set of its well-formed formulas. Expressions of the form “[A]” are to be thought of as sententially indexed modal operators [the idea goes back to Chellas (1975)]. We will consider specific acts of imagination performed by conceiving agents on specific occasions, and characterized by an explicit input—what the agent sets out to imagine—directly given by a formula of \(\mathcal {L}\). If K is the set of formulas standing for possible explicit inputs, then for \(A \in K\), [A] is the corresponding modal. We read “[A]B” as “It is imagined in the act whose explicit input is A, that B” or, more tersely, “It is imagined in act A that B”.Footnote 8
We may or may not want to have \(K = \mathcal {L}\) (hence K is flagged separately). One may, for instance, take into account finitary constraints on the agent, to the effect that it just cannot explicitly represent contents expressed by formulas above a certain level of logical complexity. How to circumscribe K accordingly may be a substantive task, depending on the desired constraints. I just mention that for \(K \subset \mathcal {L}\), one would put a corresponding restriction directly in the syntax of the language, allowing “[A]B” to be well-formed only for \(A \in K\).
As for the semantics: if subject matter is “an independent factor in meaning, constrained but not determined by truth conditions” (Yablo 2014, p. 2), then one way to model it is to combine a truth-conditional, possible worlds setting with a structure of contents, as it happens in works on analytic implication such as Urquhart (1973), Fine (1986). A frame for \(\mathcal {L}\) is a tuple \(\mathfrak {F}\) = \(\langle W, \{R_{A} \ | \ A \in K\}, \mathcal {C}, \oplus , c \rangle\), understood as follows. W is a set of possible worlds. \(\{R_{A} \ | \ A \in K\}\) is a set of accessibilities between worlds, where each \(A \in K\) has its own \(R_{A} \subseteq W \times W\). \(\mathcal {C}\) is a finite set of contents (finiteness complies with the idea that a real conceiving agent will only have at most a finite amount of concepts at its disposal). Contents are the situations intentional acts of imagination are about. In the metalanguage we use variables \(w, w_{1}, w_{2}, ...\), ranging over possible worlds, \(x, y, z \ (x_{1}, x_{2}, ...)\), ranging over contents, as well as the symbols \(\Rightarrow , \Leftrightarrow , \& , or, \sim , \forall , \exists\), with the usual reading. \(\oplus\) is content fusion, a binary operation on \(\mathcal {C}\) making of contents part of larger contents and satisfying, for all \(xyz \in \mathcal {C}\):
-
(Idempotence) \(x \oplus x = x\)
-
(Commutativity) \(x \oplus y = y \oplus x\)
-
(Associativity) \((x \oplus y) \oplus z = x \oplus (y \oplus z)\)
We assume unrestricted fusion, that is, \(\oplus\) is always defined on \(\mathcal {C}\): \(\forall xy \in \mathcal {C} \ \exists z \in \mathcal {C} (z = x \oplus y)\). We then define content parthood, \(\le\), the usual way: \(\forall xy \in \mathcal {C} (x \le y \Leftrightarrow x \oplus y = y)\). This makes of parthood a partial ordering—for all \(xyz \in \mathcal {C}\):
-
(Reflexivity) \(x \le x\)
-
(Antisymmetry) \(x \le y \ \& \ y \le x \Rightarrow x = y\)
-
(Transitivity) \(x \le y \ \& \ y \le z \Rightarrow x \le z\)
Thus, \(\langle \mathcal {C}, \oplus \rangle\) is a join semilattice and, because \(\mathcal {C}\) is finite, it is also complete: any set of contents \(S \subseteq \mathcal {C}\) has a fusion \(\oplus S\). We can think of all contents in \(\mathcal {C}\) as built via fusions out of atoms, contents with no proper parts: \(Atom(x) \Leftrightarrow \ \sim \exists y (y < x)\), with < the strict order defined from \(\le\).
Our c in \(\mathfrak {F}\) above is a function \(c: \mathcal {L}_{AT} \rightarrow \mathcal {C}\), such that if \(p \in \mathcal {L}_{AT}\), then \(c(p) \in \{x \in \mathcal {C} | Atom(x)\}\): atomic contents are assigned to atomic formulas (this is an idealization, for grammatically simple sentences of ordinary language can be about intuitively complex contents; but it will streamline the discussion below). Next, c is extended to the whole of \(\mathcal {L}\) as follows. if \({\mathfrak{At}}A = \{p_{1}, ..., p_{n}\}\), the set of atoms in A, then:
$$\begin{aligned} c(A) = \oplus {\mathfrak{At}}A = c(p_{1}) \oplus ... \oplus c(p_{n}) \end{aligned}$$
Intuitively, a formula is about whatever its atoms taken together are about. This mereology of contents tracks syntactic structure only so far. It entails, by induction on the construction of formulas, not only that \(c(A) = c(\lnot \lnot A)\) (recall Frege on the Sinn-preservation of Double Negation), but also that \(c(A) = c(\lnot A)\): a formula is about what its negation is about. And not only \(c(A \wedge B) = c(B \wedge A)\), but also, e.g., \(c(A \wedge B) = c(A) \oplus c(B) = c(A \vee B)\). These are often taken as requirements for aboutness—or content-inclusion in the literature [e.g., in Yablo (2014, p. 42), Fine (2015, p. 11)]. As we will see, this will not entail that imagining that \(A \wedge B\) is the same as imagining that \(A \vee B\). The two acts will be about the same stuff, but the stuff will be imagined in two quite different ways.
A frame becomes a model \(\mathfrak {M}\) = \(\langle W, \{R_{A} \ | \ A \in K\}, \mathcal {C}, \oplus , c, \,\Vdash\, \rangle\) when endowed with an interpretation \(\,\Vdash \subseteq W \times \mathcal {L}_{AT}\). This relates worlds to atoms: we read “\(w \,\Vdash\, p\)” as meaning that p is true at w, “\(w \,\nVdash\, p\)” as \(\sim w\,\Vdash\, p\). Next, \(\Vdash\) is extended to all formulas of \(\mathcal {L}\) as follows:
-
(S\(\lnot\)) \(w \,\Vdash\, \lnot A \Leftrightarrow w \,\nVdash\, A\)
-
(S\(\wedge\)) \(w \,\Vdash\, A \wedge B \Leftrightarrow w \,\Vdash\, A \ \& \ w \,\Vdash\, B\)
-
(S\(\vee\)) \(w \,\Vdash\, A \vee B \Leftrightarrow w \,\Vdash\, A \ or \ w \,\Vdash\, B\)
-
(S\(\rightarrow\)) \(w \,\Vdash\, A \rightarrow B \Leftrightarrow \forall w_{1}(w_{1} \,\Vdash\, A \Rightarrow w_{1} \,\Vdash\, B)\)
-
(S[A]) \(w \,\Vdash\, [A]B \Leftrightarrow \forall w_{1}(wR_{A}w_{1} \Rightarrow w_{1} \,\Vdash\, B) \ \& \ c(B) \le c(A)\)
Read “\(wR_{A}w_{1}\)” as meaning that \(w_{1}\) is accessed by an act of imagination with explicit input A, obtaining at w. It is vital that accessibilities be input-indexed: acts with different explicit inputs will have the conceiving agent look at different sets of worlds. (S[A]) can be equivalently expressed using set-selection functions [inspired by Lewis (1973)]. Each \(A \in K\) has a function \(f_{A}: W \rightarrow \mathcal {P}(W)\), taking as input the world where the act obtains and giving as output the set of worlds accessible via that act, \(f_{A}(w) = \{w_{1} \in W | wR_{A}w_{1} \}\). If \(|A| = \{w \in W | w \,\Vdash\, A\}\), we can compactly rephrase the clause for [A] as:
The two formulations are equivalent since \(wR_{A}w_{1} \Leftrightarrow w_{1} \in f_{A}(w)\). However, it will sometimes be easier to make a point using either formulation rather than the other. Set-selection functions can also tersely express a natural Basic Constraint on the semantics – that for all \(A \in K\) and \(w \in W\):
$$\begin{aligned} \hbox {(BC) }f_{A}(w) \subseteq |A| \end{aligned}$$
This is equivalent to \(\forall w_{1}(wR_{A}w_{1} \Rightarrow w_{1} \,\Vdash\, A)\), thus BC says that all the A-accessible worlds will be A-worlds: worlds making the explicit input A true. Besides being intrinsically plausible, this will come in handy to prove a number of results below. From now on, we will only consider models satisfying BC.
For [A]B to come out true we ask, thus, two things at once. Firstly, we have a truth-conditional requirement: that B be true throughout a selected set of worlds making (by BC) the explicit input A true. Secondly, we have an aboutness requirement: that B allows no content alien to A to sneak in.
Finally, we define logical consequence the standard way, as truth preservation at all worlds of all (admissible) models. With \(\Sigma\) a set of formulas:
\(\Sigma \,\vDash\, B \Leftrightarrow\) in all models \(\mathfrak {M}\) = \(\langle W, \{R_{A} \ | \ A \in K\}, \mathcal {C}, \oplus , c, \,\Vdash\, \rangle\) and for all \(w \in W\): \(w \,\Vdash\, A\) for all \(A \in \Sigma \Rightarrow w \,\Vdash\, B\)
For single-premise entailment, we will write \(A \,\vDash\, B\) for \(\{A\} \,\vDash\, B\). As a special case, logical validity, \(\,\vDash\, A\), truth at all worlds of all admissible models, is \(\emptyset \,\vDash\, A\), entailment by the empty set of premisses.
The logic induced by the semantics for the extensional operators is just classical propositional, with \(\rightarrow\) a strict S5-like conditional. The novelty comes with [A]B, whose logical and aboutness features we are now going to unpack.