1.1 Basic notions.

Formulas are constructed from a denumerable set of sentence letters At $=\{p, q, r, \ldots \}$ and the constant $\bot $ by the connectives $\to $ and $\Box $ ; $\neg \phi $ abbreviates $(\phi \to \bot )$ and $\top $ abbreviates $\neg \bot $ . A logic is a set $\lambda $ of formulas that contains all classical tautologies, and which is closed under modus ponens and uniform substitution. The theorems of a logic are its elements. The smallest logic is called $PC$ , and just consists of all uniform substitution instances of all classical tautologies. Every logic defines a consequence relation: $\Gamma \vdash _\lambda \phi $ if and only if $\phi \in \lambda $ or $\exists \psi _1, \ldots , \psi _n\in \Gamma $ such that $(\psi _1\to (\psi _2\to \ldots (\psi _n\to \phi )\ldots )\in \lambda $ . We abbreviate $\varnothing \vdash _\lambda \phi $ to $\vdash _\lambda \phi $ . A set of formulas $\Gamma $ is $\lambda $ -consistent when $\Gamma \not \vdash _\lambda \bot $ , and maximal $\lambda $ -consistent when it additionally has no $\lambda $ -consistent extension. Where $\Gamma $ is a set of formulas, we write $\Box \Gamma =\{\Box \phi :\phi \in \Gamma \}$ and $\Box ^{-}\Gamma =\{\phi :\Box \phi \in \Gamma \}$ . Note that for all $\Gamma $ we have $\Box \Box ^{-}\Gamma \subseteq \Gamma $ . Where $X_1, \ldots , X_n$ are formulas, sets of formulas, or rules of inference, we write $X_1+\cdots +X_n$ to denote the smallest logic that contains or includes or admits every $X_i$ . I often use serif font for named formulas and rules and sans serif font for named logics. An interpretation is a triple $I = (M, \Gamma , \lambda ),$ where M is a set of sentence letters, $\Gamma $ is a set of formulas, and $\lambda $ is a logic. Satisfaction is defined inductively:

$$ \begin{align*} \begin{array}{l} \displaystyle M, \Gamma, \lambda\not\vDash \bot\\ \displaystyle M, \Gamma, \lambda\vDash p \text{ if and only if } p\in M \\ \displaystyle M, \Gamma, \lambda\vDash \phi\to\psi \text{ if and only if } M, \Gamma, \lambda\not\vDash \phi \text{ or } M, \Gamma, \lambda\vDash\psi\\ \displaystyle M, \Gamma, \lambda\vDash \Box\phi \text{ if and only if } \Gamma\vdash_\lambda\phi. \end{array} \end{align*} $$

In an interpretation $(M, \Gamma , \lambda )$ , $\Gamma $ is called the set of assumptions and $\lambda $ is called the logic of evaluation. We write $I\vDash \Delta $ iff $I\vDash \psi $ for all $\psi $ in $\Delta $ . Then $\mathfrak {I}_\Delta := \{I:I\vDash \Delta \}$ . For $\mathfrak {I}$ a set of interpretations, write $\Gamma \vDash _{\mathfrak {I}}\phi $ when for all I in $\mathfrak {I}$ , if $I\vDash \Gamma $ then $I\vDash \phi $ . We abbreviate $\varnothing \vDash _{\mathfrak {I}}\phi $ to $\vDash _{\mathfrak {I}}\phi $ . When $\mathfrak {I}$ is the set of all interpretations, we abbreviate to $\Gamma \vDash \phi $ and $\vDash \phi $ . The canonical model of $\Gamma $ with respect to $\lambda $ is:

$$ \begin{align*} I[\Gamma, \lambda] := (\text{At}\cap \Gamma, \Box^{-}\Gamma, \lambda). \end{align*} $$

1.2 General completeness and definability

We now establish a general completeness theorem, relying on two lemmas about canonical models. In these results, we make use of a generalised notion of normality. Namely, we say that a logic $\sigma $ is normal for a logic $\lambda $ if and only if $\Gamma \vdash _\lambda \phi $ always implies $\Box \Gamma \vdash _\sigma \Box \phi $ . A logic is normal in the usual sense when it is normal for itself. The two lemmas and resulting completeness theorem now follow the following proposition.

Given many logics $\sigma $ , this theorem allows us to find a class of interpretations $\mathfrak {I}_\sigma $ for which said logic is sound and complete. But we often have a class of interpretations $\mathfrak {I}$ not characterised by reference to a particular logic, and we want to find a logic $\lambda $ that will be sound and complete with respect to $\vDash _{\mathfrak {I}}$ . Our general completeness theorem is applicable to such cases. Call $\mathfrak {I}$ definable iff $\mathfrak {I} = \mathfrak {I}_\sigma $ for some logic $\sigma $ . If we can show that a class of interpretations is definable, and identify a logic by which it is defined, completeness follows by the above theorem. This is possible in many natural cases. For example,

$$ \begin{align*} \begin{array}{lll} \text{INT} &= &\text{The class of all interpretations.}\\ \text{CON} &= &\{(M, \Gamma, \lambda):\forall \phi \text{ if } \Gamma\vdash_\lambda\phi \text{ then } \Gamma\not\vdash_\lambda\neg \phi\}\\ \text{FAC} &= &\{(M, \Gamma, \lambda):\forall\phi\text{ if } \Gamma\vdash_\lambda\phi\text{ then }M,\lambda, \Gamma\vDash \phi \}\\ \Box\text{CL} &= &\{(M, \Gamma, \lambda):\forall\phi\text{ if } \Gamma\vdash_\lambda\phi \text{ then }\Gamma\vdash_\lambda\Box\phi\}\\ \Diamond\text{CL} &= &\{(M, \Gamma, \lambda):\forall\phi\text{ if } \Gamma\not\vdash_\lambda\phi \text{ then }\Gamma\vdash_\lambda\neg\Box\phi\} \end{array} \end{align*} $$

$$ \begin{align*} \begin{array}{lll lll} \Box\text{CF} &= &\Box\text{CL } \cap \text{ FAC } \quad &\text{DCF} &=&\Box\text{CL } \cap \Diamond\text{CL } \cap\text{FAC.}\\ \end{array} \end{align*} $$

To find logics that define these classes of interpretations, we recall the familiar axioms

$$ \begin{align*} \begin{array}{ll ll} \text{K} &\Box(p\to q)\to (\Box p\to \Box q) &\text{D} &\Box p\to \neg \Box \neg p\\ \text{T} &\Box p\to p &4 &\Box p\to \Box\Box p\\ 5 &\neg\Box p\to \Box\neg \Box p.&&\\ \end{array} \end{align*} $$

The smallest logic normal for some logic is the smallest logic normal for $PC$ , which I call $\mathsf {K}_0$ . We note that being normal for some logic or other is equivalent to being normal for the smallest logic (PC) and that any extension of a logic normal for $PC$ is itself normal for PC. Therefore for logics, the property of ‘being normal for some logic’ amounts to being an extension of $\mathsf {K}_0$ . $\mathsf {K}_0$ is also the smallest set of formulas closed under modus ponens, containing all substitution instances of K, and containing $\Box \phi $ for all $\phi $ in PC. By concatenating the names of other axioms and adding a ‘ $0$ ’, we name the smallest logic that extends $\mathsf {K}_0$ containing the named axioms. So $\mathsf {KD}_0 = \mathsf {K}_0 + \text {D}$ , and $\mathsf {KD45}_0 = \mathsf {K}_0 + \text {D} + 4 + 5$ . Most of these logics are not normal, except for $\mathsf {KT45_0}=\mathsf {S5}$ (see [Reference Williamson7, p. 110]).Footnote ² We write $\mathsf {D_0}:=\mathsf {KD}_0$ $\mathsf {T_0}:=\mathsf {KT}_0$ , and $\mathsf {S4_0}:=\mathsf {KT4}_0$ . One obtains the expected normal counterpart for these logics by adding necessitation—for example, $\mathsf {S4_0} + \text {Necessitation} = \mathsf {S4}$ . We make use of the fact that each of the above logics is the smallest set of formulas closed under modus ponens and containing all substitution instances of their axioms.

Proposition 3.

$$ \begin{align*} \begin{array}{llllllll} \displaystyle\mathrm{i.} &\displaystyle\text{INT} = \mathfrak{I}_{\mathsf{K}_0} &\displaystyle\mathrm{ii.} &\displaystyle\text{CON} = \mathfrak{I}_{\mathsf{D}_0} &\displaystyle\mathrm{iii.} &\displaystyle\text{FAC} = \mathfrak{I}_{\mathsf{T}_0} &\displaystyle\mathrm{iv.} &\displaystyle\Box \text{CL} = \mathfrak{I}_{\mathsf{K4}_0}\\ \displaystyle\mathrm{v.} &\displaystyle\Diamond \text{CL} = \mathfrak{I}_{\mathsf{K5}_0} &\displaystyle\mathrm{vi.} &\displaystyle\Box \text{CF} = \mathfrak{I}_{\mathsf{S4}_0} &\displaystyle\mathrm{vii.} &\displaystyle\text{DCF} = \mathfrak{J}_{\mathsf{S5.}} &\\ \end{array} \end{align*} $$

Corollary 1. (By Theorem 1, Proposition 3) For all $\Gamma $ and $\phi $ ,

$$ \begin{align*} \begin{array}{clcl} \displaystyle\mathrm{i.} &\displaystyle\Gamma \vDash\phi \iff \Gamma\vdash_{\mathsf{K}_0}\phi &\displaystyle\mathrm{ii.} &\displaystyle\Gamma \vDash_{CON}\phi \iff \Gamma\vdash_{\mathsf{D}_0}\phi\\ \displaystyle\mathrm{iii.} &\displaystyle\Gamma \vDash_{FAC}\phi \iff \Gamma\vdash_{\mathsf{T}_0}\phi &\displaystyle\mathrm{iv.} &\displaystyle\Gamma \vDash_{\Box CL}\phi \iff \Gamma\vdash_{\mathsf{K4}_0}\phi\\ \displaystyle\mathrm{v.} &\displaystyle\Gamma \vDash_{\Diamond CL}\phi \iff \Gamma\vdash_{\mathsf{K5}_0}\phi &\displaystyle\mathrm{vi.} &\displaystyle\Gamma \vDash_{\Box CF}\phi \iff \Gamma\vdash_{\mathsf{S4}_0}\phi\\ \displaystyle\mathrm{vii.} &\displaystyle\Gamma \vDash_{DCF}\phi \iff \Gamma\vdash_{\mathsf{S5}}\phi. &\\ \end{array} \end{align*} $$

1.3 Normal logics

Excepting $\mathsf {KD45_0} = \mathsf {S5}$ , these examples suggest that the present framework relates largely to non-normal logics. But normal logics crop up naturally in this setting, which we see next. For $\mathfrak {I}$ a set of interpretations, let $V\mathfrak {I}$ be the set of formulas $\phi $ that are satisfied by all interpretations in $\mathfrak {I}$ —that are valid over the set. Now one can show that where $\mathfrak {I}$ is definable, $V\mathfrak {I}$ is a logic,Footnote ³ and in particular it is the logic sound and complete for the semantic consequence relation $\vDash _{\mathfrak {I}}$ (e.g., $VFAC = \mathsf {T}_0$ ). Second, where $\mathfrak {I}$ is a set of interpretations and $\lambda $ a logic, let $\mathfrak {I}(\lambda )$ be the set of all interpretations $I\in \mathfrak {I}$ that have $\lambda $ for their logic of evaluation. Combining these, $V\mathfrak {I}(\lambda )$ is the set of formulas valid over $\mathfrak {I}(\lambda )$ . Besides the use of ‘V $\mathfrak {I}$ ’ to denote the set of formulas valid over $\mathfrak {I}$ , for definable $\mathfrak {I,}$ we can also think of ‘ $V\mathfrak {I}(\cdot )$ ’ as denoting a map from logics to logics. Maps of the form $V\mathfrak {I}(\cdot )$ have an important feature. To state it, we recall some terminology from lattice theory. The set of logics in our language forms a complete lattice under inclusion, in the sense that every set of logics $\{\lambda _i\}$ has an infimum $\bigcap _i\lambda _i$ and a supremum, denoted $\sum _i\lambda _i$ . A sequence of logics is a map $\lambda (\cdot )$ which takes natural numbers to logics; we write $\lambda (n)$ as $\lambda _n$ . A sequence $(\lambda _n)$ is called directed if and only if for all natural numbers $n, m$ there is some larger k such that $\lambda _n, \lambda _m\subseteq \lambda _k$ . It is straightforward to show that $\sum _i\lambda _i =\bigcup _n\lambda _n$ whenever $(\lambda _n)$ is directed. We call a function f from logics to logics continuous (meaning Scott-continuous) iff for every directed sequence of logics $(\lambda _n)$ , we have $f(\bigcup _n\lambda _n) = \bigcup _n f(\lambda _n)$ .

With this in place, we next show that for any definable $\mathfrak {I}$ , the map $V\mathfrak {I}(\cdot )$ is continuous. This is significant because it means that certain familiar fixed point theorems can be applied to these maps, which in our case will help display the promised connection to normal modal logics. Our result relies on two lemmas, the first about directed sequences of logics and the second about the general behavior of maps $V\mathfrak {I}(\cdot )$ for definable $\mathfrak {I}$ .

The main consequence of this comes by way of Kleene’s Fixed Point Theorem, which says that a continuous map f on a complete lattice with least element $0$ has a least fixed point, $\text {lfp}(f)$ , which is the supremum of the sequence $(f^n(0))$ . Hence for definable $\mathfrak {I}$ , $V\mathfrak {I}(\cdot )$ has a least fixed point $\text {lfp}(V\mathfrak {I}(\cdot ))$ , that we shall abbreviate to $\text {lfp}(\mathfrak {I})$ , which is the supremum of the sequence $(V\mathfrak {I}^n(PC))$ . In general, this fixed point turns out to be a normal logic.

We can see some illustrative examples of the application of this result by applying it to the examples given in Corollary 1 in particular. So, we have the following corollary.

Corollary 2. (By Proposition 6, Corollary 1)

$$ \begin{align*} \begin{array}{llc llc llc} \displaystyle\text{lfp}({\text{INT}})&=&\displaystyle{\mathsf{K}} &\displaystyle\text{lfp}({\text{CON}})&=&\displaystyle{\mathsf{D}}&\displaystyle\text{lfp}({\text{FAC}})&= &\displaystyle{\mathsf{T}}\\ \displaystyle\text{lfp}({\Box\text{CF}})&=&\displaystyle{\mathsf{S4}}&\displaystyle\text{lfp}({D\text{CF}}) &=&\displaystyle{\mathsf{S5.}}&\\ \end{array} \end{align*} $$

Further application of such results is shown in the proof of Theorem 4 below.

1.4 Meta-logics and McKinsey

We conclude our tour of this semantics on a difficult problem that arises in this setting, a partial solution, and a connection to McKinsey’s semantics. Consider the class NA of interpretations in which there are no assumptions. For $I = (M, \varnothing , \lambda )\in \text {NA}(\lambda ),$ we have $I\vDash \Box \phi $ iff $\vdash _\lambda \phi $ , hence in such interpretations, we read the box as expressing membership in $\lambda $ . $V\text {NA}(\lambda )$ is not typically a logic, but we can consider the largest logic included in $V\text {NA}(\lambda )$ , which is the set of formulas $\phi $ such that every substitution instance of $\phi $ is in $V\text {NA}(\lambda )$ . Let us call this logic $\mathfrak {L}(\lambda )$ , or the meta-logic of $\lambda $ . Another way to define $\mathfrak {L}$ which makes less reference to our machinery: a valuation is a map v from formulas to truth-values such that $v(\bot ) = 0$ and $v(\phi \to \psi ) = 1$ iff $v(\phi ) = 0$ or $v(\psi ) = 1$ . For $\lambda $ a logic, a $\lambda $ -valuation is a valuation v such that for all $\phi $ , $v(\Box \phi ) = 1$ iff $\vdash _\lambda \phi $ . For any $\lambda $ , $\mathfrak {L}(\lambda )$ is the set of formulas $\phi $ such that every substitution instance of $\phi $ is assigned the value $1$ by every $\lambda $ -valuation. $\mathfrak {L}(\lambda )$ is the logic of the phrase ‘it is a theorem of $\lambda $ that…’. A fixed point of $\mathfrak {L}$ is a logic which is its own meta-logic. Remarkably, there are such logics—which we show in a moment—and so naturally we want to provide a characterisation of them. So call a valuation v McKinsey iff for all $\phi $ , $v(\Box \phi ) = 1$ just in case $v(\phi ') = 1$ for all substitution instances $\phi '$ of $\phi $ . These valuations populate the modal semantics of McKinsey [Reference McKinsey5]. Our main result is as follows.

This provides a characterisation of the fixed points of $\mathfrak {L}$ by way of a connection to McKinsey’s semantics, providing some nice corollaries. For instance, McKinsey [Reference McKinsey5] establishes that the set of formulas true for all McKinsey valuations is a normal extension of $\mathsf {S4M}$ , so, we have the following corollary.

This can be established independently of Theorem 3 by reasoning directly about $\mathfrak {L}$ . For example, it is straightforward that every fixed point of $\mathfrak {L}$ is normal, since every $\lambda $ -valuation for every logic $\lambda $ validates every substitution instance of the K axiom, and every $\lambda = \mathfrak {L}(\lambda )$ is closed under necessitation since $\phi \in \lambda $ always implies $\Box \phi \in \mathfrak {L}(\lambda )$ . This independence is important to note as the proof of Theorem 3 makes use of the following lemma.

Bacon and Fine [Reference Bacon, Fine, Ferrari, Brendel, Carrara, Hjortland, Sagi, Sher and Steinberger2, proposition 11] have shown all $\mathsf {Med}$ -valuations are McKinsey, where $\mathsf {Med}$ is the modal logic of Medvedev frames in Kripke semantics.Footnote ⁵ Hence it follows that at least one fixed point exists. Yet whether there are others seems currently out of reach. If there are others then by our findings this would establish a 50-year-old conjecture due to Friedman [Reference Friedman4, problems 41 and 42]. To see this, we note that Bacon and Fine have proposed a Uniqueness Conjecture, which says that for any set of sentence letters M, there is a unique McKinsey valuation v such that $v(p)=1$ iff $p \in M$ for all letters p. This amounts to the claim that McKinsey’s semantic clause succeeds in providing determinate truth-conditions for propositional languages; it also amounts to the negation of Friedman’s conjecture. If there is a fixed point of $\mathfrak {L}$ besides $\mathsf {Med}$ , call it $\lambda $ , then the Uniqueness Conjecture is false, since for any set of sentence letters $M,$ there will be at least two McKinsey valuations v, one a $\mathsf {Med}$ -valuation and the other a $\lambda $ -valuation, such that $v(p)=1\iff p\in M$ for all p. This connection suggests the question of further fixed points of $\mathfrak {L}$ will be hard to resolve.

2.1 Humeanism.

We consider a directly philosophical application of the semantics, which is the investigation of forms of modal reduction that equate necessity with derivability from some assumptions in some system of logic. The best known theory of this form is Sider’s modal Humeanism [Reference Sider6, chap. 12]. For the Humean, a statement $\phi $ is necessary if and only if it is deducible from a conventionally decided upon set of truths called ‘modal axioms’ by a conventionally decided upon set of truth-preserving inference rules called ‘modal rules’. In our terminology, where for ‘modal axioms’ we say ‘assumptions’ and for the set of ‘modal rules’ we say ‘the logic of evaluation’, Sider’s view is that $\Box \phi $ is true if and only if $\Gamma \vdash _\lambda \phi $ , where $\Gamma $ is a set of truths and and $\lambda $ a logic whose consequence relation is truth-preserving, both decided upon by convention. This appears to allow the Humean extreme liberty with respect to modal logic—something Sider emphasizes as an improvement on earlier forms of conventionalism. One asks: which modal principles are true, and which modal inference rules truth-preserving? The Humean says to take your pick. For any consistent modal logic $\sigma $ that extends $\mathsf {T}_0$ , and where M is the set of all atomic sentences that are true on some canonical reading, it is easy to pick some $\Gamma , \lambda \subseteq \sigma $ such that $(M, \Gamma , \lambda )\vDash \sigma $ so that, assuming Humeanism, all of the theorems of $\sigma $ will be made true.Footnote ⁶

But things are not as they seem. This line of reasoning stands or falls upon the assumption that any $\Gamma $ and $\lambda $ can be selected to serve as our set of assumptions and logic of evaluation—provided that they are then satisfied by the resulting interpretation $(M, \Gamma , \lambda )$ . But as I read the account, Sider seems committed to something stronger: that modal axioms must be true prior to their being recruited into service as modal axioms, and that modal inference rules must likewise be truth-preserving prior to their being incorporated into our set of modal rules. To require less than this would be to allow for a kind of bootstrapping, or more specifically, a kind of truth by convention in which the statements in $\Gamma $ become true, and the rules encoded in $\lambda $ become truth-preserving, because we assume them. Sider rejects the idea that a statement can be made true by fiat in this way as the key error of older forms of conventionalism, to which Humeanism is an intended successor [Reference Sider6, p. 268]. If this is all correct, the Humean should require that $\Gamma $ and $\lambda $ only contain principles that are true prior to our particular selection of modal axioms and rules. But this is quite a severe restriction. For example, it seems to imply that $\Gamma $ cannot contain any modal statements (in which a $\Box $ occurs) since modal claims are, according to the Humean, not true prior to a conventional choice of axioms and rules. It also seems to imply that $\lambda $ cannot contain anything other than principles valid from non-modal logic, for the same reason.Footnote ⁷ Therefore in the context of propositional logic, only interpretations of the form $I = (M, \Gamma , \lambda )$ , where $\Gamma $ contains no modal formulas and $\lambda =PC$ , seem to be admissible, in the sense that modal discourse allows us to select $\Gamma $ for our set of modal axioms and $\lambda $ for the logic consisting of our accepted modal rules. This severe restriction means that many modal principles cannot be made true by any acceptable conventional choice of assumptions and logic of evaluation. We use $\Box p\to \Box \Box p$ as an example. Suppose $\Gamma $ contains no modal formulas and that $(M, \Gamma , PC)\vDash \Box \phi \to \Box \Box \phi $ for all $\phi $ . Then, since $\Gamma \vdash _{PC}\top $ it follows that $\Gamma \vdash _{PC}\Box \top $ . But this is so only if $\Gamma $ contains some non-modal contradiction, meaning that $(M, \Gamma , PC)\not \vDash \Gamma $ , so that $\Gamma $ does not meet the requirement that assumptions be true. So no interpretation which meets the Humean’s restrictions validates all substitution instances of $\Box p\to \Box \Box p$ —or even $\Box \Box \top $ for that matter, which is already a theorem of $\mathsf {K}$ . This is indicative; things are no better for $\neg \Box p\to \Box \neg \Box p$ , for example. The upshot is that Humeanism properly understood is no less restrictive with respect to modal logic than older conventionalisms.

2.2 Procedural conventionalism

I want to suggest a fix for the Humean. I will call the view which results from adopting the fix ‘proceduralism’. Proceduralism departs from Humeanism concerning the way in which the set of assumptions and the logic of evaluation arise. For the Humean, convention works by fixing the set of assumptions and logic of evaluation directly. For the proceduralist, convention works by selecting what we will call an admissible procedure, which then goes on to construct the logic of evaluation and set of assumptions in stages. Each stage of the construction conforms to the stricture against bootstrapping raised earlier, adding to the assumption set and the logic of evaluation only statements that were already true in earlier stages of the construction. But because the process takes place in multiple stages, the end result of such a process can be a logic of evaluation and assumption set which each contain properly modal principles. In this way, the proceduralist hopes to regain some freedom with respect to modal logic while submitting to the same philosophical strictures which precluded such freedom for the Humean.

Some formal definitions will clarify the idea. A procedure shall be any map from interpretations to interpretations $(M, \Gamma , \lambda )\mapsto (M, \Gamma ', \lambda ')$ which modifies the set of assumptions $\Gamma $ and the logic of evaluation $\lambda $ while leaving the set of sentence letters M alone. We can apply any procedure $\mathfrak {a}$ to any interpretation I as many times as we like, generating a sequence of interpretations $I, \mathfrak {a}I, \mathfrak {aa}I,$ and so on. We are interested in such sequences where the original interpretation I is of the form $(M, \varnothing , \text {PC})$ , having no assumptions and nothing in the logic of evaluation save what is given in non-modal logic; interpretations of this form will be called ground interpretations. So we confine attention to procedures $\mathfrak {a}$ such that for any ground interpretation I, the sequence $I, \mathfrak {a}I, \mathfrak {aa}I,\ldots $ evolves in an acceptable way, converging towards and terminating at a natural limit. More precisely, an admissible extension of an interpretation $(M, \Gamma , \lambda )$ shall be an interpretation $(M, \Gamma ', \lambda ')$ with the same set of sentence letters such that $\Gamma \subseteq \Gamma '$ and $\lambda \subseteq \lambda '$ and $(M, \Gamma , \lambda )\vDash \Gamma '\cup \lambda '$ , so that the new assumptions and logical principles in the extended interpretation are already true in the original interpretation. An admissible procedure must first meet the requirement that (i) for all ground interpretations I and all natural numbers n, $\mathfrak {a}^{n+1}I$ is an admissible extension of $\mathfrak {a}^n I$ . This is what is meant by the sequence evolving in an acceptable way. This first requirement ensures that each $\mathfrak {a}^n I$ is factive, since only factive interpretations have admissible extensions. It also ensures that the sequence converges to a natural limit: where I is a ground interpretation and each $\mathfrak {a}^nI = (M, \Gamma _n, \lambda _n)$ , let $I^{\mathfrak {a}}:= (M, \bigcup _n\Gamma _n, \bigcup _n\lambda _n)$ . We want for this limit to also be factive, and we want it to be an end-point for the procedure, meaning that applying the same procedure further has no result. So we require that (ii) the limit $I^{\mathfrak {a}}$ is factive and a fixed point of $\mathfrak {a}$ . Summing up, a procedure is called admissible if and only if it satisfies (i) and (ii). A set of formulas $\Gamma $ is admissible iff there exists an admissible procedure $\mathfrak {a}$ such that $I^{\mathfrak {a}}\vDash \Gamma $ for all ground interpretations I.

Here is how these definitions fit into the picture. As said before, the proceduralist thinks that the way in which we arrive at our set of assumptions and our logic of evaluation (what Sider calls modal axioms and modal rules) is by adopting a conventional procedure. When we adopt a procedure, the assumption set and the logic of evaluation is generated in stages by repeated application of the procedure to the underlying ground interpretation. So if M is the set of all sentence letters that are really true under some canonical reading, then our ground interpretation is $I = (M, \varnothing , \text {PC})$ , and upon conventionally adopting the admissible procedure $\mathfrak {a}$ , the interpretation $I^{\mathfrak {a}} = (M, \Gamma , \lambda )$ now models our conversational context, in the sense that $\Gamma $ is our set of assumptions and $\lambda $ is our logic of evaluation. In selecting a procedure, we are restricted precisely to admissible procedures. This is because it is precisely such procedures which will build upon our ground interpretation in an acceptable way, via a sequence of admissible extensions and taking of unions: at each stage of the process of extension, adding only assumptions and logical principles that are true in prior stages. It is in this way that the proceduralist submits to the same stricture against bootstrapping imposed on the Humean. At the same time, as said above, they wish to recover some of the logical freedom which we earlier denied to the Humean on the basis of such strictures. The concept of admissibility sharpens this wish, because an admissible set of formulas is a set of formulas whose truth can be ensured by adopting some procedure. The proceduralist’s task now becomes that of establishing admissibility for larger and larger sets of formulas. Here is a particularly simple example.

Proof. We show that $\mathfrak {a}(M, \Gamma , \lambda ) := (M, \Gamma , V\text {INT}(\lambda ))$ is admissible. Note that for any M we have $\mathfrak {a}^n(M, \varnothing , \text {PC})= (M, \varnothing , V\text {INT}^n(\text {PC}))$ . Each $\mathfrak {a}^n(M, \varnothing , \text {PC})\vDash V\text {INT}(V\text {INT}^n(\text {PC})) = V\text {INT}^{n+1}(\text {PC})$ by definition of $V\text {INT}(\cdot )$ , so that each $\mathfrak {a}^{n+1}I$ is an admissible extension of $\mathfrak {a}^{n}I$ . So $\mathfrak {a}$ fulfils requirement (i) of being admissible. Moreover $(M, \varnothing , \text {PC})^{\mathfrak {a}}$ is defined for all M, and by Theorem 2, Kleene’s Fixed Point Theorem, and Corollary 2, we have

$$ \begin{align*} (M, \varnothing, \text{PC})^{\mathfrak{a}} =(M, \varnothing, \bigcup_{n} V\text{INT}^n(\text{PC})) = (M, \varnothing, \text{lfp}(\text{INT})) = (M, \varnothing, \mathsf{K}). \end{align*} $$

Because $\mathsf {K} = \text {lfp}(\text {INT})$ is a fixed point of $V\text {INT}(\cdot )$ , it follows that $I^{\mathfrak {a}}$ is factive and a fixed point of $\mathfrak {a}$ for any ground interpretation I. So $\mathfrak {a}$ fulfils requirement (ii) for admissibility. Now for any ground interpretation I, since $I^{\mathfrak {a}} = (M, \varnothing , \mathsf {K})$ is factive, we have $I^{\mathfrak {a}}\vDash \mathsf {T}_0 = V\text {FAC}$ . But additionally, for any formula $\phi ,$ we have $I^{\mathfrak {a}}\vDash \Box \phi \to \Box \Box \phi $ because, by normality, $\vdash _{\mathsf {K}}\phi $ implies $\vdash _{\mathsf {K}}\Box \phi $ . So $I^{\mathfrak {a}}\vDash \mathsf {S4}_0$ . Because $I^{\mathfrak {a}}$ is factive and has $\mathsf {K}$ for its logic of evaluation, we have $I^{\mathfrak {a}}\vDash \mathsf {K}$ . Since I was arbitrary, this holds for all ground interpretations. So both $\mathsf {S4}_0$ and $\mathsf {K}$ are admissible.

This suffices to show that the proceduralist makes a definite improvement over the Humean, for whom $\Box p\to \Box \Box p$ and general principles for normal logics like $\Box \ldots \Box \top $ were out of reach. It additionally demonstrates the relevance of results established in §1 to the philosophical task of working out proceduralism. This makes for a natural place to stop then, as a full treatment of admissibility is beyond our present scope.