Actualism and Modal Semantics

According to actualism, modal reality is constructed out of valuations (combinations of truth values for all propositions). According to possibilism, modal reality consists in a set of possible worlds, conceived as independent objects that assign truth values to propositions. According to possibilism, accounts of modal reality can intelligibly disagree with each other even if they agree on which valuations are contained in modal reality. According to actualism, these disagreements ( possibilist disagreements ) are completely unintelligible. An essentially actualist semantics for modal propositional logic specifies which sets of valuations are compatible with the meanings of the truth-functional connectives and modal operators without drawing on formal resources that would enable us to represent possibilist disagreements. The paper discusses the availability of an essentially actualist semantics for modal propositional logic. I argue that the standard Kripkean semantics is not essentially actualist and that other extant approaches also fail to provide a satisfactory essentially actualist semantics. I end by describing an essentialist actualist semantics for modal propositional logic.

is the view that if there are any true statements in which there are said to be nonactual possible worlds, they must be reducible to statements in which the only things there are said to be are things which there are in the actual world and which are not identical with nonactual possibles. The actualist will not agree that there are nonactual possible worlds, if the notion of possible worlds is to be regarded as primitive. (Adams 1974: 224) Adams puts forward a strategy for construing talk of possible worlds within an actualist perspective. He refers to it as the true-story theory: The true-story theorist [...] regards a merely possible world as logically constructed out of the set of propositions that are true in it, and he sees the truth of a proposition in a possible world as basically a matter of relations of consistency among propositions, rather than of correspondence with an independent object. (Adams 1974: 227) 1 Propositions, if they exist, exist in actuality. 2 Hence, if possible worlds could be constructed along the lines of the true-story theory, actualism, on Adams's characterization, would be vindicated.
We can use these ideas to formulate a contrast between two conceptions of the fundamental character of modal reality-of the aspects of reality to which our modal talk is answerable. The actualist will treat modal reality as a logical construction out of sets of propositions, or, equivalently, out of valuations (functions from the set of propositions to the values True and False). On the version of actualism that I want to concentrate on, modal reality is logically constructed out of a set of total valuations, with all propositions, modal as well as non-modal, in their domain. 3 For the actualist, once we have specified which total valuations it contains, we will have given a complete characterization of modal reality. 4 For possibilism, by contrast, modal reality consists of a set of possible worlds, conceived as independent objects, all but one of which do not exist in actuality. Each possible world bestows a truth value on each proposition, according to whether or not things are at that world as the proposition represents them as being. In this way, modal reality, for the possibilist, singles out a set of valuations. But for the possibilist, the set of valuations it singles out is not all there is to modal reality. Possible worlds have properties and bear relations to one another that might not be reflected in the truth values they bestow on propositions.
Which of these positions we adopt will have consequences for which differences between accounts of modal reality we are prepared to treat as intelligible. The crucial point here is whether accounts of modal reality can disagree with one another while agreeing on which valuations it contains. For the possibilist, on the one hand, this kind of disagreement is perfectly intelligible. Accounts of modal reality can agree on which valuations are generated by possible worlds while disagreeing on properties of and relations between possible worlds that are not reflected in the truth values that propositions receive from them. I am going to refer to disagreements of this kind between accounts of modal reality as possibilist disagreements. Possibilism is committed to the intelligibility of possibilist disagreements. For the actualist, on the other hand, possibilist disagreements are completely unintelligible. Once we have agreed on which valuations modal reality contains, for the actualist, there is nothing left for us to agree or disagree about concerning modal reality. 5

Semantics for Possibilists and Actualists
A coherent account of modal reality needs to be compatible with the meanings of logical operators, and both possibilists and actualists face the task of specifying which accounts satisfy this criterion. This is the job of a semantic theory. Here, I am going to concentrate on the sentential aspect of the task, on the compatibility of accounts of modal reality with the meanings of the truth-functional connectives and modal operators, with the modal operators taken to express metaphysical modality. Possibilists and actualists alike will need to provide a semantics for modal propositional logic, but they will take different approaches to the task.
For the possibilist, possible worlds bestow truth values on propositions. They will do this in ways that are compatible with the meanings of the logical operators, and a coherent account of modal reality will have to abide by this restriction. For example, on a coherent account of modal reality, a possible world cannot give the same value to a proposition and its negation, or the value True to a conjunction and the value False to one of its conjuncts. Likewise, in a coherent account of modal reality, a possible world cannot give the value False to necessarily-p if every world gives the value True to p, nor can a possible world give the value True to possibly-p if every world gives the value False to p. The possibilist's goal, then, is to specify how a set of possible worlds can assign to proposition values that are compatible with the meanings of the logical operators.
The actualist will approach the task in a different way. For her, a coherent account of modal reality is a set of valuations that are compatible with the meanings of the logical operators. Her goal is to specify which sets of valuations satisfy this criterion. Thus, for example, she will need to exclude sets containing valuations that assign the same truth value to a proposition and its negation, or valuations that assign the value True to a conjunction and the value False to one of its conjuncts, as well as any set containing valuations that assign the value False to necessarily-p if all the valuations in the set assign the value True to p and sets containing valuations that assign the value True to possibly-p if all the valuations in the set assign the value False to p. The actualist's goal is to specify which sets of valuations are compatible with the meanings of the logical operators.
These two approaches to the task are clearly related, and it might seem that the differences between them are merely verbal-that the possibilist's talk of possible worlds bestowing truth values on propositions adds nothing of substance to the actualist's talk of valuations being contained in modal reality. However a difference arises from the possibilist's need to make room for possibilist disagreements. The possibilist semantic framework will have to have the resources to accommodate differences between coherent accounts of modal reality that agree with one another on which valuations are generated by possible worlds. The actualist, by contrast, will not be subject to this constraint.
It follows from this that the possibilist faces a strictly harder task than the actualist does. On the one hand, every solution to the possibilist task can be adapted by the actualist for her purposes. By specifying how propositions can receive from a set of possible worlds truth values that are compatible with the meanings of the logical operators, a possibilist semantics will be specifying, indirectly, which sets of valuations are compatible with the meanings of the logical operators. In this way, every possibilist semantics can be converted into an actualist semantics. On the other hand, a solution to the actualist task might not be usable by the possibilist. We might in principle be able to specify the sets of valuations that are compatible with the meanings of the logical operators without drawing on formal resources that would enable us to make room for possibilist disagreements. 6 I am going to refer to a semantics for modal propositional logic that satisfies this description as an essentially actualist semantics. An essentially actualist semantics will solve the actualist task but not the possibilist task, since it will not have the resources to make room for possibilist disagreements.
My goal in the remainder of this paper is to discuss the availability of an essentially actualist semantics for modal propositional logic. I am going to argue first that the standard Kripkean semantics for modal propositional logic is not essentially actualist, as it has the resources for making sense of possibilist disagreements, and I will present specific ways in which Kripkean semantics falls short of essential actualism. I will then argue that other extant alternatives also fail to provide what a sensible actualist would need. I will end by describing a semantics for modal propositional logic that does the job-it specifies which sets of valuations are compatible with the meanings of the logical operators without invoking formal tools that would enable us to make sense of possibilist disagreements.

Kripkean Semantics
Let us focus on a language, MPL, for modal propositional logic with ¬, ∧, □ and ◊, as its only logical operators, representing, as usual, negation, conjunction, necessity, and possibility. A set of MPL-valuations may or may not be compatible with the meanings that we want to ascribe to our logical operators. A set will fail the test if, for example, it contains a valuation that assigns the same value to ϕ and ¬ϕ, for any sentence ϕ, or the value True to ϕ ∧ ψ and the value False to ϕ. Likewise, a set will fail the test if it contains a valuation assigning the value True to ◊ϕ but no valuation assigning the value True to ϕ, or if it contains a valuation assigning the value False to □ϕ but no valuation assigning the value False to ϕ. Let say that a set of MPL-valuations is admissible just in case it is compatible with the meanings of the logical operators. Specifying which sets of MPL-valuations are admissible is the goal of a semantics for MPL.
The standard approach to this task deploys the tools introduced by Kripke (1963). Kripke's semantic framework for modal propositional logic is based on what I am going to call K-models. A K-model M is an ordered triple <W M , R M , S M >, where W M is a (non-empty) set of objects (the possible worlds), R M is a binary relation on W M (the accessibility relation), and S M is a function pairing each element of W M and atomic sentence with a unique truth value-the value that the atomic sentence has at that world. 7 For every K-model M, we now define a function V M , the canonical extension of S M (with respect to M), pairing each MPL-sentence and element of W M with a unique truth value, the value that the sentence has at that world. V M is defined by recursion. For the base, we have that for every atomic sentence α, and every w ∈ W M , V M (α, w) = S M (α, w). The recursive clauses go as follows, for all MPL-sentences ϕ, ψ, and every w ∈ W M : T otherwise: ( I am going to refer to this familiar account of the semantics of modal propositional logic as K-semantics.
Clearly, K-semantics provides a solution to the actualist task of specifying which sets of valuations are admissible. Let us say that the set of MPL-valuations generated by a K-model M is the following set: v : for some w in W M ; for every MPL−sentence ϕ; We can now formulate in the following terms the solution to the actualist task provided by K-semantics: a set of MPL-valuations is admissible just in case it is generated by some K-model.
However, I am going to argue that this solution is not essentially actualist. Of course, the formal tools deployed in K-semantics are strongly reminiscent of the possibilist 7 K-models are sometimes known as standard models. metaphysical picture. Possible worlds bearing relations to one another and bestowing truth values on propositions is precisely how the possibilist conceives of modal reality. But the metaphysical interpretation of the formal tools is not mandatory and is certainly not part of the Kripkean proposal. The actualist is perfectly free to use the formalism without incurring the metaphysical commitments that it might suggest.
What prevents K-semantics from being essentially actualist is not the language employed, but the fact that it has the resources for accommodating possibilist disagreements. K-semantics will be able to represent possibilist disagreements insofar as different K-models can generate the same set of MPL-valuations. The possibilist will be able to take these models to represent different accounts of modal reality that agree on which valuations it contains. I am going to present in the remainder of this section specific ways in which K-semantics can accommodate possibilist disagreements. It will emerge that a set of MPL-valuations will never be generated by a unique K-model-if a set of MPL-valuations is generated by any K-model, it will be generated by many Kmodels. I want to consider three obstacles to unique generation.
I. I want to consider first an obstacle to uniqueness that is trivial and innocuous. If a set of MPL-valuations V is generated by a K-model M, it will also be generated by a K-model in which W M is replaced with any other set S of the same cardinality. If h is a one-to-one correspondence from W M to S, all we need to do to get another model that also generates V is to replace R M with the relation pairing the images under h of the elements of W M paired by R M , and S M with the function pairing α and h(w) with S M (α, w), for every atomic sentence α and every w in W M . What renders this obstacle to uniqueness trivial is the obvious isomorphism between M and the resulting K-model, as the highest level of uniqueness to which we can aspire with formal objects is uniqueness up to isomorphism. If V is generated by multiple K-models, but these are isomorphic to one another, then, for all intents and purposes, V is uniquely generated. II. The second obstacle to uniqueness that I want to consider involves non-isomorphic models. It arises from the possibility of K-models containing worlds that agree with one another on the truth value of every MPL-sentence. One instance of this phenomenon is discussed by Hughes and Cresswell (1984: 48), who show that for every K-model M, there is another K-model in which every element of W M is replaced by two worlds that agree with one another on the truth value that they assign to each MPL-sentence. If V is generated by M, then it will also be generated by the models that we obtain in this way. And all these models will be nonisomorphic. Any set of MPL-valuations that is generated by a K-model is generated by multiple non-isomorphic K-models. III. The third obstacle to uniqueness that I want to consider concerns the accessibility relation. Let M be a K-model with the following features: a. W M contains a world w* from which denumerably many worlds are accessible, and a world w + not accessible from w*. b. The same worlds are accessible from w + and from each of the worlds that are accessible from w*. c. For some enumeration of the atomic sentences, α 1 , α 2 , α 3 …, and some enumeration of the worlds that are accessible from w*, w 1 , w 2 , w 3 …, for every positive integer n, we have that the first n atomic sentences, and only those, are true at the nth world, i.e., for all positive integers n, m, S M (α m , w n ) = T iff m ≤ n. d. Every atomic sentence is true at w + . Now, compare M with the K-model M' that we obtain from M by making w + accessible from w*, i.e., M' = <W M , R M ∪ {<w*, w + >}, S M >. I claim that M and M' generate the same set of MPL-valuations, since, for every MPL-sentence ϕ and every w ∈ W M , V M (ϕ, w) = V M' (ϕ, w). Clearly, this claim could fail only if it failed for w*, i.e., if for some MPL-sentence ψ, V M (ψ, w*) ≠ V M' (ψ, w*). This, in turn, could obtain only if there was some MPL-sentence γ such that V M (γ, w i ) = T for every positive integer i but V M (γ, w + ) = F (then we would have V M (□γ, w*) = T, V M' (□γ, w*) = F) or if V M (γ, w i ) = F for every positive integer i but V M (γ, w + ) = T (then we would have V M (◊γ, w*) = F, V M' (◊γ, w*) = T). Hence, to establish our claim, it would suffice to show that if for all m, n, V M (ϕ, w m ) = V M (ϕ, w n ), then V M (ϕ, w + ) = V M (ϕ, w n ) (for every n). This can be easily shown. 8 We can conclude that the set of MPL-valuations generated by M is also generated by M', even though these two models are not isomorphic.
We have seen in this section that multiple generation is a widespread phenomenon in K-semantics. There are many cases in which different K-models generate the same set of MPL-valuations. This will enable the possibilist to use K-semantics to accommodate possibilist disagreements. K-semantics is not essentially actualist. It has, so to speak, moving parts that the actualist does not need.

Other Options
We can achieve unique generation without abandoning K-semantics. All we need to do is define a subset of the set of K-models containing, for every set of MPL-valuations that is generated by some K-model, exactly one K-model that generates it. We can achieve this with Kit Fine's notion of natural models (Fine 1975: 23). Natural models are K-models that are differentiated and tight. A K-model M is differentiated just in case it satisfies the following condition. Focusing on natural models does nothing about the first, innocuous obstacle to unique generation (I), but the two substantial obstacles are removed. Differentiated 8 We can show with a simple induction that for every MPL-sentence ϕ, there is a positive integer n such that beyond w n , the truth value of ϕ does not change, i.e., for every positive integer m ≥ n, V M (ϕ, w m ) = V M (ϕ, w n ). Call this the limit value of ϕ. We can then show, again by induction, that the value of ϕ at w + is its limit value. It is a straightforward corollary of this that if for all m, n, V M (ϕ, w m ) = V M (ϕ, w n ), then V M (ϕ, w + ) = V M (ϕ, w n ) (for every n). models do not have worlds that agree with each other on the truth values of all sentences (II), and tight models that disagree on the extension of the accessibility relation will generate different sets of valuations (III). Up to isomorphism, every set of MPL-valuations that is generated by some K-model is generated by a unique natural Kmodel. I want to argue, however, that achieving unique generation in this way does not amount to providing an essentially actualist semantics. To be an essentially actualist semantics, a semantics must single out the admissible sets of MPL-valuations without drawing on formal resources that would enable us to make room for possibilist disagreements. Focusing on natural models does not satisfy this requirement. We have defined the set of natural models as a subset of the set of K-models, and the definition of the set of K-models does draw on resources that suffice for making sense of possibilist disagreements. This strategy invokes these resources to define K-models and then cancels them out by concentrating on natural models. An essentially actualist semantics should not employ these resources to start with. It should single out the admissible sets of MPL-valuations without drawing at any stage on resources that would suffice for making sense of possibilist disagreements.
To find an essentially actualist semantics, we need to abandon the formal tools of Ksemantics, possible worlds and the accessibility relation, and attempt to specify without their help which sets of MPL-valuations are admissible. We start our search by going back to the semantics for modal propositional logic put forward by Rudolf Carnap (1956: 182). On Carnap's approach, there is exactly one admissible set of MPLvaluations. It is given by a binary function C pairing each MPL-sentence and atomic valuation with a truth value. C is defined by recursion. For every atom α and every atomic valuation σ, we have that C(α, σ) = σ(α). The recursive clauses for the modal operators take the following form, for every MPL-sentence ϕ, and every atomic valuation σ: The set of extensions to MPL of the atomic valuations that we obtain in this way is, on Carnap's approach, the one and only admissible set of MPL-valuations.
Carnap's approach is overly restrictive in several ways. One obvious problem is that it does not treat as admissible any sets of MPL-valuations that do not contain extensions of every atomic valuation. This is fine if we want the modal operators to express logical necessity and possibility, but it is overly restrictive if we want our modal operators to express metaphysical modalities. Treated as an account of metaphysical necessity and possibility, Carnap's system carries a commitment to the view that everything that is logically possible is metaphysically possible, and only what is logically necessary is metaphysically necessary.
The commitment is easily discharged with a minor modification of the Carnapian framework, presented in Kripke's paper, BA Completeness Theorem in Modal LogicĴ (Kripke 1959). Once we accept that some atomic valuations might be impossible, we can no longer expect a unique MPL-extension of a possible atomic valuation σ that agrees with the meanings of the truth-functional connectives and modal operators. Which MPL-extension of σ satisfies this requirement will depend on which other atomic valuations are contained in modal reality. Hence, instead of defining a single function pairing each MPL-sentence and atomic valuation with a truth value, we need to define a function of this kind for every hypothesis as to which atomic valuations are contained in modal reality-for every set of atomic valuations.
To achieve this, we say that an EK-model 9 is a (non-empty) set of atomic valuations. For every EK-model Σ, we define a function V Σ , the canonical extension of Σ, pairing each MPL-sentence and element of Σ with a unique truth value. The definition then proceeds along the same lines as the definition of C, above, with the set of all atomic valuations replaced by Σ. Hence, the clauses for the modal operators now read as follows, for every MPL-sentence ϕ, and every σ ∈ Σ: We can now define, for every EK-model Σ, the set of MPL-valuations generated by Σ as the following set: v : for some σ in Σ; for every MPL−sentence ϕ; This gives us a solution to the actualist task: a set of MPL-valuations is admissible just in case it is generated by some EK-model. Furthermore, this solution is essentially actualist. For any two different EK-models, there is at least one atomic valuation σ that is a member of one but not of the other. Hence, the set of MPL-valuations generated by one of the EK-models, but not the set generated by the other, will contain an extension of σ. Therefore, different EK-models will generate different sets of MPL-valuations, as required for essentially actualist status. Furthermore, the definition has not invoked at any stage formal tools that would enable us to make sense of possibilist disagreements.
Nevertheless, the actualist would be ill advised to adopt EK-semantics as her account of which sets of MPL-valuations are admissible, as it rules out features of sets of MPL-valuations that the actualist might well regard as compatible with the meanings of the modal operators. The questionable restrictions include the following: Neither of these restrictions is mandated by the actualist position. Contrary to 1, an actualist may want to regard an account of modal reality as coherent even though it represents it as containing valuations that disagree on the truth values of some modal sentences. Against 2, an actualist may want to make room for the possibility of coherent accounts of modal reality that agree on which atomic valuations it contains but disagree on how these are extended to modal sentences. Although EK-semantics is essentially actualist, an actualist who does not accept these restrictions will not be able to use it to specify which accounts of modal reality are compatible with the meanings of the modal operators.
The actualist might try to remove some of these restrictions without returning to K-semantics by introducing an accessibility relation directly on atomic valuations. To achieve this, we say that an A-model 10 M is an ordered pair <Σ M , R M >, where Σ M is a (non-empty) set of atomic valuations and R M is a binary relation on Σ M . For every A-model M, we define a function V M , the canonical extension of Σ M (with respect to M), pairing each MPL-sentence and element of Σ M with a unique truth value. The definition proceeds along the same lines as for K-semantics. 11 The clauses for the modal operators now go as follows, for every MPL-sentence ϕ and every σ ∈ Σ M : We define as before the function pairing each A-model with the set of MPLvaluations it generates, and we say that the admissible sets are those that are generated by some A-model. This move succeeds in removing the restrictions on admissible sets of MPLvaluations that we mentioned above (1 and 2). By introducing R M , we are able to count some sets of MPL-valuations as admissible even though they contain valuations that disagree on the values of modal sentences (1). We also make room for different admissible sets of MPL-valuations that extend the same set of atomic valuations (2).
Nevertheless, A-semantics still imposes restrictions on admissible sets of MPL-valuations that an actualist might not want to endorse. As we have just seen, an A-model can generate a set of MPL-valuations containing valuations that disagree with one another on the values they assign to some modal sentences. However, an A-model cannot generate a set of MPL-valuations containing valuations that disagree with one another on the values they assign to some modal sentences while agreeing on the value that they assign to each nonmodal sentence. A-semantics imposes the following restriction on admissible sets of MPL-valuations: 3. An admissible set of MPL-valuations cannot contain different valuations that extend the same atomic valuation.
Notice that 3 is weaker than 1. Every set of MPL-valuations that satisfies 1 also satisfies 3, but a set might satisfy 3 and violate 1. Nevertheless, the actualist might still not recognize this restriction as a consequence of her position. She might see nothing wrong with modal reality containing valuations that agree with one another concerning the values of all non-modal sentences but disagree about the value of some modal sentences. But Asemantics lacks the resources to represent modal reality as having this feature.
With respect to unique generation, the results are mixed. In the absence of worlds, the first two obstacles to uniqueness (I and II) disappear. The third (III), however, remains. We can easily replicate in A-models the situation we described in section 3 of two models that generate the same set of MPL-valuations but disagree on the extension of the accessibility relation. A-semantics is not essentially actualist. 12 We still have not found an essentially actualist semantics that does not impose restrictions on which sets of MPL-valuations are admissible that do not follow from the actualist position. My goal in the remainder is to describe a semantics for MPL that satisfies this description-an essentially actualist semantics that agrees with Ksemantics on which sets of MPL-valuations are admissible.

EA-Semantics
A semantics for MPL needs to specify which sets of MPL-valuations are admissible. Ksemantics achieves this in a rather roundabout way. It says that a set of MPL-valuations is admissible just in case it is generated by some K-model.
The alternative semantic framework that I am going to introduce will take a much more direct approach to the task. We will dispense with possible worlds and the accessibility relation, in terms of which K-models are defined. Instead, we will specify directly the conditions that a set of MPL-valuations needs to satisfy in order to be admissible.
Let us say that an MPL-valuation v is Boolean just in case it agrees with the meanings of the truth-functional connectives, i.e., just in case it satisfies the following conditions, for all MPL-sentences ϕ, ψ: A necessary condition for a set of MPL-valuations to be admissible is that all the valuations in the set are Boolean. This will ensure that the set is compatible with the meanings of the truth-functional connectives. All we need to do now is to specify conditions that will ensure that a set of Boolean MPL-valuations agrees with the meanings of the modal operators.
We can motivate the approach I am going to adopt by reflecting on how the truth values that MPL-sentences receive from the worlds in a K-model restrict the extension of the accessibility relation. w 2 cannot be accessible from w 1 unless all the necessities of w 1 are true in w 2 and all the impossibilities of w 1 are false in w 2 . This is a necessary condition for w 2 being accessible from w 1 . But it is not a sufficient condition. w 2 might fail to be accessible from w 1 even if the condition is satisfied. This is, in effect, the source of the third obstacle (III) to unique generation that we considered in section 3. The obstacle would disappear if we turned this into a sufficient as well as necessary condition for accessibility. 13 What I propose to do is to abandon accessibility and formulate the semantics for MPL in terms of this condition.
Let us say that an MPL-valuation v' actualizes an MPL-valuation v just in case every necessity of v is true in v' and every impossibility of v is false in v', i.e.,: v 0 actualizes v just in case f or every MPLÀsentence ϕ; We can use the notion of actualization as the basis for our modal semantics. We say that an EA-model 14 is a set V of Boolean valuations satisfying the following conditions, for every MPL-sentence ϕ and every v ∈ V: Notice that we do not need to require, in addition, that □ϕ is false in v if ϕ is false in some valuation that actualizes v. If □ϕ is true in v and ϕ is false in v', then v' does not actualize v. Likewise, we do not need to require that ◊ϕ is true in v if ϕ is true in some valuation that actualizes v. If ◊ϕ is false in v and ϕ is true in v', then v' does not actualize v. This means that a set of Boolean valuations can fail to be an EA-model only if it contains a valuation that either fails to treat as necessary what is true in every valuation that actualizes it or fails to treat as impossible what is false in every valuation that actualizes it.
I would like to emphasize that an EA-model does not consist in a set of MPLvaluations and a binary relation (actualization) that satisfy certain conditions. We have not simply replaced accessibility with actualization in the definition of A-models. An EA-model consists in a set of MPL-valuations that satisfies certain conditions. We have introduced the notion of actualization in order to provide a perspicuous formulation of the conditions that a set of MPL-valuations needs to satisfy in order to be an EA-model. But the notion is entirely dispensable. (□ EA ) and (◊ EA ) can be easily formulated without 13 See our discussion above of Fine's tight models. 14 'EA' abbreviates 'essentially actualist'. its help (ϕ and ψ range over MPL-sentences and v and v' over elements of V): and (◊ EA ) are exclusively concerned with the values that the members of V assign to each MPL-sentence.
We can now provide a perfectly straightforward solution to the actualist semantic task: a set of MPL-valuations is admissible if and only if it is an EA-model. This gives us what we were looking for-a specification of which sets of MPL-valuations are admissible that is essentially actualist but does not impose any restrictions on admissible sets that the actualist might not want to adopt.
The claim that EA-semantics is essentially actualist is self-evident. An EA-model is a set of MPL-valuations. Hence, by the extensionality of sets, different EA-models cannot correspond to the same set of MPL-valuations. EA-semantics lacks the resources for representing possibilist disagreements.
We can also easily show that EA-semantics does not impose any restrictions on which sets of MPL-valuations are admissible that the actualist might not want to endorse. We can show, in fact that, EA-semantics imposes exactly the same restrictions as K-semantics. This is an immediate consequence of the following result: A set of MPL-valuations is an EA-model if and only if it is generated by some Kmodel. 15 Clearly, it follows from this that none of the restrictions on admissible sets of MPLvaluations that we invoked to motivate the rejection of other semantic frameworks are imposed by EA-semantics, but it will be interesting to look at some EA-models that violate them.
For a violation of restriction 3, and a fortiori of restriction 1, let σ be an atomic valuation, let v be the Boolean extension of σ to MPL such that for every MPLsentence ϕ, v(□ϕ) = T, v(◊ϕ) = F, and let v' be the Boolean extension of σ to MPL such that for every MPL-sentence ϕ, v'(□ϕ) = v'(◊ϕ) = v(ϕ). We can easily show that {v, v'} is an EA-model in which v actualizes v' but not itself and v' does not actualize itself or v. And {v, v'} violates restriction 3. For v and v' are MPL-valuations that agree with 15 For the right-to-left direction, let V be a set of MPL-valuations that's generated by some K-model. We need to show that V is a set of Boolean valuations satisfying □ EA and ◊ EA .
Let M be a K-model that generates V. Let v Z V. Then, there is a w Z W M such that for every MPLsentence ϕ, V M (ϕ, w) = v(ϕ). Let w be an element of W M satisfying this condition.
For □ EA , assume that for every v' Z V that actualizes v, v'(ϕ) = T. If wR M w' and we let v'(ψ) = V M (ψ, w') for every MPL-sentence ψ, then v' actualizes v. Hence, for every w' Z W M such that wR M w', V M (ϕ, w') = T. And now it follows by □ K that V M (□ϕ, w) = T.
We deal with ◊ EA in the same way.
For the left-to-right direction, notice that if V is an EA-model, then we obtain a K-model M if we take V as W M , the actualization relation on V as R M , and the function pairing each element of V with its restriction to the set of atomic sentences as S M .

K-Semantics and EA-Semantics
The semantic properties and relations that we can define in terms of K-models correspond to the modal system K, the weakest normal system. Since EA-models provide an equivalent definition of admissibility, the resulting logical properties and relations also correspond to K.
Using K-models, we can go on to define stronger logical systems by imposing conditions on the accessibility relation. Thus, for example, the system T results when we focus on K-models in which accessibility is reflexive. Let us say that a K-model M is reflexive just in case R M is a reflexive relation, and let us say that a set of MPLvaluations is admissible just in case it is generated by some reflexive K-model. The logical properties and relations that we obtain from this definition of admissibility correspond to the system T. The same maneuver, with other restrictions on accessibility, generates the semantic frameworks for other extensions of K.
It might seem that by dispensing with the accessibility relation, EA-semantics loses the ability to provide the semantics for modal systems beyond K. However, this is not so, since we can achieve the same effect with restrictions on EA-models. Thus, let us say that an EA-model V is reflexive just in case every element of V actualizes itself. We can now say that a set of MPL-valuations is admissible just in case it is a reflexive EAmodel. Using this notion of accessibility, we can define, once more, the logical properties and relations of system T. The same strategy will generate the semantics of other extensions of K. 16 However, it is by no means clear that EA-models can generate a modal semantics that replicates the success of K-models in the development of model theory. The proofs of many results in the model theory of modal propositional logic make use of features 16 The notion of a frame can also be easily recovered in the new context. Let us say that two EA-models V 1 , V 2 are frame-isomorphic if there is a one-to-one correspondence h from V 1 to V 2 such that, for all v, v' Z V 1 , v' actualizes v iff h(v') actualizes h(v). Then we can define frames as the equivalence classes generated by frameisomorphism.
of K-models that are absent from EA-models, and it remains to be seen whether we can provide alternative proofs based on EA-models. 17 But my point does not depend on the potential of EA-models as a tool in model theory. My goal has been to show that an essentially actualist semantics for modal propositional logic is possible-that we can specify the admissible sets of MPLvaluations without invoking formal tools that would enable us to make room for possibilist disagreements. The existence of EA-semantics establishes this point, even if we continue to favor K-semantics for the development of model theory.