Ordinal type theory

Abstract

ABSTRACTHigher-order logic, with its type-theoretic apparatus known as the simple theory of types (STT), has increasingly come to be employed in theorising about properties, relations, and states of affairs – or ‘intensional entities’ for short. This paper argues against this employment of STT and offers an alternative: ordinal type theory (OTT). Very roughly, STT and OTT can be regarded as complementary simplifications of the ‘ramified theory of types’ outlined in the Introduction to Principia Mathematica (on a realist reading). While STT, understood as a theory of intensional entities, retains the Fregean division of properties and relations into a multiplicity of categories according to their adicities and ‘input types’ and discards the division of intensional entities into different ‘orders’, OTT takes the opposite approach: it retains the hierarchy of orders (though with some modifications) and discards the categorisation of properties and relations according to their adicities and input types. In contrast to STT, this latter approach avoids intensional counterparts of the Epimenides and related paradoxes. Fundamental intensional entities lie at the base of the proposed hierarchy and are also given a prominent part to play in the individuation of non-fundamental intensional entities.KEYWORDS: Propertiesrelationsstates of affairstype theoryhigher-order metaphysicsfundamentality AcknowledgementsFor valuable discussion of (or related to) material presented in this paper, I am grateful to Andrew Bacon, Kit Fine, Peter Fritz, Jeremy Goodman, Daniel Nolan, Robert Trueman, and Juhani Yli-Vakkuri. Special thanks to Francesco Orilia for detailed comments on an earlier draft. For financial support, I am grateful to the Swiss National Science Foundation (grants 100012_173040 and 100012_192200).Disclosure statementNo potential conflict of interest was reported by the author(s).Notes1 I mainly have in mind Williamson (Citation2013), Dorr (Citation2016), Fritz and Goodman (Citation2016), Goodman (Citation2017), Bacon (Citation2019; Citation2020), Dorr, Hawthorne, and Yli-Vakkuri (Citation2021), and Bacon and Dorr (Citationforthcoming). Major influences on this literature include Prior (Citation1971) and Williamson (Citation2003). Skiba (Citation2021) offers a survey. Critical voices include Orilia and Landini (Citation2019), Hofweber (Citation2022), Whittle (Citation2023, 1642–1645), Menzel (Citationforthcoming), and Sider (CitationMS). Also cf. Florio (Citationforthcoming).2 In the literature of higher-order metaphysics, the term ‘state of affairs’ is usually avoided in favour of ‘proposition’. Nonetheless, I shall here speak of states of affairs (or simply ‘states’), as this term goes more naturally together with ‘property’ and ‘relation’, whereas ‘proposition’ connotes something more fine-grained and sentence-like. (Cf., e.g., Dorr [Citation2016, 54n.].)3 A more detailed overview of LFO can be found in Shapiro and Kouri Kissel (Citation2018).4 This notation follows Williamson (Citation2013, 221f.), whose notation is a variant of that introduced by Gallin (Citation1975, 68).5 Thiel (Citation2002) gives a brief overview and helpful discussion of Behmann’s correspondence, relating to his proposal, with Gödel and Dubislav. Also cf. Feferman (Citation1984). In a letter to Behmann, Ramsey wrote that ‘the hierarchy of functions and arguments is the one part [of the Theory of Types] which I feel can hardly be questioned’ (Mancosu Citation2020, 24). He did not elaborate why he felt that way.6 Cf. also Tarski (Citation1935, §4), who proposes a form of STT based on considerations about the ‘semantical categories’ of natural-language expressions. In his postscript, however, he abandons his earlier standpoint and takes quite seriously the possibility that STT may need to be given up in the interest of expressive power.7 A recent defence of STT that draws explicitly on Fregean ideas can be found in Button and Trueman (Citation2022), which in turn invokes Trueman’s (Citation2021) defence of ‘Fregean realism’. Trueman’s central thesis is that ‘it is nonsense to suppose that a property might be an object’ (2n.). Here an object is understood to be ‘anything which can be referred to with a singular term’, while a property is ‘anything which can be referred to with a predicate’ (1f.). Later in the book the relevant concept of reference undergoes a bifurcation when Trueman distinguishes between ‘term-reference’ and ‘predicate-reference’. At a crucial juncture, Trueman’s argument appeals to the requirement that ‘the notion of reference appropriate for predicates must allow us to disquote predicates’ (p. 52). But it is not very clear why this requirement should be accepted.8 Cf. Jones (Citation2018, §4.2). The rest of this paragraph is largely in line with §3.3 of the same paper.9 In §3 of his ‘A Case for Higher-Order Metaphysics’ (Citationforthcoming), Andrew Bacon argues for the virtues of STT over ‘property theory’ in part by maintaining that such questions as ‘Is wisdom located?’ or ‘Is wisdom concrete or abstract?’ do not have ‘straightforward higher-order analogues’. It is true that, in an STT-based setting, it is not obvious that these questions have higher-order analogues. But this just means that we are faced with the difficult question of whether they have such analogues; and here of course it is not enough to verify that they have no higher-order analogues in English. For instance, there may (assuming STT) be a fundamental entity of type 〈〈e〉,〈e〉〉 that behaves just like a metaphysically primitive co-location relation among entities of type 〈e〉. Although considerations of ontological parsimony give us a reason to think that there isn’t, this does not mean that the question does not arise.A second way in which Bacon regards higher-order metaphysics as separate from ‘property theory’ rests on the idea, which goes back at least to Prior (Citation1971, ch. 3), that quantification into predicate-position is a purely logical affair. For instance, the existential generalisation ‘Socrates somethings’ is supposed to follow unproblematically from ‘Socrates is wise’; and since one can accept ‘Socrates is wise’ without having to believe in properties, ‘Socrates somethings’ should be similarly free of ontological commitment to properties. (Cf. also Liggins [Citation2021, 10028].) But notice that, if this argument works at all, it cuts both ways: one can accept ‘Socrates is wise’ without having to believe in STT or any of the ‘higher-order entities’ posited by higher-order metaphysicians. Hence, if ‘Socrates somethings’ does indeed follow logically from ‘Socrates is wise’, then that sentence should not carry any commitment to such entities, either.A final point worth noting is that Bacon uses as his foil a rather specific form of ‘property theory’, whereas there are of course various possible ways to develop a theory of properties (and relations). As far as I can see, nothing hinders our regarding STT as one of these ways; though obviously this is not to say that STT, thus understood, will be unproblematic.10 Thanks to an anonymous referee for raising this issue.11 The subscript-less symbols ‘∀’ and ‘∃’ that are used throughout this section should be read as merely abbreviatory devices. Cf., e.g., Church (Citation1940, 58).12 On the intrinsic/extrinsic distinction, see, e.g. Plate (Citation2018) and references therein.13 Cf., e.g., Chierchia (Citation1982), Menzel (Citation1986, 3f.; Citation1993, 64f.), Bealer and Mönnich (Citation2003, §10).14 Similar remarks apply if one thinks of entities of type 〈〉 as sets of possible worlds. Indeed it might be wondered whether we should not, following Lewis (Citation1986), conceive of intensional entities along these lines; but here I shall be taking for granted that the answer is ‘no’. (For relevant critical discussion, see, e.g., Schnieder [Citation2004, 72f.].)15 Prior (Citation1961) and Bacon, Hawthorne, and Uzquiano (Citation2016, 532) describe essentially the same conundrum. By similar reasoning (also within STT), already Chwistek reached the puzzling conclusion that ‘I cannot […] consider as interesting those and only those propositions which I wish so to consider’ (Citation1921, 344f.). Related problems include the Russell–Myhill paradox and intensional analogues of, e.g., Grelling’s paradox and the ‘infinite liar’ paradox devised by Yablo (Citation1993). A form of the Russell–Myhill paradox will be briefly discussed in footnote 39 below. For relevant discussion of Grelling’s paradox, see Church (Citation1976).16 One of the ‘special cases’ just alluded to is the case in which Q〈〈〉〉 is the property of being identical with s, for some state s. (For example, let s be the state that snow is white.) The question of whether ∃x〈〉(Q〈〈〉〉(x〈〉)∧x〈〉) obtains will then come down to whether s obtains. Moreover, the stipulation that Q〈〈〉〉 should itself be instantiated by ∃x〈〉(Q〈〈〉〉(x〈〉)∧x〈〉) ‘and by nothing else’ will be satisfied as long as states are individuated in a sufficiently coarse-grained manner. In particular, s has to be identical with ∃x〈〉(Q〈〈〉〉(x〈〉)∧x〈〉) – i.e. with the state that some state identical with s obtains. This requires a somewhat coarse-grained conception of states, but the required level of coarse-grainedness is arguably far from implausible. So here we have a case where, under not-implausible assumptions, the question of whether ∃x〈〉(Q〈〈〉〉(x〈〉)∧x〈〉) obtains is not left indeterminate (Thanks to Andrew Bacon and Jeremy Goodman for alerting me to this point). Even so, it is clearly a rather special case. If Q〈〈〉〉 were instead, say, the property of being Quine’s favourite state, there would be no such easy path to determinacy.17 The quotation is from Mortensen and Priest (Citation1981, 385), who discuss a simpler truth-teller paradox.18 In this connection, cases of ‘reciprocal negation’ – pairs of sentences, propositions, or states of which each ‘says’ of the other that it is false – also deserve consideration. (For discussion, see, e.g., Sorensen [Citation2001, ch. 11; Citation2018, §9], Armour-Garb and Woodbridge [Citation2006]; Greenough [Citation2011]. As Sorensen notes, the problem goes back to Buridan.) Let P〈〈〉〉 and Q〈〈〉〉 be the properties of, respectively, being Prior’s favourite state and being Quine’s favourite state, let p〈〉 and q〈〉 be, respectively, the states ∀x〈〉(P〈〈〉〉(x〈〉)→¬x〈〉) and ∀x〈〉(Q〈〈〉〉(x〈〉)→¬x〈〉), and suppose that p〈〉 is the only thing that instantiates Q〈〈〉〉 while q〈〉 is the only thing that instantiates P〈〈〉〉. Question: Which of p〈〉 and q〈〉 obtains? The symmetry of the situation strongly suggests that they either both obtain or both fail to obtain, but either of these options leads to a contradiction.19 For example, the extensionality axiom will be to the effect that no two sets have all their members in common.20 For example, when below it is stipulated that ‘⊤’ abbreviates ‘&()’, the quotation marks should be understood as serving to construct names of representations of L-expressions. Using them instead to form names of L-expressions, we would have to say that ‘⊤’ is identical with ‘&()’. Quinean corner-quotes will be used in a similarly ambiguous way.21 As for which letter is to be used to represent a given variable, any convention at all would do, and so I shall leave this open. That there are far more ordinals than letters won't matter in practice.22 This formulation (‘everything there is’) might give rise to meta-ontological qualms, as it appears to presuppose an absolutely general (as opposed to ‘indefinitely extensible’) domain of entities. I acknowledge this presupposition, but will here not be trying to defend it.23 Throughout this paper, unless otherwise specified, sequences may be of any set-sized length.24 The conjunction of ‘no’ things is the empty conjunction, symbolised as ‘&()’ or ‘⊤’. It can be thought of as the state that obtains ‘no matter what’.25 Cf., e.g. Goodman (Citationforthcoming, §3.3).26 It might be thought that talk of ‘individuals’ should be understood as referring to all and only those things that can be denoted by singular terms; but this is hardly convincing. Let x be some non-individual entity, for instance of type 〈e,〈〉〉: on the face of it, nothing prevents us from introducing a singular term that denotes x. The STTler may point out that the relevant denotation relation would have to be of a different type than that which holds between singular terms and individuals. But this would be to presuppose, if not STT itself, then some similarly problematic division of entities into logical types. (Likewise if it is suggested that the individuals are just those things that are ranged over by ‘our first-order quantifiers’.) Alternatively it might be supposed that an individual is simply anything that is neither an attribute nor a state. (Cf. Whitehead and Russell [Citation1910, 53], where individuals are understood to be ‘objects which are neither propositions nor functions’.) But someone who takes this route can of course no longer maintain that a commitment to the existence of attributes and states is a commitment to the existence of certain special kinds of ‘individuals’.27 An objector might argue that there are, or may well be, multigrade relations, which have more than one adicity. (Cf. MacBride [Citation2005, §2].) To adjudicate this issue, we would have to clarify what, exactly, a relation should be taken to be. For now it may suffice to say that (A1) recommends itself at least as a simplifying assumption, and that its main purpose within the present theory lies in settling certain questions that would otherwise be left as glaring lacunae. For an example that will become relevant in Section 5.4, consider the question of whether the tautologous formula ‘x=x’ analytically entails ‘x=λyx(y)’. With the help of (A1), this can be answered in the negative. For, under the semantics of L, ‘x=x’ denotes a state relative to every variable-assignment that is defined on ‘x’, whereas ‘x=λyx(y)’ has a denotation relative to a given variable-assignment only if the latter maps ‘x’ to a property. Let now g be some assignment that maps ‘x’ to the identity relation. By (S5), this relation is dyadic, and hence, given (A1), not monadic: it is not a property. Consequently, relative to g, ‘x=x’ denotes a state while ‘x=λyx(y)’ denotes nothing at all. So ‘x=x’ does not analytically entail ‘x=λyx(y)’.28 Cf. Dorr (Citation2016, 100). An earlier version can be found in Ramsey (Citation1925/Citation1931, 35). Anderson’s (Citation1986, §1) criticism can be answered by pointing out that the domain of quantification contains all sets and hence contains proper-class many entities.29 Note that, for any untyped variable v, this second conjunct is trivially satisfied. Hence, any untyped variable will simply denoteI,g whatever entity it is mapped to by g, provided that g does map it to some entity. (Since there are proper-class many variables, no variable-assignment is defined on all of them.)30 The concept of class serves here merely as an informal convenience; likewise the concept of a variable’s range. I am introducing the latter only for the purpose of formulating the basic idea behind the definition of ‘order of’, which is given below.31 To see this, note that ‘⊤’ and ‘⊥’ respectively abbreviate ‘&()’ and ‘¬&()’. (Cf. Section 3.2.4 above.) So ⊤ and ⊥ are respectively denoted, relative to any interpretation and variable-assignment, by ‘&()’ and ‘¬&()’, which contain no occurrences of any atomic terms.32 Let x be any particular or fundamental intensional entity, let I be the empty set, let t be any untyped variable, and let g be any variable-assignment that maps t to x. From clause (d3) of the above semantics, it then follows that t denotesI,g x; so condition (o1) on the right-hand side of Definition 16 is satisfied. Condition (o2) is also satisfied. And since t contains no bound variable-occurrence, condition (o3) is satisfied for β=0.33 Let s be any state and α any ordinal. To prove the left-to-right direction, suppose that s is of order α. It is then clear that ¬s is of at most order α, since, for any interpretation I, variable-assignment g, and term t: if t denotesI,g s, then ⌜¬t⌝ denotesI,g ¬s. Now let β be any ordinal such that ¬s is of order β. By what has just been said, we have that β≤α. Further, by an argument analogous to the foregoing, it can be seen that ¬¬s is of at most order β. But, by (S6), ¬¬s is nothing other than s. This shows that α≤β, and so we have that α=β, as required. The right-to-left direction can be shown in a similar way.34 Whether N will really be classified as first-order depends, roughly put, on what other formulas it can be denoted by, and thus depends on how finely states are individuated. We will return to this topic in Section 5.5.3.35 For an overview of the main approaches to avoiding semantic paradox, see, e.g. Horsten (Citation2015, 687ff.) and Beall, Glanzberg, and Ripley (Citation2018, ch. 5). For more detailed critical discussion of some recently popular approaches, see Murzi and Rossi (Citation2020a; Citation2020b). Also cf. Hansen (Citation2021), Sher (Citation2023).36 The reason for this lies ultimately in clause (d3) of the above semantics.37 Incidentally, the property P, if it exists, will be nothing other than λx1¬x1(x1). This can be seen from the semantics of lambda-expressions – given that P=λx¬R(x,x) and R=λx1,yx1(y) – in combination with (A2). Regarding the question of whether P does exist, cf. Section 5.1 below. Regarding the question of whether it is zeroth-order, see Section 5.5.3.38 To verify this, one has to consult clauses (d4) and (d6) of the above semantics, bearing in mind that, as stated in Section 3.3.2, the negation of a state s obtains iff s itself doesn’t, and that the existential quantification of an attribute obtains iff that attribute has an obtaining instantiation.39 On the reciprocal-negation paradox, cf. footnote 18 above. For a simple version of the Russell–Myhill paradox as it arises in the context of STT, consider the property F of being Frege’s only favourite entity of type 〈〈〉〉. Surely, for any distinct entities x and y of that type, the world will have to be at least a little bit different if F(x) obtains than if F(y) obtains; and so F(x) has to be distinct from F(y). (I am here omittingsuperscripts for the sake of readability.) But now let M be a property of type 〈〈〉〉, of being an entity x of type 〈〉 that is identical with the state F(y) for some entity y of type 〈〈〉〉 such that y(x) fails to obtain, or in symbols: M=λx〈〉∃y〈〈〉〉(¬y〈〈〉〉(x〈〉)∧(x〈〉=F〈〈〈〉〉〉(y〈〈〉〉))). If we ask whether the state F(M)instantiates M, we are led to a contradiction. The upshot would seem to be that the STTler has to reject the existence of such properties as being Frege’s only favourite entity of type 〈〈〉〉. But provided that one buys into STT and its type distinctions at all, this is certainly an awkward result.To see how the OTTist avoids being saddled with an analogous result, let G be the property of being Gödel’s only favourite entity. To construct an analogue of M, the best we can do is to let N be the property of being an entity x that is identical with the state G(y) for some zeroth-order entity y such that y(x) fails to obtain, or in symbols: N=λx∃y1(¬y1(x)∧(x=G(y1))). From the type of ‘y1’, it can be inferred that N is at most first-order; yet nothing (on the face of it) commits us to holding that N is zeroth-order. But if it isn’t, then it falls outside of the range of ‘y1’, which is enough to block the paradox.40 This ‘doctrine’ is loosely related to Russell’s vicious circle principle. It is also not too distantly related to Behmann’s (Citation1931) proposal, already briefly mentioned in Section 2.2 above, that no predicate is predicable of a given object unless the predication can be rewritten in primitive vocabulary. Behmann has presented a more sophisticated version of his proposal in his (Citation1959). However, neither this nor the original version offers an escape from Epimenidean paradoxes.41 It is tempting to envision a broadly similar approach to the semantics of vague predicates, such as ‘is bald’ or ‘is a table’. The idea would be that, even though there are no properties of tablehood and baldness (i.e. no properties precisely corresponding to ‘is a table’ and ‘is bald’), there are properties that may be said to be picked out by possible precisifications of these predicates, and this is enough to keep them from being semantically defective – or at least enough to render them less semantically defective than, say, ‘is phlogiston’ or ‘orbits Vulcan’.42 Let R be the mentioned (hypothetical) relation, i.e. λx,y,z∃w((w=y)∧(x=w(z))). The reason why we are here considering this relatively complicated relation instead of the simpler λx,y,z(x=y(z)) lies in the fact that the latter relation would, if it were to exist, have an instantiation by entities x, y, and z, in this order, only if there actually existed an instantiation of y by z. It would thus not be a ‘generally applicable’ relation, whereas R, if it were to exist, would have an instantiation by x, y, and z, in this order, even if there were no instantiation of y by z.To return to the paradox, let Q be the property λx∃y(R(y,x,x)∧(y≠⊤)), and consider whether the state Q(Q) obtains. We can first note that Q(Q) is the state ∃y(R(y,Q,Q)∧(y≠⊤)), which, given that R=λx,y,z∃w((w=y)∧(x=w(z))), and given (S6), is identical with (*) ∃y,w((w=Q)∧(y=w(Q))∧(y≠⊤)).(*) From this it is easy to see that, if Q(Q) obtains, then it is distinct from ⊤. However, R is denoted∅,∅ by a term that contains no non-logical constants or free variables; and so the same goes for Q and Q(Q). Consequently, if Q(Q) obtains, then it and ⊤ necessitate each other, which by (S6) means that they are one and the same state. Since a state cannot be both distinct from and identical with ⊤, we can conclude that Q(Q) does not obtain. So it must be distinct from ⊤ (since ⊤ trivially obtains). But from this it can be inferred that (∗), i.e. Q(Q) itself, does obtain: contradiction.43 An objector might argue that I have put the cart in front of the horse: rather than to justify the hierarchy by relying on the assumption that my talk of instantiation is semantically non-defective, I should have established the hierarchy before indulging in talk of instantiation. Arguably, however, one can legitimately proceed in the opposite direction if there is independent reason to think that talk of instantiation is non-defective. Such a reason is given by the theoretical usefulness of the concept of instantiation in drawing up a theory of intensional entities. (Cf. also Section 6.1 below.)44 To be sure, the existence of R does not follow from the above ontology. But let us ignore this for the sake of the example.45 Let x be any entity, and let t be any term that denotes∅,∅ x. By the semantics of L, it can be seen that any atomic term that occurs free in t is identical with ‘I’ and hence denotes∅,∅ the identity relation. By (F1) (together with Definition 16), it follows that x is zeroth-order.46 Suppose for reductio that P is zeroth-order, and let Q be the property λy1((y1=P)∧y1(y1)). Since P=λx¬∃y1((y1=x)∧y1(y1)), the state P(P) obtains iff Q lacks an obtaining instantiation. Given that P is zeroth-order, Q has an instantiation by P, namely ((P=P)∧P(P)). Suppose now that P(P) obtains. It then follows that Q lacks an obtaining instantiation, so that, in particular, Q(P) does not obtain. But Q(P) is the conjunction of (P=P) and P(P). Since (P=P) trivially obtains, we thus have that P(P) fails to obtain, contradicting the supposition. So we can conclude that P(P) does not obtain. But clearly, Q does not have an obtaining instantiation by any entity distinct from P. Hence Q does not have an obtaining instantiation, which means that P(P) obtains, after all: contradiction. This completes the reductio. We can thus infer that P is not zeroth-order. So it must be first-order, since it is denoted∅,∅ by ‘λx¬∃y1((y1=x)∧y1(y1))’.47 For related discussion, see, e.g. Sider (Citation2011, 219), Bacon (Citation2019, 1020; Citation2020, 569).48 Bacon (Citation2020, 566) has a roughly analogous principle of ‘Fundamental Completeness’.49 The point of requiring the symmetry statements in question to be true∅,g is to avoid weakening (F4) in such a way that, for any fundamental dyadic relation R that is distinct from its non-trivial converse λx,yR(y,x), (F4) no longer entails, e.g. that the state (R≠λx,yR(y,x)) does not necessitate ∀x,yR(x,y). This would leave an unwelcome lacuna. (On the other hand, if R were identical with λx,yR(y,x), then the state (R≠λx,yR(y,x)) would necessitate ∀x,yR(x,y), as it would be nothing other than the ‘impossible’ state (R≠R).) Similarly, the point of requiring the symmetry statements in question to be ontologically conservative relative to t is to avoid weakening (F4) in such a way that it no longer entails, e.g., that for any particular or fundamental property x and any fundamental relation R (other than identity), the state (x=x) does not necessitate (R=R).50 See footnote 56 below for a version of this argument that relies on (F4) in its fully developed form.51 More precisely: to ensure compatibility with (F2) in conjunction with the claim (which should arguably not be ruled out a priori) that there exists at least one fundamental relation R with a distinct converse R′. To see the problem, let u and v be two variables that are under g mapped to (respectively) R and R′. Then the formulas u=u and v=v will respectively denote∅,g the self-identity of R and the self-identity of R′, which necessitate each other. Moreover, by (F2), R′ is fundamental, given that R is. Yet ⌜u=u⌝, even in conjunction with admissible symmetry statements, does not analytically entail ⌜v=v⌝.52 With some qualifications, (F4) can be considered a counterpart of Bacon’s (Citation2020, 547) principle of ‘Quantified Logical Necessity’. An important difference (among several) lies in the fact that, where Bacon’s principle invokes a monadic notion of logical necessity, (F4) relies instead on the dyadic notion of necessitation.53 I say ‘in principle’ because there are cases in which the procedure cannot be carried out: after all, given (F1), not every intensional entity is non-fundamental.54 The proof of this assertion requires the use of (F3), which is needed to guarantee that there exists a term that denotes the respective set relative to a variable-assignment g that satisfies clause (iii) of (F4). (For a similar reason, (F3) is also needed to prove the next assertion.)55 By contrast, there may be fundamental instantiations of non-fundamental attributes. For example, suppose that there exists a fundamental state s. Then s is zeroth-order, so that the non-fundamental property λx1x1 has an instantiation by s. But that instantiation is nothing other than s itself, and is therefore fundamental.56 Let s be any fundamental state (assuming that there is one), let u and v be two variables of type 1, let g be the smallest variable-assignment that maps u to s and v to ¬s, and let τ be the formula ⌜¬u⌝. The reductio succeeds because ⌜&(v)=&(v)⌝ does not analytically entail ⌜&(v)=¬u⌝.57 Suppose for reductio that there are two fundamental states s and s′ such that s necessitates s′. By the definition of ‘necessitates’, there then exist an interpretation I, a variable-assignment g, and terms t and t′ such that (i) t and t′ respectively denoteI,g s and s′ and (ii) t analytically entails t′. Then t also analytically entails ⌜t∧t′⌝. But ⌜t∧t′⌝ denotesI,g (s∧s′), which is therefore necessitated by s. Likewise, s is necessitated by (s∧s′). Hence, by (S6), s is identical with (s∧s′). So s is a conjunction of two fundamental states. From the result stated in the text (namely, that the conjunction of any two fundamental states is not fundamental), it now follows that s fails to be fundamental, contrary to hypothesis.58 Let P be this property, let ρ be ‘λx1¬x1(x1)’, let t be ⌜ρ=ρ⌝, and suppose for reductio that P is zeroth-order. By Definition 16, there then exist an interpretation I and a variable-assignment g relative to which P is denoted by a term τ that satisfies the following two conditions: Any atomic term that is either identical with τ or has in τ a free occurrence at predicate- or sentence-position denotesI,g either a particular or a fundamental intensional entity.No variable has in τ a bound occurrence at predicate- or sentence-position.Without loss of generality, we may take I to be the empty set and suppose that g and t jointly satisfy clauses (ii)–(v) of (F4). Given that τ denotes∅,g the property P, which is purely logical and hence (as shown above) non-fundamental, it follows from (1) that τ is non-atomic. Now assume the following holds:At least one atomic term has in τ a free occurrence at predicate-position.Let u be any such term, and let t′ be ⌜ρ=τ⌝. Evidently u does not occur free in ρ. Hence, unless u is the constant ‘I’, any conjunction of t with zero or more admissible symmetry statements will not analytically entail t′; for there will exist an interpretation and variable-assignment relative to which t has a denotation while t′ doesn’t. But, since ρ and τ denote∅,g the same entity (viz., P), we have that t and t′ denote∅,g one and the same state s. From (F4), it now follows that t, possibly together with one or more admissible symmetry statements, analytically entails t′. By what has just been said, we can thus infer that u is the constant ‘I’. But u was any atomic term that has in τ a free occurrence at predicate-position. Hence, given (2), we have that no atomic term other than ‘I’ occurs in τ at predicate-position. (At this point we can ‘discharge’ the above assumption (3).) Given (S5), it can now be seen, by induction over the complexity of τ, that any property denoted∅,g by τ must have an instantiation by any zeroth-order entit