russell: the Journal of Bertrand Russell Studies n.s. 36 (summer 2016): 5–44 The Bertrand Russell Research Centre, McMaster U. issn 0036–01631; online 1913–8032 c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 ^rticles THREE UNPUBLISHED MANUSCRIPTS FROM 1903 Kevin C. Klement Philosophy / U. Massachusetts–Amherst Amherst, ma 01003, usa klement@philos.umass.edu I present and discuss three previously unpublished manuscripts written by Bertrand Russell in 1903, not included with similar manuscripts in Volume 4 of his Collected Papers. One is a one-page list of basic principles for his "functional theory" of May 1903, in which Russell partly anticipated the later Lambda Calculus. The next, catalogued under the title "Proof That No Function Takes All Values", largely explores the status of Cantor's proof that there is no greatest cardinal number in the variation of the functional theory holding that only some but not all complexes can be analyzed into function and argument. The final manuscript, "Meaning and Denotation", examines how his pre-1905 distinction between meaning and denotation is to be understood with respect to functions and their arguments. In them, Russell seems to endorse an extensional view of functions not endorsed in other works prior to the 1920s. All three manuscripts illustrate the close connection between his work on the logical paradoxes and his work on the theory of meaning. ttached below are three previously unpublished manuscripts written by Bertrand Russell. They are not explicitly dated, but internal evidence leaves little doubt that they were written in 1903, probably near the middle of the year. They are of the same general nature as the manuscripts published in Volume 4 of Russell's Collected Papers (Parts i–iii), and most closely relate to its Paper 3, "Functions". The reader should not read them in isolation, but consider them in the context of the other manuscripts published in that volume. They were known when the volume was ^= 6 kevin c. klement c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 published and are mentioned in one of its appendices (4: 633–4). They were perhaps considered too short, too redundant, or too unpolished for inclusion, though the difference between them and the material that was published is at most a matter of degree. The first is a single sheet on logical principles governing functions (ra1 230.030920). The second is a 25-leaf manuscript catalogued under the title "Proof That No Function Takes All Values" (230.030850). It is rather rough, and is written mostly in symbols. It does not display a clear paragraph structure and large portions are crossed off or marked by Russell himself as wrong. It was clearly never intended for public consumption. The final manuscript contains two leaves and is titled "Meaning and Denotation" (230.030950), and deals with the application of Russell's pre-1905 distinction between meaning and denotation to functions and their arguments. The three manuscripts together demonstrate the close interconnection between, on the one hand, Russell's work on logical first principles governing classes and functions (driven by the need to solve the logical paradoxes) and, on the other, his work on the theory of meaning, including his evolving views on the nature and identity conditions of propositions and other complexes.1 1. historical background In 1903, Russell's chief philosophical occupation was the attempt to solve certain logical paradoxes, especially the antinomy of classes now known as "Russell's paradox", which he simply referred to as "the Contradiction". In his journal of 23 May 1903, Russell wrote, "Four days ago, I solved the Contradiction-the relief of this is unspeakable" (Papers 12: 24). What he discovered was the first version of a "no classes" theory of classes, one in which the role played by classes in symbolic logic was given over to propositional and other functions. If there are no classes at all, then there is certainly no such class as the 1 Because these manuscripts are likely to be of interest primarily to those interested in charting the development of Russell's thought, his own deletions have been retained, but struck out, except where completely illegible in the manuscripts. Angled brackets 〈 〉 are used for editorial insertions meant to improve readability or grammaticality. Underlining has been changed to italics when it appears to be used merely for emphasis, but has retained when used for other purposes. For the sake of consistency, certain minor alterations were made, such as changing lowercase "sim" and "cls" to "Sim" and "Cls" throughout. Various abbreviations frequently used by Russell have been silently expanded. Three Unpublished Manuscripts from 1903 7 class of all classes not members of themselves, and that version at least of Russell's paradox no longer threatens. Russell wrote excitedly to Frege the following day (24 May 1903): I believe I have discovered that classes are entirely superfluous. Your designation ἐ ε can be used for itself, and (ἐ for . (I write ε instead of (, like Peano.)2 Russell's inspiration here was Frege's notation for the "value-range" (Werthverlauf ) of a function. The notation consists of a bound variable written first with a "smooth-breathing" (spiritus lenis) accent mark followed by an expression containing the variable. In particular, "ἐ	... ε ..." is to be taken as a name for the value-range of a function whose value for ε as argument is ... ε.... Russell rejected Frege's rigid type distinction between functions and objects, and with it, Frege's distinction between a function and its value-range, and so his intention, as he makes it clear above, is to use this notation for the function itself. Unlike Frege, Russell used his notation, "  ... x ...", with any letter as a variable, not just Greek vowels. It was thus a notation for function abstraction, a precursor to Church's Lambda Calculus notation, " ... x ...". At least as it comes across in the letter to Frege, Russell's strategy seems fairly simple.3 In his symbolic logic, class variables such as and would be replaced by function variables and , which would be allowed in subject position. Class abstracts would be replaced by function abstracts. He would continue to use the membership sign "ε" but reinterpret it to mean the application of a function to argument (similar to Frege's "("). He also wrote " | " for the value of with as argument, so that, at least if is a function, " ε " and " | " would be notational variants. In the letter to Frege, Russell goes on to define relations and 2 See Frege, Philosophical and Mathematical Correspondence (1980), pp. 158–9. Russell's correspondence with Couturat is also relevant; see Russell, Correspondance sur la philosophie, la logique et la politique avec Louis Couturat (1897–1913) (2001). 3 Whether Russell's intention was really so simple, and what led him to this view, is a complicated matter, and somewhat controversial. For a variety of positions, see Cocchiarella, "Wither Russell's Paradox of Predication" (1973); Landini, "Russell to Frege 24 May 1903: 'I Believe I Have Discovered That Classes Are Entirely Superfluous' " (1992); and Klement, "The Origins of the Propositional Functions Version of Russell's Paradox" (2005). 8 kevin c. klement c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 properties of functions similar to the usual relations and properties of classes (subset, etc.), defining the number of 's as the function  Sim , i.e., the function satisfied by a function just in case a 1 → 1 correlation exists between the 's and 's. Russell's imagined system of function abstraction came several steps closer to modern Lambda Calculi than did Frege's system of value-ranges.4 For example, Russell anticipated Schönfinkel's method of treating multi-argument functions as single-argument functions whose values are themselves functions. Thus rather than thinking of " " as representing a function with two arguments, writing "2 3 ", one might write " |2 |3". Here " " represents a function; its value for 2 as argument is the function written here as " |2 ", which itself takes an argument and yields as value two more than that argument. Hence " |2 |3" stands for five. At least early in this period, Russell did not distinguish logically between propositional functions and other functions (later called "denoting functions"). Thus the notation could be used for both functions such as (the center of mass of ), whose value for an occupied physical region as argument would be a point in space, as well as a function such as (Plato loves ), whose value for something as argument is the proposition that Plato loves it. Relations then could be understood as functions with functions as value, and " " be used as shorthand for " | | ", just as with " ". Abstracts for functions with functions as value, doing the work of relations and other multiargument functions, could be written with successive smooth-breathing abstractors. E.g., "   loves )" would represent the function whose value for Plato as argument is the function (Plato loves ), and so "[   loves )|Plato]|Socrates" would be another name for the proposition that Plato loves Socrates. At this time, Russell's logic embraced an all-encompassing logical type of "entity" (PoM, p. 43), and the variables of his logic were taken as unrestrictedly quantifying over all entities whatsoever. Without further qualifications then, there is nothing preventing a function from taking other functions, or even itself, as argument. As Russell soon discovered, this meant that the simple form of his functional theory did not escape Russell's paradox after all, as it could be formulated in 4 For further comparison between Russell's approach at this time and later systems, see Klement, "Russell's 1903–05 Anticipation of the Lambda Calculus" (2003). Three Unpublished Manuscripts from 1903 9 terms of a function W satisfied by all and only functions not satisfying themselves. Russell reported his 1903 discovery of this in a 1906 letter to Jourdain as follows: Then, in May 1903, I thought I had solved the whole thing by denying classes altogether; I still kept propositional functions, and made do duty for  . I treated as an entity. All went well till I came to consider the function W, where . ≡ . ~ . This brought back the contradiction, and showed that I had gained nothing by rejecting classes. ... Gradually I discovered that to assume a separable in is just the same, essentially, as to assume a class defined by , and that non-predicative functions must not be analysable into a and an .5 Russell understood a function as something got by differentiating one element in a complex from the remainder, where the remainder is the function. The realization then seems to have been that not every complex containing an entity can be divided cleanly into that entity and a function as "remainder". Russell began to speak of "functional complexes" and wrote: Focp to mean that is a functional complex of and remainder. Technically this means that Russell would reject the usual higher-order comprehension principle for functions: ∃ | ... ...), where ... ... is an expression containing but not free Instead, he would accept only a weaker version, perhaps along the lines of: ∃ Focp ⊃ ∃ | Russell seems to use the uppercase letter " " for a complex containing 5 See Grattan-Guinness, ed., Dear Russell-Dear Jourdain (1977), pp. 78–9. 10 kevin c. klement c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 the entity represented by the lowercase " ", and " " for a complex containing the entity represented by lowercase " ". In modern terminology, it is perhaps a bit unclear, however, whether " " and " " are best interpreted as object-language variables for complexes, or as metalinguistic schematic letters to be replaced in particular instances with complex expressions containing " " or " ". Nonetheless, it appears that when " " in such a context is replaced by a particular instance containing " ", the " " in question can be bound by quantifiers with a scope narrower than the whole formula. Russell does not seem to have discovered a way of stating a general criterion for the functionality of complexes, nor even a partial demarcation that allowed what was necessary for his logicist project to proceed. By 1904 at least, Russell concluded that abandoning classes in favor of functions did not have the advantages he initially imagined, and returned to a realism about classes, employing certain variations of what he called the "zigzag theory" (see EA, pp. 145–51) to address the paradoxes involving classes. Nonetheless, some of the core themes and ideas of the 1903 "functional theory" remained. As late as early 1905, Russell spoke of what he then called "modes of combination" of an entity x within a complex ≬ such that the remainder of the complex over and above cannot always be thought of as a separate entity, or function (see, e.g., Papers 4: 366), still without giving conditions for when it can. Stability on these issues was not reached until after his discovery of the theory of descriptions in 1905, which made non-propositional functions unnecessary, and which allowed him to develop a "substitutional theory" on which the notion of a propositional function was replaced by the notion of the substitution of one entity within another.6 ii. the functions sheet and propositional identity The first manuscript, the one-page sheet on "Functions", appears to be one of the first written for the "functional theory". The first numbered principle claims that every complex containing x can be divided into function and argument, which indicates that he did not yet differentiate between "functional" and "non-functional" complexes. 6 For further discussion of the post-1905 view, see Landini, Russell's Hidden Substitutional Theory (1998), and the related manuscripts in Papers 5. Three Unpublished Manuscripts from 1903 11 Russell describes a function as something got by "taking away" one constituent of a complex, which suggests that functions are structurally simpler than their values. This contrasts with Russell's earlier views from The Principles of Mathematics, in which he criticized similar views found in Frege. There he held instead that what remains when a constituent of a proposition is removed is, in most cases, "no discoverable kind of entity" (p. 107; see also Ch. vii and p. 508), and that the entity to be varied must instead be replaced by a variable. In his mid-1903 manuscripts, however, Russell gives no indication that he thinks of functions as containing variables or any other such "placeholder" objects in their argument places. Russell's use of the Greek letter " " in the symbolic rendering of thesis 1 to represent the argument spot of the function comes from a similar device used by Frege.7 It seems likely that the sheet was written at the same time as the 24 May 1903 letter to Frege. On the back is written a single formula "~ . ⊃ . ". This pertains to the functional reworking of the Cantorian paradox of propositions Russell discusses in §500 of PoM, which Russell had broached in an earlier letter to Frege.8 By Cantor's power-class theorem, if propositions can be members of classes, there ought to be more classes of propositions than propositions. However, it seems possible, for each class of propositions, , to form a distinct proposition, viz., the proposition that all members of are true. Cantor's diagonal method leads us to a contradiction. Reworked to involve functions rather than classes, the difficulty is that for each function satisfiable by propositions, we can generate a distinct proposition, the proposition that all propositions satisfying are true: . ⊃ . . Some propositions of this form will satisfy the function they are "about"; others will not (in which case, ~ . ⊃ . ). Consider then the function satisfied by all and only propositions of this form that do not satisfy the proposition they are about:  ∃ : . ⊃ . :	. ~ as well as the proposition of this form "about" itself: : . ⊃ . 7 See Frege, Basic Laws of Arithmetic (2013), p. 6. 8 See Frege, Philosophical and Mathematical Correspondence, p. 147. 12 kevin c. klement c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 It seems likely that we will get the following contradiction: ≡ ∼ Notice, however, that the fact that for each function , we have a proposition . ⊃ . , only entails that there are as many propositions as functions if the propositions so generated are always distinct for distinct functions. Similarly, if one works out the proof of the leftto-right half of the above contradictory biconditional, it will be seen that it requires the assumption that if (i.e., . ⊃ . is identical to a proposition of the form . ⊃ . , and does not satisfy , must also not satisfy . This seems plausible on the grounds that identical propositions must have identical constituents. If is both the proposition . ⊃ . as well as the proposition . ⊃ . , then surely and must be the same function. However, at the end of his 24 May 1903 letter to Frege, Russell addresses this functional version of the paradox, and makes note of a theorem proven by Frege in the appendix on Russell's paradox added to Volume ii of Frege's Grundgesetze, according to which there is no function from functions to objects that always yields distinct objects for non-coextensive functions as argument. Considering  . ⊃ . as such a function Russell concludes that it must be possible for . ⊃ . to be the same proposition as . ⊃ . even while this single proposition satisfies the function but not the other function . This blocks the left-to-right half of the contradictory biconditional, and, apparently, solves the paradox. Principle 3 of the one-page function sheet arguably sheds light on this. Consider the proposition (complex) 8 8. There are three ways to "take away" the number 8 from this complex to arrive at a function, i.e.,  8 ,  8 and  . By principle 3, it would seem to follow that if I resupply 8 as argument to any one of these functions, I arrive back at the original proposition. Hence, it seems to entail the following identities:9 9 Whether or not the symbolic representation of 3 lower on the sheet is sufficient by itself to derive these results depends a bit on how the "replacement rule" for function variables such as would be handled in Russell's logic at the time, which is not altogether clear. Yet I think Russell intended results such as these to follow, directly or indirectly; this is confirmed by a principle in another period manuscript (Papers 4: 53). Three Unpublished Manuscripts from 1903 13 8	ε  8 8 8 8	ε  8 8 8 8	ε  8 8 and therefore, 8	ε  8 8	ε  8 , etc. The " " here represents identity of propositions, and is stronger than mere material equivalence (≡). In the vocabulary of the contemporary Lambda Calculus, Russell's principle 3 seems tantamount to the claim that -convertible formulas represent identical complexes. Notice, however, that  8 ,  8 and  are not even coextensive, much less identical functions. It is therefore possible for expressions of the forms " ε " and " ε ", or, equivalently, " | " and " | ", to represent the same proposition (or other complex) without " " and " " representing the same function, or even coextensive functions. This leaves room similarly that | . ⊃ . and | . ⊃ . could be the same proposition without and being the same, apparently vindicating Russell's suggestion regarding the propositional paradox in the letter to Frege. Unfortunately, matters are not quite so simple, as we shall discover below. iii. functional complexes and cantor's theorem The second manuscript, by far the longest presented here, derives from later in 1903, and clearly represents a more nuanced position. Russell has recognized the need to distinguish functional and nonfunctional complexes, and the manuscript is largely dedicated to exploring this distinction and its consequences for the logicist project. The manuscript is filed in the Russell Archives under the title "Proof That No Function Takes All Values", most likely because that is what is written at the top of the first sheet. The title is misleading, however, as that makes up the topic of discussion only for that page, and Russell does not in the end endorse the so-called "proof ", noting ways to resist its conclusion already six lines down. Perhaps a better name for the manuscript would be "Functional Complexes and Cantor's Disproof of a Greatest Cardinal". Russell is concerned throughout with the notion of a functional complex and, especially in the first half of the manuscript, with the ramifications of this notion for the applicability of Cantor's theorem in the resulting system. As mentioned above, the manuscript is quite rough. It is reproduced below with the 14 kevin c. klement c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 sheets in the order in which they were filed in the Archives. It is not certain whether or not this is the order of composition, or even if the various leaves were in any sense meant as a single discussion. Cantor's power-class theorem states that the number of subclasses of a given class is always greater than the number of members of that class. For reductio, suppose instead that there were as many members of as subclasses of ; it would then be possible to map subclasses of to members such that each subclass is correlated with a distinct member. However, Cantor then entreats us to consider the subclass of containing all those members of correlated with a class in which they are not included. As is a subclass of , it must be correlated with some member, of . But now is a member of just in case it is not. Contradiction. The power-class (class of all subclasses) of a given class with members has 2 members, as it results from making all possible combinations of yes-no, in-or-out, choices for the members of . So the result is typically taken to show that 2 even when is infinite, and hence that there is no greatest cardinal number. No class can be of the largest possible size: its power-class is larger. However, when these results are transferred from a class theory to Russell's functional theory, they become doubtful because of the potential inapplicability of the "diagonalization" procedure at the heart of Cantor's proof. At first glance, it would appear possible to provide a parallel argument showing that there must be more "sub-functions" of a given function (functions satisfied only by arguments also satisfying ) as there are arguments that satisfy . An alleged correlation from all sub-functions of to arguments satisfying would seem to omit the "diagonal" function satisfied by all and only arguments satisfying correlated with a sub-function of that they do not satisfy. However, an issue arises as to whether or not there is such a diagonal function, as the formula defining it may not represent a functional complex. Suppose for example, we represent the alleged correlation between functions and arguments as ; would then be defined as the function satisfying those values of such that ∃ | . ∼ | . However, the complex ∃ | . ∼ | is quite close in form to the kind of complexes Russell needed to rule out as "non-functional" in order to solve Russell's paradox. (This should come as no surprise as Russell arrived at Russell's paradox itself by means of a diagonal argument when attempting to reconcile Cantor's Three Unpublished Manuscripts from 1903 15 theorem with the existence of such "large" classes as the universal class and class of all classes; see PoM, pp. 101, 367.) Hence, the identification of certain complexes as "non-functional" threatens to undermine the functional equivalents of Cantor's main results. Recall that on the proposed treatment of mathematics, the cardinal number of 's is identified with the function satisfied by those functions with which is "similar" (Sim, i.e., the relation of standing in a 1 → 1 correlation with). Recall also that relations are here treated as functions having functions as value, so that " Sim " is more properly written " Sim| | ". Hence "Sim| " by itself represents the cardinal number of the "class" (really, function) . Russell writes the "powerclass" of as Cls' , and the issue comes down to, as it is written several times in the manuscript, whether or not Sim|Cls' Sim| . (By this time Russell differentiates propositional from "denoting" functions, writing " | " with the vertical bar for the application of a propositional or relational function to its argument, and an inverted comma ' for the application of a denoting or "other" function to its argument, as mentioned later in the same 1906 letter to Jourdain.) This relates to the issue as to whether or not there is a function having all values in the following way. If a function had all entities whatever among its values, it would thereby have all functions among its values. Since functions are always one-valued, a function having all functions as values would itself be a correlation between some entities and all functions, thereby violating the functional version of Cantor's theorem. If were such a function, diagonalization would lead us to consider the function satisfied by all those entities correlated by with some function they do not satisfy, i.e., all those such that ∼ | | . If there were such a function-call it -and it were itself a value of (as all entities are) then there would be a such that | ; however, we have that | just in case ∼ | | , but also, since | that | just in case | | . As Russell notes, the contradiction can be avoided by denying that ∼ | | is a functional complex of , and hence that there is any such function as . Russell assumes that a complex is functional just in case its negation is. On this assumption, if ∼ | | is not a functional complex of , then neither is | | . Notice, however, that since is a notational variant of | | , holding that no complex of the form | | is functional is tantamount to denying all functions of the 16 kevin c. klement c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 form  , i.e., denying the existence of reflexive relational properties. While this is perhaps welcome in the case of, e.g., self-membership, overall, Russell seems to think it too harsh a conclusion in other cases. We find him trying to make room for, e.g., "suicide" (as he puts it on fol. 14), i.e.,  kills . Yet, he fails to provide a general criterion for which complexes of the form | | are to be regarded as functional. He does explore certain suggestions for sufficient conditions under which a complex containing x is functional, such as when the expression " " contains no instances of the vertical bar "|" (fol. 2), or in which the function which it would define would always be satisfied only by entities of a "lower order" in some kind of hierarchy (fol. 18). This last suggestion is perhaps an early forerunner of his mature ramified hierarchy, though note what he has in mind here does not seem to be the kind of "type theory" that puts restrictions on meaningfulness. The lowest order of functions is those only true of individuals, not those only meaningfully assertable of individuals. In addition to such sufficient conditions, Russell provides certain principles (fol. 22) guaranteeing that a complex is functional (or non-functional) in case its parts are functional (or non-functional). For instance, the disjunction of two functional complexes is also a functional complex. Russell hoped that this would be enough to establish the existence of the functions needed for his mathematical project, even without a generic and effective criterion to settle all cases. Without Russell's having provided a definite criterion for functionality, one cannot determine in any definitive way what the fate of Cantor's results is within the system. It is worth noting, however, that Nino Cocchiarella has provided certain working reconstructions of Russell's views during this period, employing a notion of a stratified formula similar to that employed in Quine's "New Foundations" as a criterion for "functionality". As one might expect, Cantor's theorem fails in this reconstructed system for much the same reason it fails in Quine's system.10 10 See Cocchiarella, Logical Studies in Early Analytic Philosophy (1987), Chs. 1–2. The reader, however, may wish to judge for him/herself how closely Cocchiarella's reconstructions come to what Russell had in mind during this period. Notably, Russell took the notion of being a functional complex of as a property of the complex in relation to its constituent x, and thought the notion could be represented in the object language itself. This at least appears to differ in important ways from CocchiThree Unpublished Manuscripts from 1903 17 Although they receive less attention, the manuscript also contains some very interesting discussion of the Cantorian paradoxes of propositions. On folio 18, Russell notes that for every class, there is a class of propositions of the same cardinality, i.e., the class of all propositions of the form where is a member of the class. This assumes that self-identity propositions are distinct for distinct entities. As Russell notes, because he countenances a universal class (universal function), this means that there are as many propositions as entities altogether, including as many propositions as classes of propositions. He seems not to regard this conclusion as problematic, as he has rejected Cantor's result suggesting the opposite. Given what has been written, it would seem natural for him to claim that the "diagonally defined" classes of propositions do not exist, as classes are treated in this system as functions, and the complexes that would define these functions are not functional. However, later in the manuscript (fol. 21), Russell seems to suggest a different tack, one more akin to the suggestion in his May 1903 letter to Frege. Interestingly, Russell hints here at a version of the propositional paradox not solved even by the suggestion that -convertible formulas represent identical propositions. This version involves correlating each function with the proposition Russell writes as "∃ ". He is not here using "∃" as the modern existential quantifier, and it does not bind the variable . When Russell uses "∃" as the modern variable-binding quantifier, he always writes parentheses around it and the variable it binds, i.e., " ∃ ". When no such parentheses are used, "∃" is analogous to Peano's original usage of this symbol as a predicate which could be asserted of a non-empty class. In Peano's notation "∃ " means that the class is non-empty. Russell is using functions in place of classes in his logic, and "∃ " represents the proposition that is satisfied by at least one argument. Let us consider all propositions of the form ∃ which do not themselves satisfy the function which they assert to be non-empty. If the complex ∃ . ∃ . ∼ | is a functional complex of , then these propositions are those that satisfy the function  ∃ . ∃ . ∼ | . Let us call this function . Paradox threatens if we consider the proposition that arella's approach on which "stratification" is a metalinguistic property of certain formulas, and is used to stipulate which values of certain schemata are taken as axioms. Whether or not these two approaches are compatible is worthy of further study. 18 kevin c. klement c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 is non-empty, viz., ∃ , and ask whether or not: |∃ . ≡.∼ |∃ The proof of the right-to-left half of this biconditional is straightforward. For the left-to-right, assume |∃ . There is then some such that ∃ ∃ and ∼ |∃ . If we assume ∼ .⊃. ∃ ∼ ∃ it follows then that because ∃ ∃ , it holds that and hence, because ∼ |∃ , it also holds that ∼ |∃ . There are two broad lines of response to this worry that might have been attractive to Russell at this time. The more obvious response, to my mind, would be to deny that ∃ . ∃ . ~ | is a functional complex of , and hence to deny that there is any such function as . Russell, however, seems attracted here to the supposition that if a complex containing only yields a truth when is replaced by an individual (non-function)-or, equivalently, if the would-be function defined by by removing would only hold of individuals-then is functional. Because Russell holds at this time that propositions are individuals, and ∃ . ∃ . ~ | would only hold for values of x that are propositions, he is disinclined to conclude that it is non-functional. Instead, he seems attracted to a response similar to that given to the version of the propositional paradox discussed at the end of the letter to Frege. This involves adopting a coarser-grained understanding of the identity conditions of propositions. Recall that, for the earlier paradox, Russell accepted that | . ⊃ . could be the same proposition as | . ⊃ . without and being the same, or even coextensive, functions. The analogous move here would require denying the assumption that ∼ . ⊃. ∃ ∼ ∃ given above, i.e., to allow that ∃ could be the same proposition as ∃ even while and are distinct. However, even the assumption that -convertible formulas express the same proposition does not make it clear how or why this could be. Indeed, allowing this seems to require an extremely coarse-grained understanding of the identity conditions of propositions, one that seems wholly at odds with Russell's general conception of a proposition as a structured complex of parts. That Russell is willing to consider coarse-grained accounts of Three Unpublished Manuscripts from 1903 19 propositions is confirmed in the paragraph lower on the leaf, where he seems willing to accept the following principle: . ⊃. | | 11 This is stronger than it may appear. Russell uses " " as a sign for strict identity only when flanked by names of propositions or other individuals; when flanked by signs for functions, coextensionality suffices. Russell uses another relation sign "1' " (from Schröder) for strict identity, and defines " " in terms of it as follows: . :	. Indiv . ⊃. 1' :	~Indiv . ⊃.~Indiv . | ≡ | Df Hence, if and are propositional functions, the above principle means that if and are coextensive, then | and | are the same proposition. Adopting such loose identity conditions for propositions may help with the propositional paradoxes-as Russell notes, it allows that there may be fewer propositions than functions. But it seems to open Russell up to arguments of the style of the so-called "Frege– Church slingshot", for identifying all materially equivalent propositions. Consider arbitrary propositions and that happen to have the same truth-value, i.e., ≡ . The functions  . and  . would be coextensive and thus "equal" according to the above definition of " ". Assuming . ⊃. | | , this means that the proposition  . | is the same as  . | , and we then get that . and . are the same proposition. To get from this that and are the same proposition, one need only make the plausible assumption that conjunctions are identical only when they have identical conjuncts. This would mean there are only two propositions: the true one, and the false one-which seems to destroy the very notion of a Russellian proposition. Matters are complicated somewhat, however, by Russell's employment during this period of a distinction between meaning and denotation. Two expressions may differ in meaning and yet denote the same thing; perhaps two expressions may even differ in meaning and yet denote the same proposition. Perhaps " | " and " | ", where 11 Russell rejects this principle in other 1903 works: see Papers 4: 53. 20 kevin c. klement c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 " " and " " represent merely coextensive functions, differ in meaning despite standing for the same proposition. iv. meaning and denotation and functions The issue of how the meaning/denotation distinction applies to propositions is naturally tied up with how the distinction applies to propositional (and other) functions, an issue raised explicitly in our last manuscript, "Meaning and Denotation". In the opening paragraph, Russell makes it clear that the meaning/denotation distinction applies to function expressions, and that what is called "the function" is the denotation. He even seems to endorse extensional identity conditions for functions, though this unfortunately is obscured somewhat by his choice of example. By modern sensibilities, we would not simply define "human" as "rational animal"; the coextensionality of these predicates is taken to be an empirical discovery. However, it was not so long ago that "human" and "rational animal" were routinely given as examples of predicates having not only the same extension, but the same intension.12 This makes it a bit difficult to assess how radical to take Russell's claim. There are perhaps two reasons to think he does mean at this point to identify the denotation of all coextensive function expressions. First, he acknowledges a difference in meaning between "to be a rational animal" and "to be a man"; if these were taken as the same property only because being a man is simply defined as being a rational animal, i.e., if "man" were just a convenient abbreviation for "rational animal", it is unclear that there would even be a difference in meaning. Secondly, at one point in the second manuscript (fol. 24), Russell seems willing to forgo the distinction between strict identity "1' " and equality for functions " ", there giving " " the definition he had originally given to "1' ". Since Russell has all but identified materially equivalent propositions (as denotations), this too is tantamount to adopting an extensional view of functions. If he did in fact consider an extensional view of not only functions, but propositions, at this time, it was somewhat of an anomaly in his philosophical development, and one it seems did not last long. Indeed, he explicitly calls it into question in another (presumably, later) 1903 manuscript, apparently in part due to objections by Whitehead (Papers 4: 310). 12 See, e.g., Carnap, Meaning and Necessity (1956), p. 15. Three Unpublished Manuscripts from 1903 21 The rest of the manuscript deals with how to understand the relationship between functions and their arguments when the argument or value of the function is a denoting complex. Russell himself is unable to answer all the questions he poses. Similar questions are raised in other manuscripts from 1903 and subsequent years leading up to his abandonment of the meaning/denotation distinction in 1905 (see, e.g., Papers 4, Parts ii–iii). Here, Russell suggests that  is a man |Edward VII is the same "value" of the function  is a man as  is a man |the King of England. Since the "values" of this (propositional) function are presumably propositions, this suggests that they are the same proposition. This is a deviation from Russell's earlier views according to which "The King of England is human" would be taken as expressing a distinct proposition from "Edward VII is human" in virtue of having a denoting concept as constituent as opposed to Edward himself. Notice, again, however, that the phrases "  is a man |Edward VII" and "  is a man |the King of England" could differ in meaning, even if they denote the same proposition. We can see how providing an answer to difficult questions about meaning and denotation is necessitated by his view of functions in 1903. As we have seen, functions are described as what is got by removing a constituent from a complex. The value of a function for a given argument, therefore, should be the same as what is got by replacing or substituting the constituent of the original complex with the argument. In the second manuscript (fol. 13; cf. fol. 14), we find Russell writing: | Focp . ⊃.  | | | Can we form a function, however, by removing a constituent from a denoting complex which is not present in its denotation? If so, this greatly complicates the overall picture. Consider the following instance of the above:   is Catholic |the King of |England Focp England . ⊃.    is Catholic |the King of | |Italy   is Catholic |the King of |England 22 kevin c. klement c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 Assuming the antecedent holds, by various -conversions, this entails: the King of Italy is Catholic  is Catholic |the King of England However, if  is Catholic |the King of England is the same "value" of the function  is Catholic , as  is Catholic |Edward VII, then it would seem we may replace the one with the other above: the King of Italy is Catholic  is Catholic |Edward VII But presumably, substituting Italy for England in  is Catholic |Edward VII leaves it unchanged, and thus we have: (The King of Italy is Catholic) (Edward VII is Catholic) This result is worse even than identifying all propositions with the same truth-value, for here we are identifying propositions with different truth-values-a clear absurdity. Russell was not unaware of such issues; as he notes on folio 19 of the second manuscript, "  has to do with the meaning of , whereas ′ has to do with the denotation". Nonetheless, respecting this difference would require fine-tuning the logic to disallow substitution of expressions with identical denotations but distinct meanings in contexts that "have to do" with the meaning. As Russell acknowledges in another period manuscript, one should perhaps write "  "... ..." " rather than simply "  ... ... " (Papers 4: 195). Russell never provides such a fine-tuned logic, and no doubt it was in part his failed attempts to do so that began him down the road to the conclusion given in "On Denoting"'s infamous Gray's Elegy Argument that the attempt to disambiguate between a denoting complex and what it denotes inevitably leads to unsolvable problems and "inextricable tangles". What is perhaps worse is that from the standpoint of the functional theory of 1903, had Russell succeeded in developing a method for speaking of meanings or denoting complexes as opposed to their denotations, it likely would have undermined certain other commit- Three Unpublished Manuscripts from 1903 23 ments of his views at the time. Recall for example that his suggestion in the letter to Frege and elsewhere as to how to solve the Cantorian paradoxes of propositions was to identify apparently different propositions. For instance, perhaps ∃ can be the same proposition as ∃ even when , and hence perhaps there are fewer propositions than functions. However, suppose we pose the problem not in terms of generating a distinct proposition for every function, but in terms of generating a distinct denoting complex which denotes a proposition for each function. The analogous solution would require allowing that "∃ " could be the same meaning as "∃ " even when , which is far less plausible. In any case, these manuscripts clearly demonstrate the close connection between Russell's work on paradox solving and his interests in the theory of meaning and the structure and identity conditions of propositions. They provide a few missing puzzle pieces necessary to fit together a complete picture of the development of Russell's thought. Indeed, as philosophy has, as far as I know, not yet provided an unproblematic account of propositions as entities that solve such paradoxes, nor an uncontroversial understanding of functions or properties and their mode of occurrence within states of affairs, facts or propositions, these manuscripts may even be instructive for current research. works cited Carnap, Rudolf. Meaning and Necessity. Chicago: U. of Chicago P., 1956. Cocchiarella, Nino. "Wither Russell's Paradox of Predication". In Logic and Ontology. Ed. Milton K. Munitz. New York: n.y.u. P., 1973. -. Logical Studies in Early Analytic Philosophy. Columbus: Ohio State U.P., 1987. Frege, Gottlob. Philosophical and Mathematical Correspondence. Trans. H. Kaal. Chicago: U. of Chicago P., 1980. -. Basic Laws of Arithmetic. Trans. and ed. P. Ebert and M. Rossberg. Oxford: Oxford U. P., 2013. Grattan-Guinness, Ivor, ed. Dear Russell-Dear Jourdain. New York: Columbia U. P., 1977. Klement, Kevin C. "Russell's 1903–05 Anticipation of the Lambda Calculus". History and Philosophy of Logic 24 (2003): 15–37. -. "The Origins of the Propositional Functions Version of Russell's Paradox". Russell 24 (2004): 101–32. Landini, Gregory. "Russell to Frege 24 May 1903: 'I Believe I Have Discovered That Classes Are Entirely Superfluous ' " (1992). Russell 12 (1992): 160–85. -. Russell's Hidden Substitutional Theory. Oxford: Oxford U. P., 1998. Russell, Bertrand. PoM. EA. -. Papers 3, 4, 5, 12. -. Correspondance sur la philosophie, la logique et la politique avec Louis Couturat (1897–1913). Ed. A.-F. Schmid. Paris: Éditions Kimé, 2001. 24 bertrand russell c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 1. "functions" (230.0309201) unctions. 1. In every complex of which is a constituent, we can distinguish and the rest of the complex, which is the function. 2. Given a function, we may wish to indicate what this becomes when the argument is supplied to it. 3. If from a complex we take away and so obtain a function, and if we then supply x as argument to this function, we obtain again the original complex. 4. If we supply an argument to a function, and then take it away, we get the function again. Symbolically. 1. Given | , any complex containing x, we can form the function  | . 2. If is a function, we indicate by ε what becomes when is supplied to it as argument. 3. ⊢ ε  | | Df Pp or ⊢:  | . ⊃. ε | Pp 4. ⊢.  ε Pp or ⊢:  ε  | . ⊃.  | 5. ?  | Df ? (Not worth it.) 1 〈On verso, rotated 180°:	〉 ~ . ⊃ . c= Three Unpublished Manuscripts from 1903 25 c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 2. "proof that no function takes all values" (230.0308501) roof that no function takes all values. | | Focp .  ~ | | . ⊃. ~ | | | . ⊃. ~ | | | . ⊃: | Focp . ⊃. | ~ : ⊃: . | ~ i.e. if  ~ is admissable, | can't take all values. But this by no means proves that | can't take all values. We have Cls| . ⊃ . ∃ . | : ⊃. ~  ~ | | Focp It would seem, then, that  ,  ,  etc. may be admissable. We have to remember that | | may not do. Can | ever take all values? Put   . Then |  It seems  is sometimes admissable, sometimes not. Put   . Then |   | | Thus all turns on whether is admissable. The rule is:  is admissable if   and  is admissable. Consider | . Suppose  and Focp . Then | , |  We want a Pp:   . Focp . ⊃. | | Focp Pp 1 〈On verso, and foliated 7:〉 11.6 ⊢ :	.	Cls| . ⊃ . ∃ . : ⊃	. ~ | Focp m folio 〈1〉 folio 〈2〉 26 bertrand russell c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 We ought to begin with: If no term of the form | ′ comes in ,  is all right: thus: | const . ⊃ , : ~const .∨. ~const :	. ⊃. Focp Pp This leaves out | , | , Ɑ | , ~ | , | | , and so on. It shows that all complexes in which | does not occur are functional. But we need Pp's admitting some cases where | ′ does occur. First case where | ′ occurs: in proof of Nc| . ⊃. 2 , we have | ∩ | | ε  ∃ ∩  ∩ | ∩ | . This is a complex of the form | ′; it is itself harmless, but must not be used to obtain a function of or of . : : : : : : : : : Proof of Sim|Cls' Sim| 1	1 → 1| . ⊂ Cls' . ∩  ~ | | . ⊃. | . If we never allow | ′ , the proof fails always: we shan't have even 2 . Thus | ′ must be sometimes admissable. Try Cantor's form of the proof [Lectures ∗39.62]: ε ∩ Cls'2	Excl	. , ′	ε . ∩ ′ Λ	: | . ⊃ . ′ ∩  ∩ | ∨ ′ ∩ | :3 ⊃  ∃ ∩  : ⊃ : ⊂ . Sim : ⊃	. Sim Sim 1 This involves   ′ | . ′ ∩ ∪ ′ ∩ . This relation is unobjectionable: but ∃ ∩ Cls'2	Excl remains to be proved. 2 〈These references are presumably to Russell's 1901–02 Cambridge lectures; for discussion, see Papers 3: 382.〉 3 〈Russell's manuscript displays the line thus:〉 folio 〈3〉 Three Unpublished Manuscripts from 1903 27 c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 ε ∩ Cls'2	Excl	. ε	1 → 1	. . ⊂ : | . ⊃	. . ∩ | . ∩ | ∶  ∃ ∩  : ⊃ : | ∶ | . ⊃ . | . ~ | | : ⊃	. ~ | . ⊃	. ~ | 2 This step again is unobjectionable. Thus this proof is preferable to the other; but ∃ ∩ Cls'2	Excl remains to be proved. If a consists of simple functions, and no two are each other's negatives,  ∃ ∩  .∨. will do. More often,  ∃ ∩  .∨. will do; for ~ . ⊃. ~ . But if is ever true for a term of , this will fail; or (what will be more frequent) if and are ever both terms of . We require two mutually exclusive classes of terms each: 1 → 1| . | . ∩ Λ	. ⊃.  ∃ ∩  ∪ | ε ∩ Cls'2	Excl . The ∩ Cls'2	Excl required can be got from Cls' . a q	→ . . . . . . . . . dots in . . . . . . . . . each row. There are here pairs of dots. q′→ (1). To prove Sim| Sim| . Take any two mutually exclusive terms , ′ of : let be the top row, ′ the bottom row. For any term of which belongs to the bottom row, add all those in the top row: the result is a term of : thus   ′| . ∪ ∩ | . ⊃. ′	. ⊂ [we start from 1 → 1| . ∩ Λ	. | ] taking any term , take the -term for this couple, and the ′-terms for all the rest, so that we put   | : ∩ ∪ ′ ∩ . ⊃. . ⊂ This function seems unobjectionable. But let us examine the proof of 1 → 1| . folio 〈4〉 28 bertrand russell c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 . . ⊃. ∩ ∪ ∩ . ∩ ∪ ∩ . ⊃. 1 . . ⊃. ∩ ∪ ∩ ∩ ∪ ∩ ′	. ⊃. ∩ ∪ ∩ ∩ ∪ ∩ ′	. ⊃. ∩ ∩ . ∩ ∩ ′	. ⊃. ′ 2 Thus there is no doubt of 1 → 1| . Proof of Sim|Cls' 2 | | . ⊃ . Cls' ∩  | . ′ Cls' ∩ :  ∃ ∩  ∪ ′ : ⊃. Sim| ∩ Cls'2	Excl | 1 | . ⊃.  | : ⊃. Cls'  ∃ ∩  . ⊃. Sim|Cls' Sim| To make this proof right, put   | . Cls' ∩  | . ′   | . Cls' ∩  | .  ∃ ∩  | ∪ | .   | . | ∪ | . ⊃ :	1 → 1| ′′	. ′′ : ′′| . ≡. ∃ ∩  | ∪ ′| . ⊃. 2| ∶ . . ⊃. Cls' ∩  | ⊃. Sim| ∩ Cls'2	Excl | ′′ (1)   | .  | . ⊃. Cls' . (2) ⊢. 1 . 2 . ⊃	⊢ Prop Thus Sim|Cls' 2 | seems always true, and also 2 | Sim| . It would follow that Sim|Cls' Sim| . Necessary to investigate how Cantor's proof differs from mine. Now to prove 1 → 1| . . ⊂ .⊃. ∃ ∩ If 1 → 1| . . ⊂ , if | , one term of belongs to | and one doesn't. Put   | . ∩ | . ′   | . ∩ | . folio 〈5〉 folio 〈6〉 Three Unpublished Manuscripts from 1903 29 c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08  ∃ ∩  ′ | . ⊃ : | ∶ | . ⊃ . ′ . ~ ′ : ⊃ : | ′ | i.e. we establish a correlation of 's and 's; if is an , we call the term of which does not belong to | ; the class of all 's is not a . When we prove Sim|Cls' Sim| , we have instead the notion of itself not belonging to its correlate, and this gives an impermissible function. But in the above case, the function is all right. But Nc| . ⊃. ∃ ∩ Cls'2	Excl is derived from Cls' . Let | : put . . | . Cls' ∩  | ; i.e. consists of all classes of to which belongs. Put . . | . Cls' ∩  | , i.e. consists of all classes of to which does not belong. Then varies as varies, both for and ′ ; i.e. 1 → 1| . 1 → 1| ′ . Thus | ∪ ′| always contains two terms; and 0' . ⊃. | ~ | . ′| ~ ′| . But do we necessarily have 0' . ⊃. | ~ ′| ? i.e. is it possible to have 0' . Cls' ∩  | Cls' ∩  | If so, Cls' | . | . ≡ . Cls' | . ~ | Consider | . ≡ . ~ | . This is to hold only if ⊂ ; and it is only relevant when | . | . We want to know if two members and of can be found such that every proposition implying which is satisfied by is not satisfied by , and vice versa. This 〈is〉 impossible, because Cls' | . | . | excludes it. Hence the members of ′′ are mutually exclusive, where ′′ . ≡. | . | ∪ ′| . folio 〈7〉 . . . . . . . . . . . . . . 30 bertrand russell c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 Then ′′	ε	Sim| ∩ Cls'2	Excl. Perhaps proof of Sim|Cls' 2 | may go wrong. This depends on proving   | .  | | . ⊃. Cls' . where  ∃ ∩  | ∪ ′| Here | . ≡. ∃  | .  | | ≡. ∃  | .  | Cls' ∩  | is formed by taking, in all possible ways, for every , either those Cls' 's which contain it, or those which don't; i.e. | . ≡ : | . ≡. ∃ ∩  Cls' ∩  | .∨. Cls' ∩  | Hence | . ≡. ∃  | . ≡. ∃ ∩  Cls' ∩  | .∨. Cls' ∩  | :  |Cls' ∩  | Here | . ≡. Cls' ∩  | . ≡. ∃ ∩  Cls' ∩  | Cls' ∩  | .∨. etc. ≡. | Put One term of is | ∪ ′| ; if | , either one ter | or ′| belongs to , but not both. I.e.  | . ⊃ : | | .∨. | | :	~ | . | ′| i.e.  | . ⊃ : | | . ≡. ~ | ′| Hence | . ≡. ∃  | . ⊃ : | | . ≡. ~ | | :	.  | | Take a square a: Cls' ∩  | Areas containing x. Cls' ∩  | ... not ...... Put . ≡. | . Cls' ∩  | so that | Cls' ∩  | ′ . ≡. | . Cls' ∩  | folio 〈8〉 folio 〈9〉 x . Three Unpublished Manuscripts from 1903 31 c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 whence ′| Cls' ∩  | . Thus for every value of , | ∪ ′| is a class of two terms; and its relation to is 1 → 1. This relation is ′′   | . | ∪ ′| ) Thus ′′ contains Sim| terms, each a couple, and each couple excluding the others. Hence ′′	ε	Sim| ∩ Cls'2	Excl. What this proves is ⊢ :	Nc| . ⊃. ∃ ∩ Cls'2	Excl We now have to prove Sim|Cls' 2 | . We have 2 | | ′′ Hence we have to prove Cls' |Sim| ′′ . Take any term of ′′ ; if | is a term of this, let | hold; if not, not. I.e. ′′ | . | . ⊃ : | | . ⊃. | :	~ | | . ⊃. ~ | ; in this way, every Cls' will be included sooner or later. Thus no objectionable function occurs here. Hence always ⊢ Sim|Cls' 2 | Thus it is 2 that goes wrong. To prove 2 . q	→ Take two rows of dots. . . . . . . . . . . . . . . . . . q′→ ∩ | Call the class of couples . Call the top row , the bottom row ′. Take any 1 → 1 ∩  . ⊂ . If | , it will happen either that ∩ | ⊂ , or that ∩ | ⊂ ′. Whichever happens, choose the other: i.e. | . ≡ :	∪' | : ∩ | ⊂ . ⊃. ∩ ⊂ ′	: ∩ | ⊂ ′	. ⊃. | . | . ∩ | ⊂ . ⊃. | : | . | . ∩ | ⊂ .⊃. | : ≡: .	∪' | :	. | . | . ⊃ : ∩ | ⊂ . ≡. ~ | folio 〈 10〉 32 bertrand russell c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 We have to prove ~ | . This follows from ~ | . Now . ⊃ : | . ≡ . | . ⊃ : ∩ ⊂ . ⊃	≡. ∩ ⊂ If were the correlate of , its term in would be ∩ | ; but it isn't. | . ⊃. ∩ | ∩ Define: | ∩ ⊂ . ⊃.~ | . ⊃. ~ | ∩ | What we want is ∩ | i.e.  ∃ ∩  ∩ | To prove 2 . Take two rows of dots. Call the class of couples . Take a 1 → 1 ∩  . ⊂ . Then choose so that it picks out from each couple of the term not belonging to the correlate of the couple, i.e.  ∃ ∩  ∩ | . Then | . | . ⊃ : | . ≡ . | | . But | . ≡. ∃ ∩  ∩ | : ⊃ : | . | . ⊃. ~ | | ⊃ : | . ⊃ . | ≡ ~ | | : ⊃. ~∃  | . Thus unless ∩ | is objectionable, there is no harm in this. ∩ |  | . ~ | | and |  . Thus ∩ |  | . ~  | We get an objectionable complex if we start from , thence define as ∩  | , and thence put ∪' ∩  ~ε | ∩  | . Frege's Proposition.  ∃  | . ~ | Df | ≡. ∃  | . ~ | ~ | . ≡ : | . ⊃ . | | | ≡. ∃  | | . ~ | ~ | . ≡ : | | . ⊃ . | : ⊃. | . Hence ⊢ | , ⊢ ∃  | | . ~ . folio 〈 11〉 Three Unpublished Manuscripts from 1903 33 c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 Hence no function is such that | | . ⊃. . Now 1 → 1| . ⊃ : . | . ⊃ : | | . ⊃. . Hence 1 → 1| . ⊃. ∃ . ∃ . If now we apply this to 1' , putting 1' , we have 1' | . ≡. ∃  1'| . ~ | , 1' 1' 1'|1' . ≡. ∃  1'|1' 1'| . ~ | 1'|1' . Hence 1'| 1'| . ~ ⊃. . We had . Here . . . If is included among functions, . ⊃ . . It may be that 1'| Λ sometimes. We had 1' , i.e. 1'| | , i.e. . If Frege's Proposition is to be false, we must deny functions of the form  . ′| i.e. of the form where const . const ′	. const . | const . In these cases,  and  are to be inadmissable. Put | const . ⊃ , : ~const .∨. ~const :	. | const . const . const . ⊃ , , . ~const :	. | const . const . const . ⊃ , , . ~const :	. ⊃. Focp Pp This destroys Frege's theorem; also 2 remains also, but ∃ ∩ Cls'2	Excl remains, and Sim|Cls' 2 | . It is obvious that  ~ | won't do if takes all simple values; for then all f classes are denied. Again  ∃ . . ~ | won't do if can take all values which are classes. Thus  ∃ . | . ~ | will deny | for some value of , unless | | . Hence if | ~ | ′ ,  ∃ . | . ~ | must not be admitted. This would be  ∃ . | . ~ | | ; and the latter is already excluded. But such complexes must be sometimes admissable. But when? Consider . : ~ : Nc| . Nc| : | . | . 1 → 1| . . ⊂ . ⊃ . ∃ It is obvious that the will generally (always, unless 0) have to be defined in terms of . For 2 , we must find some other proof: I think Cantor has one. Until 2 we never require  | ′ or  ∃ . ′	. ~ | . I do not think these forms occur again anywhere, except in considering the greatest ordinal, and in the Df of . [Lectures, 122*5] folio 〈 12〉 34 bertrand russell c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 We want first of all to admit all functions not of the forms  |  . ⊃ . |  . ⊃ . |  . ⊃ . or containing constituents of the forms of the above complexes. With the admission of the functions thus allowed, we can do everything except 2 , no greatest ordinal, and . Functions of the form  are obviously sometimes legitimate. But if we allow ε, they are not always legitimate; and Ɑ | , which becomes Ɑ| | , is not legitimate. Hence  won't always do. Ɑ | . ≡. ∃ . | | ; ε . ≡. | . Thus Ɑ | involves | . We put Ɑ   ∃ . | | Ɑ|  ∃ . | | Ɑ| | ∃ . | | Ɑ| | ∃ . | | It would seem | ′ is legitimate when it is of the form | ′′ | ′; but how 〈to〉 exclude Ɑ| | ? i.e.   ∃ . | | | | ? We must make it a rule if  | occurs in a complex, is to be substituted for it. When this is done,  | | ′ may be admitted. We have ~const . ⊃. | | . | Focp . ⊃.  | | | ? | Hence the proof of  |  | fails. Suppose we put always  | Pp and suppose for we put | . Then ~const . ⊃.  | | | . ⊃.  | . ⊃.  |  | . But const . ⊃.  | | | whence not  |  | . Take e.g.  | . We have  | | |  | |  | | folio 〈 13〉 folio 〈 14〉var would be better. ↑ const . . ~ . Df | | Pp Three Unpublished Manuscripts from 1903 35 c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 Thus  |  | is still true: for  | | |  | | With regard to  | | ′ , we may assume ⊢: . ~ ∃ .  | const : . | | ′: ~const . const : ⊃. Focp Pp This will admit and suicide  kills . But it leave〈s〉 2 doubtful. It does not admit | | , though it does admit | | . But if | can be brought into the form | , then it becomes admissable. Thus in correlating and Cls' , take a 1 → Nc ∩  . ⊂ . Assume further Then ~ . ⊃. | ~ | . Hence correlation of and | is 1 → 1. Thus   | . | gives the required correlation. Now consider  ~ . This ~ε . For | | . ≡ . | : ⊃. | ~ . Here there seem to be no illegitimate functions. We have . . ⊃. . . ⊃. . . ⊃. ∃ . ∃ . . . ⊃. | | ′	. ∃ | ⊃ : . ≡ . ′ :	∃ | : ⊃ : . ≡ . . ′ :	∃ | : ⊃ : . ⊃ . :	∃ : ⊃ : ∃ . ⊃. : ∃ | : ⊃. ′ We have to prove ∃1 → Nc ∩  . ⊂ 1' ∩ ↑ will do what we want. In this case, Λ is omitted. If Cls, | when Cls| . Hence | . This gives a 1 → 1 of all classes to all classes; but we want one of all classes to all classes of classes. We have Cls  . Indiv| | Cls′ Fo ∩  ⊂ Indiv Cls Cls ∩  ⊂ Cls 4 The contention is: a 1 → Nc relating classes to classes will never have 4 〈In the definition of Cls2, Russell struck out primes after the two occurrences of "Cls".〉 folio 〈 15〉 36 bertrand russell c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 all Cls 's in its of the form | . What makes this case odd is that | is itself a Cls, i.e. . | | Correlating all entities with classes, the contention is 1 → Nc| : . | : ⊃. ∃Cls ∩  ~ ∃ . | 〈I〉n other words, | will never take all values that are classes. If Ɑ were admitted, Ɑ| would be such a function, roughly; here the omitted function is  ~ Ɑ| | . But Ɑ is only 1 → Nc for relations. N.B. If we admit the relation Ɑ, Ɑ must not have its present meaning. We have Ɑ|  ∃ . | | i.e. Ɑ   ∃ . | | . Thus Ɑ   ∃ . | | . Ɑ|  ∃ . | | i.e. Ɑ| is the class of relations holding between and any other terms. Put . . . This is 1 → Nc. Then |  . If is a 1, this ; if not, it ∪ . It would seem  is not in general admissable, though it may be so if R is constant and does not contain . The proof of | ~ may fail in odd cases, e.g. when .  Put   . Then If now  is admissable, so is  . In proving Sim|Cls' Sim| , we put 1 → Nc| . ⊂ .   | . | .  ~ . ⊃.~ | . In order that this proof may be sound, we require that, if   ,  should be admissable. If this condition fails, we may not have | ~ , and hence the proof fails. Thus what is demonstrated is 1 → Nc| . ⊂ .   | . | .  ~ : ∃ .   . Focp : ⊃.~ | . Thus Sim|Cls' Sim| only follows in cases where folio 〈 6〉 Three Unpublished Manuscripts from 1903 37 c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 . ⊂ . 1 → Nc| . ⊃. ∃ .   . Focp We have now to consider | | where 1 → Nc|1 Nc → 1| . Suppose   . Then   , |  , | |  | . Suppose   ; then | | . This must be the test: whether  will do. Consider | . Is this ever functional 〈with〉 respect to ? | | . ≡. ∃ . | . | . If is not a function,  | |  |Λ . which is functional. . If is a function, put  . Then if is functional, | | . Hence | | | There seems no way of proving that this is ever functional. Consider e.g. | . This is probably not functional. Consider | | ′| Put |  , ′  ′ Then | | ′| | | ′ . If   , | | ′ ′ . This may or may not be functional. To prove by Cantor's method that Sim|Cls' Sim| , we need to prove | . ⊃	≡ . ∃ . | . : ⊃. Focp i.e. if, when is satisfied by some when and only when | , and is then satisfied by a which is a , then is functional. When these conditions are satisfied, is only satisifed when | . Hence if all complexes contained in | are functional, the above condition is fulfilled. Now all non-functional complexes have in the functional place, and none of them are null. Hence all are satisfied by functional values of . Hence if ⊂ Indiv, the proposition holds; otherwise, it may not. folio 〈 17〉 }Wrong 38 bertrand russell c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 The condition ⊂ Indiv is too narrow for our purposes, since existence-theorems in Arithmetic are proved by classes of numbers. If we assume that | , | , | | , and so on, are the only objectionable complexes, then any argument satisfying them must be of no definite order. For a function of a definite order is only satisfied by an argument of lower order. Thus | | requires that should be a relation which can have itself as one of its terms. This will still not enable us to be content with numbers, for Sim| is of no definite order. But given any class ,  ∃ ∩  ∃ ∩  is a function only satisfied by propositions, i.e. by individuals, having the same number of terms as provided   | . is admissable, and provided | . | ′. 0' ′. ⊃ , . ~ ′ ′ . But this last can hardly be always true. If it is, as seems to be the case, the number of propositions is as great as the number of objects altogether. Now that Cantor's proposition is disproved, there is no harm in this. The above argument, that if ⊂ Indiv Cantor holds, is fallacious. may occur in a functional place, and yet the complex hold when Indiv| . E.g. ~ | holds always when Indiv| . We want the proposition to fail for Indiv itself. Thus Indiv ∩  ~ | is not functional, being in fact Λ. But it is enough if the complex can be made functional, and Indiv| . ~ | . ≡. Indiv| which is functional. Perhaps a non-functional complex, if it holds for individuals at all, holds for all of them. If ~Focp , . ′	~Focp ; unless . ′. ≡. ′′ and ′′	Focp . It would be convenient to take as our Pp ⊢: . . Indiv| : . Indiv| . . ≡ :⊃: ′ Pp Then we do not have two different Pp's about | . We have ⊢: . Fo| . Fo| . ⊃ : . | | . ⊃. Pp Thence ⊢: .  |  ′ | . ⊃.   ′ Thence ⊢: . Focp . ′	Focp . ⊃ : . ′	. ⊃.   ′ and ⊢: . . Indiv| : . Indiv| ′	: . ≡ ′	: Focp . ′	Focp : ⊃.   ′ . folio 〈 18〉 folio 〈 19〉 Three Unpublished Manuscripts from 1903 39 c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 Apparently we don't have generally ′	. ⊃.   ′ . The reason is that  has to do with the meaning of , whereas ′ has to do with the denotation. But this is inconvenient, and should be remedied by a Pp, if possible. We may put ⊢: . Focp . ′	~Focp : . ′	: ⊃.  ′  Pp ⊢: . Focp . ⊃ ⊢:: :	.	~ : | :	. ⊃.  Λ Pp Thus always . ′	. ⊃.   ′ which should be Pp We might take . as indefinable, meaning (1) if ∃ . : . . ⊃. , the satisfying (2) if not, ~ ∃ , . . But  . won't do. Consider ∃ . | . ~ | This is non-functional, and may hold only for individuals. Put Focp . . ∃ . ~var : . | Df Then ⊢: . . ′	. ⊃ : Focp . ≡. ′	Focp Also ~var . | . ⊃. | We might put ⊢ : ~var . Fo| . | . ⊃.  Pp This Pp seems more powerful than the others. It gives ⊢ : ~var . Fo| . ⊃.  | provided can be proved. Put also ⊢: . Fo| . ⊃ . ~ . | : ⊃.   . | Pp Then put Focp . . ∃ . Fo| . ~var . | Df and bring in the old assumptions as to what complexes are functional. To prove a complex non-functional, we shall have to prove that it is not equivalent to | for any . This can sometimes be done. It is when this occurs that Cantor fails. We wish to prove (1) that it occurs for some Cls'Indiv. (2) that it does not occur for certain simple classes. folio 〈20〉 40 bertrand russell c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 Consider ∃ . ~ | Put  ∃ . ~ | Df Then | ∃ . ~ | Consider ∃ . ∃ . ~ | Put  ∃ . ∃ . ~ | | ∃ . ∃ . ~ | | | ∃ . | ∃ . ~ | | Now | ∃  ∃ . ~ | Hence, if ~ . ⊃. ∃ ~ ∃ , we have | | ≡ ~  ∃ . ~ | | | ≡ ~ ∃ | . ~ | | ≡ 0'	∃ | .∨. | | As for identity of apparently different propositions, observe . ⊃. | | . Thus . . ~ ~ and so on. If ≡ ′, and Focp , ′ . Thus apparently different propositions may be functional, and there may be fewer propositions than functions. Hence we might assume . Indiv| . ⊃. Focp Pp ⊢ : ⊃ Indiv| . ⊃. Focp Pp 0. ⊢ : Focp . ≡. ~ Focp 1. To prove ⊢ : Focp . ′	Focp . ⊃. ∨ ′	Focp | . ′ ′| . ⊃. ∨ ′ ∨ ′ | 2. ⊢ : Focp . ∨ ~Focp . ⊃. ′	~Focp 3. ⊢ : Focp . ′	Focp . ⊃. . ~ ′ Focp | . ′ ′| . ⊃. . ~ ′ ∩ ′ | 4. ⊢ : Focp . ∨ ′	Focp . ⊃. ′	Focp [3] 5. ⊢ : ~Focp . ∨ ′	Focp . ⊃. ′	~Focp [4] 6. ⊢ : Focp . ′	Focp	〈 〉	. ⊃. . ′	Focp 7. ⊢ : ~Focp . . ′	Focp . ⊃. ′	~Focp and so on. We ought to be able to prove ~ ∃ . | . ⊃. is satisfied by arguments outside such and such a class. folio 〈21〉 folio 〈22〉 Three Unpublished Manuscripts from 1903 41 c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 The best suggestion is, that a non-functional complex is always satisfied by arguments of infinite order, i.e. by arguments which are themselves satisfied by arguments of all finite orders. Thus Sim| is satisfied only by 's of definite finite orders, and is therefore not of infinite order; but Sim is of infinite order. We have ⊢: . : ∃ . : ⊃. | ~Focp More specially ⊢: . Cls| . ⊃ . ∃ . : ⊃. | ~Focp Similarly ⊢: . Rel| . ⊃ . ∃ . : ⊃. | | ~Focp ⊢: . Triple . ⊃ . ∃ . : ⊃. | | ~Focp We have Order  |Cls	: | . ⊃ . ∩ Cls' : ⊃ . | Df There are functions not of any order, e.g. Sim| , but having values which are always of some definite order [Sim| is not such]. (Won't work.) | and  . A. Define | first. (1). If is a function, | is to mean its value for the argument . (2). If is an individual, | is to mean . . B.  . (1). If is a constituent of , and there is a function of of which, for every , is the value for the argument , then  means . But this won't do, unless prefaced by the uniqueness of the said . Better to say: if can be divided into a constant part (the function) and the variable , then  is the constant part. (2). If is not a constituent of ,  is to be a function whose values are all , provided there is such a function. (2). If there is no function whose value, for every , is , then  is to mean  . | . folio 〈 〉 folio 〈24〉 42 bertrand russell c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 Figure 1. Some changes of mind about functions (folio 〈24〉 . After A and before B, put . . . | | Df Three Unpublished Manuscripts from 1903 43 c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 and explain the meaning of ? Put also ⊢ : . | | . ⊃. Pp. Now ∃ . . | . ⊃ ⊢ : | . | . ⊃. . Hence we may put . | . If | is never true, or is true more than once, then . | is to mean . or Λ? Now put ∃ . | . ⊃.  . | Df But this won't do. | ′. ⊢ :	If ~Focp . ⊃.  | ~Focp ⊢ :  . Focp . ⊃. | Put ′ | . Then | ′ | Now must contain and . If | occurs, then if Indiv| we can substitute . . But if | occurs, we get | | . If now Rel| , | | is admissable if is derived from a complex, and if not, | | . . Thus | | under the circumstances is always admissable. It is simpler to put ⊢: . Indiv| . ⊃. Focp Pp But this Pp is probably capable of proof or disproof. folio 〈25〉 44 bertrand russell c:\users\ken\documents\type3601\red\rj 3601 077 red.docx 2016-04-01 10:08 3. "meaning and denotation" (230.030950) eaning and denotation. A function is something denoted, not meant, by the form of words in which it is spoken of. Broadly, every single word which is not a proper name denotes a function; but there are some exceptions-e.g. the and the copulative is. "To be a rational animal" and "to be a man" differ in meaning, but the function involved is the same. Thus there must be an object which both denote- a property which may be expressed by either phrase. But when a proper name is part of the complex which is the value of the function, it often happens that the proper name is part of the meaning, not of the denotation; yet change of the name changes the value of the function, and the name is the variable of the function. Take e.g. "the centre of gravity of the universe". The meaning is complex, but the denotation is utterly simple. Substituting for universe, the denotation is always simple, but the meaning is complex, and contains as constituent. Thus the variable of a function need only be part of the meaning, not of the denotation. "The centre of gravity of ", if x is a function satisfied by material points and by nothing else, denotes a point of space; if is anything else, it denotes Λ. Consider: enters into the meaning, not necessarily the denotation, of | ; the question is: does the meaning or the denotation of form a constituent of | ? E.g. "Edward vii is a man" is a value of  is a man); is "The present King of England is a man" the same value, or a different one? We should have to say, I think, that it is the same value. Thus denoted enters in to | . In the above case, the denotation as well as meaning of | was complex. Take a case where this is not so, e.g., "The Centre of Gravity of the Crystal Palace" and the "the Centre of Gravity of the glass building which, after the great Exhibition, was moved from Hyde Park to Sydenham". Are there two values, or one, of (the centre of gravity of )? I think we must say they are one. Thus always it is denoted which is relevant in | , although it is in the meaning of | , not necessarily the denotation, that is a constituent. When has meaning and denotation, can the denotation, as opposed to the meaning, be part of the meaning, as opposed to the denotation, of a complex? This is a difficult question. j= folio