 Logicism

Logicism is one of the schools of thought in the philosophy of mathematics, putting forth the theory that mathematics is an extension of logic and therefore some or all mathematics is reducible to logic.^{[1]} Bertrand Russell and Alfred North Whitehead championed this theory fathered by Richard Dedekind and Gottlob Frege. Dedekind's path to logicism had a turning point when he was able to reduce the theory of real numbers to the rational number system by means of set theory. This and related ideas convinced him that arithmetic, algebra and analysis were reducible to the natural numbers plus a "logic" of sets; furthermore by 1872 he had concluded that the naturals themselves were reducible to sets and mappings. It is likely that other logicists, most importantly Frege, were also guided by the new theories of the real numbers published in the year 1872. This started a period of expansion of logicism, with Dedekind and Frege as its main exponents, which however was brought to a deep crisis with the discovery of the classical paradoxes of set theory (Cantor 1896, Zermelo and Russell 19001901). Frege gave up on the project after Russell recognized and communicated his paradox exposing an inconsistency in naive set theory. On the other hand, Russell wrote The Principles of Mathematics in 1903 using the paradox and developments of Giuseppe Peano's school of geometry. Since he treated the subject of primitive notions in geometry and set theory, this text is a watershed in the development of logicism. Evidence of the assertion of logicism was collected by Russell and Whitehead in their Principia Mathematica.^{[2]}
Today, the bulk of modern mathematics is believed to be reducible to a logical foundation using the axioms of ZermeloFraenkel set theory (or one of its extensions, such as ZFC), which has no known inconsistencies (although it remains possible that inconsistencies in it may still be discovered). Thus to some extent Dedekind's project was proved viable, but in the process the theory of sets and mappings came to be regarded as transcending pure logic.
Kurt Gödel's incompleteness theorem is sometimes alleged to undermine logicism because it shows that no particular axiomatization of mathematics can decide all statements. However, the basic spirit of logicism remains valid, as that theorem is proved with logic just like other theorems.
Logicism was key in the development of Analytic philosophy in the twentieth century.
Contents
Origin of the name "logicism"
GrattanGuiness states that the French word 'Logistique' was "introduced by Couturat and others at the 1904 International of Congress of Philosophy', and was used by Russell and others from then on, in versions appropriate for various languages" (GG 2000:4502).
Apparently the first (and only) usage by Russell appeared in his 1919: "Russell referred several time [sic] to Frege, introducing him as one 'who first succeeded in "logicising" mathematics' (p. 7). Apart from the misrepresentation (which Russell partly rectified by explaining his own view of the role of arithmetic in mathematics), the passage is notable for the word which he put in quotation marks, but their presence suggests nervousness, and he never used the word again, so that 'logicism' did not emerge until the later 1920s" (GG 2002:434).^{[3]}
About same time as Carnap (1929), but apparently independently, Fraenkel (1928) used the word: "Without comment he used the name 'logicism' to characterise the Whitehead/Russell position (in the title of the section on p. 244, explanation on p. 263)" (GG 2002:269). Carnap used a slightly different word 'Logistik'; Behmann complained about its use in Carnap's manuscript so Carnap proposed the word "Logizisumus', but he finally stuck to his wordchoice 'Logistik' (GG 2002:501). Ultimately "the spread was mainly due to Carnap, from 1930 onwards." (GG 2000:502).
Intent, or goal, of Logicism
Symbolic logic: The overt intent of Logicism is to reduce all of philosophy to symbolic logic (Russell), and/or to reduce all of mathematics to symbolic logic (Frege, Dedekind, Peano, Russell). As contrasted with Algebraic logic (Boolean logic) that employs arithmetic concepts, symbolic logic begins with a very reduced set of marks (nonarithmetic symbols), a (very)few "logical" axioms that embody the three "laws of thought", and a couple construction rules that dictate how the marks are to be assembled and manipulated—substitution and modus ponens (inference of the true from the true). Logicism also adopts from Frege's groundwork the reduction of natural language statements from "subjectpredicate" into either propositional "atoms" or the "argumentfunction" of "generalization"  the notions "all", "some", "class" (collection, aggregate) and "relation".
As perhaps its core tenet, logicism forbids any "intuition" of number to sneak in either as an axiom or by accident. The goal is to derive all of mathematics, starting with the counting numbers and then the irrational numbers, from the "laws of thought" alone, without any tacit (hidden) assumptions of "before" and "after" or "less" and "more" or to the point: "successor" and "predecessor". Gödel 1944 summarized Russell's logicistic "constructions", when compared to "constructions" in the foundational systems of Intuitionism and Formalism ("the Hilbert School") as follows: "Both of these schools base their constructions on a mathematical intuition whose avoidance is exactly one of the principal aims of Russell's constructivism" (Gödel 1944 in Collected Works 1990:119).
History: Gödel 1944 summarized the historical background from Leibniz's in Characteristica universalis, through Frege and Peano to Russell: "Frege was chiefly interested in the analysis of thought and used his calculus in the first place for deriving arithmetic from pure logic", whereas Peano "was more interested in its applications within mathematics". But "It was only [Russell's] Principia Mathematica that full use was made of the new method for actually deriving large parts of mathematics from a very few logical concepts and axioms. In addition, the young science was enriched by a new instrument, the abstract theory of relations" (p. 120121).
Kleene 1952 states it this way: "Leibniz (1666) first conceived of logic as a science containing the ideas and principles underlying all other sciences. Dedekind (1888) and Frege (1884, 1893, 1903) were engaged in defining mathematical notions in terms of logical ones, and Peano (1889, 18941908) in expressing mathematical theorems in a logical symbolism" (p. 43); in the previous paragraph he includes Russell and Whitehead as exemplars of the "logicistic school", the other two "foundational" schools being the intuitionistic and the "formalistic or axiomatic school" (p. 43).
Dedekind 1887 describes his intent in the 1887 Preface to the First Edition of his The Nature and Meaning of Numbers. He believed that in the "foundations of the simplest science; viz., that part of logic which deals with the theory of numbers" had not been properly argued  "nothing capable of proof ought to be accepted without proof":
 In speaking of arithmetic (algebra, analysis) as a part of logic I mean to imply that I consider the numberconcept entirely independent of the notions of intuitions of space and time, that I consider it an immediate result from the laws of thought . . . numbers are free creations of the human mind . . . [and] only through the purely logical process of building up the science of numbers . . . are we prepared accurately to investigate our notions of space and time by bringing them into relation with this numberdomain created in our mind" (Dedekind 1887 Dover republication 1963 :31).
Peano 1889 states his intent in his Preface to his 1889 Principles of Arithmetic:
 Questions that pertain to the foundations of mathematics, although treated by many in recent times, still lack a satisfactory solution. The difficulty has its main source in the ambiguity of language. ¶ That is why it is of the utmost importance to examine attentively the very words we use. My goal has been to undertake this examination" (Peano 1889 in van Heijenoort 1967:85).
Frege 1879 describes his intent in the Preface to his 1879 Begriffsschrift: He started with a consideration of arithmetic: did it derive from "logic" or from "facts of experience"?
 "I first had to ascertain how far one could proceed in arithmetic by means of inferences alone, with the sole support of those laws of thought that transcend all particulars. My initial step was to attempt to reduce the concept of ordering in a sequence to that of logical consequence, so as to proceed from there to the concept of number. To prevent anything intuitive from penetrating here unnoticed I had to bend every effort to keep the chain of inferences free of gaps . . . I found the inadequacy of language to be an obstacle; no matter how unwieldy the expressions I was ready to accept, I was less and less able, as the relations became more and more complex, to attain the precision that my purpose required. This deficiency led me to the idea of the present ideography. Its first purpose, therefore, is to provide us with the most reliable test of the validity of a chain of inferences and to point out every presupposition that tries to sneak in unnoticed" (Frege 1879 in van Heijenoort 1967:5).
Russell 1903 describes his intent in the Preface to his 1903 Principles of Mathematics:
 "THE present work has two main objects. One of these, the proof that all pure mathematics deals exclusively with concepts definable in terms of a very small number of fundamental logical concepts, and that all its propositions are deducible from a very small number of fundamental logical principles" (Preface 1903:vi).
 "A few words as to the origin of the present work may serve to show the importance of the questions discussed. About six years ago, I began an investigation into the philosophy of Dynamics. . . . [From two questions  acceleration and absolute motion in a "relational theory of space"] I was led to a reexamination of the principles of Geometry, thence to the philosophy of continuity and infinity, and then, with a view to discovering the meaning of the word any, to Symbolic Logic" (Preface 1903:vivii).
Epistemology behind logicism
TBD: [Dedekind's and Frege's epistemology needs expansion]
Dedekind and Frege: The epistemology of Dedekind and Frege is not as welldefined as that of the philosopher Russell, but both seem accepting as a priori the customary "laws of thought" concerning simple propositional statements (usually of belief); these laws would be sufficient in themselves if augmented with theory of classes and relations (e.g. x R y) between individuals x and y linked by the generalization R.
Russell the realist: Russell's Realism served him as an antidote to British Idealism,^{[4]} with portions borrowed from European Rationalism and British empiricism.^{[5]} To begin with, "Russell was a realist about two key issues: universals and material objects" (Russell 1912:xi). For Russell, tables are real things that exist independent of Russell the observer. Rationalism would contribute the notion of a priori knowledge,^{[6]} while empiricism would contribute the role of experiential knowledge (induction from experience).^{[7]} Russell would credit Kant with the idea of "a priori" knowledge, but he offers an objection to Kant he deems "fatal": "The facts [of the world] must always conform to logic and arithmetic. To say that logic and arithmetic are contributed by us does not account for this" (1912:87); Russell concludes that the a priori knowledge that we possess is "about things, and not merely about thoughts" (1912:89). And in this Russell's epistemology seems different from that of Dedekind's belief that "numbers are free creations of the human mind" (Dedekind 1887:31).
But his epistemology about the innate (he prefers the word a priori when applied to logical principles, cf 1912:74) is intricate. He would strongly, unambiguously express support for the Platonic "universals" (cf 1912:91118) and he would conclude that truth and falsity are "out there"; minds create beliefs and what makes a belief true is a fact, "and this fact does not (except in exceptional cases) involve the mind of the person who has the belief" (1912:130).
Where did Russell derive these epistemic notions? He tells us in the Preface to his 1903 Principles of Mathematics. Note that he asserts that the belief: "Emily is a rabbit" is nonexistent, and yet the truth of this nonexistent proposition is independent of any knowing mind; if Emily really is a rabbit, the fact of this truth exists whether or not Russell or any other mind is alive or dead, and the relation of Emily to rabbithood is "ultimate" :
 "On fundamental questions of philosophy, my position, in all its chief features, is derived from Mr G. E. Moore. I have accepted from him the nonexistential nature of propositions (except such as happen to assert existence) and their independence of any knowing mind; also the pluralism which regards the world, both that of existents and that of entities, as composed of an infinite number of mutually independent entities, with relations which are ultimate, and not reducible to adjectives of their terms or of the whole which these compose. . . . The doctrines just mentioned are, in my opinion, quite indispensable to any even tolerably satisfactory philosophy of mathematics, as I hope the following pages will show. . . . Formally, my premisses are simply assumed; but the fact that they allow mathematics to be true, which most current philosophies do not, is surely a powerful argument in their favour." (Preface 1903:viii)
Russell and the paradox: In 1902 Russell discovered of a "vicious circle" (the socalled Russell's paradox) in Frege's Begriffsschrift and he was determined not to repeat it in his 1903 Principles of Mathematics. In two Appendices that he tacked on at the last minute he devotes 28 pages to a detailed analysis of, first Frege's theory contrasted against his own, and secondly a fix for the paradox. Unfortunately he was not optimistic about the outcome:
 "In the case of classes, I must confess, I have failed to perceive any concept fulfilling the conditions requisite for the notion of class. And the contradiction discussed in Chapter x. proves that something is amiss, but what this is I have hitherto failed to discover. (Preface to Russell 1903:vi)"
"Fictionalism" and Russell's noclass theory: Gödel in his 1944 would disagree with the young Russell of 1903 ("[my premisses] allow mathematics to be true") but would probably agree with Russell's statement quoted above ("something is amiss"); Russell's theory had failed to arrive at a satisfactory foundation of mathematics: the result was "essentially negative; i.e. the classes and concepts introduced this way do not have all the properties required for the use of mathematics" (Gödel 1944:132).
How did Russell arrive in this situation? Gödel observes that Russell is a surprising "realist" with a twist: he cites Russell's 1919:169 "Logic is concerned with the real world just as truly as zoology" (Gödel 1944:120). But he observes that "when he started on a concrete problem, the objects to be analyzed (e.g. the classes or propositions) soon for the most part turned into "logical fictions" . . . [meaning] only that we have no direct perception of them." (Gödel 1944:120)
In an observation pertainent to Russell's brand of logicism, Perry remarks that Russell went through three phases of realism  extreme, moderate and constructive (Perry 1997:xxv). In 1903 he was in his extreme phase; by 1905 he would be in his moderate phase. In a few years he would "dispense with physical or material objects as basic bits of the furniture of the world. He would attempt to construct them out of sensedata" in his next book Our knowledge of the External World[1914]" (Perry 1997:xxvi).
These constructions in what Gödel 1944 would call "nominalistic constructivism . . . which might better be called fictionalism" derived from Russell's "more radical idea, the "noclass theory" (p. 125):
 "according to which classes or concepts never exist as real objects, and sentences containing these terms are meaningful only as they can be interpreted as . . . a manner of speaking about other things" (p. 125).
See more in the Criticism sections, below.
The Logistic construction of the natural numbers
The attempt to construct the natural numbers is summarized succinctly by Bernays 19301931.^{[8]} But rather than use Bernays' précis, which is incomplete in the details, the construction is best given as a simple finite example together with the details to be found in Russell 1919.
In general the logicism of DedekindFrege is similar to that of Russell, but with significant (and critical) differences in the particulars (see Criticisms, below). Overall, though, the logicistic constructionprocess [DedekindFregeRussell] is far different than that of contemporary set theory. Whereas in set theory the notion of "number" begins from an axiom  the axiom of pairing that leads to the definition of "ordered pair"  no overt numberaxiom exists in logicism. Rather, logicism begins its construction of the numbers from "primitive propositions" that include "class", "propositional function", and in particular, "relations" of "similarity" ("equinumerosity": placing the elements of collections in onetoone correspondence) and "ordering" (using "the successor of" relation to order the collections of the equinumerous classes)".^{[9]} The logicistic derivation equates the cardinal numbers constructed this way to the natural numbers, and these numbers end up all of the same "type"  as equivalence classes of classes—whereas in set theory each number is of a higher class than its predecessor (thus each successor contains its predecessor as a subset). Kleene observes that:
 "The viewpoint here is very different from that [of Kronecker's supposition that 'God made the integers' plus Peano's axioms of number and mathematical induction,] where we supposed an intuitive conception of the number sequence and elicited from it the principle that, whenever a particular property P of natural numbers is given such that (1) and (2), then any given natural number must have the property P" (Kleene 1952:44).
The importance to logicism of the construction of the natural numbers derives from Russell's contention that "That all traditional pure mathematics can be derived from the natural numbers is a fairly recent discovery, though it had long been suspected" (1919:4). The derivation of the real numbers (rationals, irrationals) derives from the theory of Dedekind cuts on the continuous "number line". While an example of how this is done is useful, it relies first on the derivation of the natural numbers. So, if philosophic problems appear in the logistic attempt to derive the natural numbers, these problems will be sufficient to stop the program until these are fixed (see Criticisms, below).
Preliminaries
For Dedekind, Frege and Russell, collections (classes) are aggregates of “things” specified by proper names, that come about as the result of propositions (utterances about something that asserts a fact about that thing or things). Russell tore the general notion down in the following manner. He begins with "terms" in sentences that he decomposes as follows:
Terms: For Russell, “terms” are either “things” or “concepts”: “Whatever may be an object of thought, or may occur in any true or false proposition, or can be counted as one, I call a term. This, then, is the widest word in the philosophical vocabulary. I shall use as synonymous with it the words, unit, individual, and entity. The first two emphasize the fact that every term is one, while the third is derived from the fact that every term has being, i.e. is in some sense. A man, a moment, a number, a class, a relation, a chimaera, or anything else that can be mentioned, is sure to be a term; and to deny that such and such a thing is a term must always be false” (Russell 1903:43)
Things are indicated by proper names; concepts are indicated by adjectives or verbs: "Among terms, it is possible to distinguish two kinds, which I shall call respectively things and concepts; the former are the terms indicated by proper names, the latter those indicated by all other words . . . Among concepts, again, two kinds at least must be distinguished, namely those indicated by adjectives and those indicated by verbs" (1903:44).
Conceptadjectives are "predicates"; conceptverbs are "relations": "The former kind will often be called predicates or classconcepts; the latter are always or almost always relations.” (1903:44)
The notion of a "variable" subject appearing in a proposition: "I shall speak of the terms of a proposition as those terms, however numerous, which occur in a proposition and may be regarded as subjects about which the proposition is. It is a characteristic of the terms of a proposition that anyone of them may be replaced by any other entity without our ceasing to have a proposition. Thus we shall say that "Socrates is human" is a proposition having only one term; of the remaining component of the proposition, one is the verb, the other is a predicate.. . . Predicates, then, are concepts, other than verbs, which occur in propositions having only one term or subject.” (1903:45)
In other words, a “term” can be placeholder that indicates (denotes) one or more things that can be put into the placeholder. (1903:45).
Truth and falsehood: Suppose Russell were to point to an object and utter: “This object in front of me named “Emily” is a woman.” This is a proposition, an assertion of Russell's belief to be tested against the “facts” of the outer world: “Minds do not create truth or falsehood. They create beliefs . . . what makes a belief true is a fact, and this fact does not (except in exceptional cases) in any way involve the mind of the person who has the belief” (1912:130). If by investigation of the utterance and correspondence with “fact”, Russell discovers that Emily is a rabbit, then his utterance is considered “false”; if Emily is a female human (a female “featherless biped” as Russell likes to call humans), then his utterance is considered “true”.
If Russell were to utter a generalization about all Emilys then these object/s (entity/ies) must be examined, one after another in order to verify the truth of the generalization. Thus if Russell were to assert “All Emilys are women”, then the “All” is a tipoff that the utterance is about all entities “Emily” in correspondence with a concept labeled “woman” and a methodical examination of all creatures with human names would have to commence.
Classes (aggregates, complexes): "The class, as opposed to the classconcept, is the sum or conjunction of all the terms which have the given predicate” (1903 p. 55). Classes can be specified by extension (listing their members) or by intension, i.e. by a "propositional function" such as "x is a u" or "x is v". But "if we take extension pure, our class is defined by enumeration of its terms, and this method will not allow us to deal, as Symbolic Logic does, with infinite classes. Thus our classes must in general be regarded as objects denoted by concepts, and to this extent the point of view of intension is essential.” (1909 p. 66)
Propositional functions: "The characteristic of a class concept, as distinguished from terms in general, is that "x is a u" is a propositional function when, and only when, u is a classconcept." (1903:56)
Extensional versus intensional definition of a class: "71. Class may be defined either extensionally or intensionally. That is to say, we may define the kind of object which is a class, or the kind of concept which denotes a class: this is the precise meaning of the opposition of extension and intension in this connection. But although the general notion can be defined in this twofold manner, particular classes, except when they happen to be finite, can only be defined intensionally, i.e. as the objects denoted by such and such concepts. . . logically; the extensional definition appears to be equally applicable to infinite classes, but practically, if we were to attempt it, Death would cut short our laudable endeavour before it had attained its goal.(1903:69)
The definition of the natural numbers
The natural numbers derive from ALL propositions (i.e. completely unrestricted) in this and all other possible worlds, that can be uttered about ANY collection of entities whatsoever. Russell makes this clear in the second (italicized) sentence:
 "In the first place, numbers themselves form an infinite collection, and cannot therefore be defined by enumeration. In the second place, the collections having a given number of terms themselves presumably form an infinite collection: it is to be presumed, for example, that there are an infinite collection of trios in the world, for if this were not the case the total number of things in the world would be finite, which, though possible, seems unlikely. In the third place, we wish to define "number" in such a way that infinite numbers may be possible; thus we must be able to speak of the number of terms in an infinite collection, and such a collection must be defined by intension, i.e. by a property common to all its members and peculiar to them." (1919:13)
To begin, devise a finite example. Suppose there are 12 families on a street. Some have children, some do not. To discuss the names of the children in these households requires 12 propositions asserting “ childname is the name of a child in family Fn” applied this collection of households on the particular street of families with names F1, F2, . . . F12. Each of the 12 propositions regards whether or not the "argument" childname applies to a child in a particular household. The childrens’ names (childname) can be thought of as the x in a propositional function f(x), where the function is "name of a child in the family with name Fn".^{[10]}
To keep things simple all 26 letters of the alphabet are used up in this example, each letter representing the name of a particular child (in real life there could be repeats). Notice that, in the Russellian view these collections are not sets, but rather "aggregates" or "collections" or "classes" listings of names that satisfy the predicates F1, F2, . . .. As noted in Step 1, For Russell, these "classes" are "symbolic fictions" that exist only as their aggregate members, i.e. as the extensions of their propositional functions, and not as unitthings in themselves.
Step 1: Assemble ALL the classes: Whereas the following example is finite over the veryfinite propositional function " childnames of the children in family Fn'" on the veryfinite street of a finite number of (12) families, Russell intended the following to extend to ALL propositional functions extending over an infinity of this and all other possible worlds; this would allow him to create ALL the numbers (to infinity).
Kleene observes that already Russell has set himself up with an impredicative definition that he will have to resolve, or otherwise he will be confronted with his Russell paradox. "Here instead we presuppose the totality of all properties of cardinal numbers, as existing in logic, prior to the definition of the natural number sequence" (Kleene 1952:44). The problem will appear, even in the finite example presented here, when Russell confronts the unit class (cf Russell 1903:517).
The matter of debate comes down to this: what exactly is a “class”? For Dedekind and Frege, a class is a distinct entity all its own, a “unity” that can be identified with all those entites x that satisfy the propositional function F( ). (This symbolism appears in Russell, attributing it to Frege: "The essence of a function is what is left when the x is taken away, i.e in the above instance, 2( )^{3} + ( ). The argument x does not belong to the function, but the two together make a whole (ib. p. 6 [i.e. Frege's 1891 Function und Begriff]" (Russell 1903:505).) For example, a particular “unity” could be given a name; suppose a family Fα has the children with the names Annie, Barbie and Charles:
 [ a, b, c ]_{Fα}
This DedekindFrege construction could be symbolized by a bracketing process similar to, but to be distinguished from, the symbolism of contemporary set theory { a, b, c }, i.e. [ ] with the elements that satisfy the proposition separated by commas (an index to label each collectionasaunity will not be used, but could be):
 [a, b, c], [d], [ ], [e, f, g], [h, i], [j, k], [l, m, n, o, p], [ ], [q, r], [s], [t, u], [v, w, x, y, z]
This notion of collectionor or classasobject, when used without restriction, results in Russell's paradox; see more below about impredicative definitions. Russell's solution was to define the notion of a class to be only those elements that satisfy the proposition, his argument being that, indeed, the arguments x do not belong to the propositional function aka "class" created by the function. The class itself is not to be regarded as a unitary object in its own right, it exists only as a kind of useful fiction: “We have avoided the decision as to whether a class of things has in any sense an existence as one object. A decision of this question in either way is indifferent to our logic” (First edition of Principia Mathematica 1927:24).
Russell does not waver from this opinion in his 1919; observe the words "symbolic fictions":
 “When we have decided that classes cannot be things of the same sort as their members, that they cannot be just heaps or aggregates, and also that they cannot be identified with propositional functions, it becomes very difficult to see what they can be, if they are to be more than symbolic fictions. And if we can find any way of dealing with them as symbolic fictions, we increase the logical security of our position, since we avoid the need of assuming that there are classes without being compelled to make the opposite assumption that there are no classes. We merely abstain from both assumptions. . . . But when we refuse to assert that there are classes, we must not be supposed to be asserting dogmatically that there are none. We are merely agnostic as regards them . . ..” (1919:184)
And by the second edition of PM (1927) Russell would insist that “functions occur only through their values, . . . all functions of functions are extensional, . . . [and] consequently there is no reason to distinguish between functions and classes . . . Thus classes, as distinct from functions, loose even that shadowy being which they retain in *20” (p. xxxix). In other words, classes as a separate notion have vanished altogether.
Given Russell's insistence that classes are not singular objectsinthemselves, but only collected aggregates, the only correct way to symbolize the above listing is to eliminate the brackets. But this is visually confusing, especially with regards to the null class, so a dashed vertical line at each end of the collection will be used to symbolize the collectionasaggregate:
 ┊a, b, c┊, ┊d┊, ┊┊, ┊e, f, g┊, ┊h, i┊, ┊j, k┊, ┊l, m, n, o, p┊, ┊┊, ┊q, r┊, ┊s┊, ┊t, u┊, ┊v, w, x, y, z┊
Step 2: Collect “similar” classes into bundles (equivalence classes): These above collections can be put into a "binary relation" (comparing for) similarity by "equinumerosity”, symbolized here by ≈, i.e. oneone correspondence of the elements,^{[11]} and thereby create Russellian classes of classes or what Russell called “bundles”. ”We can suppose all couples in one bundle, all trios in another, and so on. In this way we obtain various bundles of collections, each bundle consisting of all the collections that have a certain number of terms. Each bundle is a class whose members are collections, i.e. classes; thus each is a class of classes" (Russell 1919:14).
Take for example ┊h,i┊. Its terms h, i cannot be put into oneone correspondence with the terms of ┊a,b,c┊,┊d┊,┊┊,┊e,f,g┊, etc. But it can be put in correspondence with itself and with ┊j,k┊,┊q,r┊, and ┊t,u┊. These similar collections can be assembled into a “bundle” (equivalence class) as shown below.
 ┊┊h,i┊, ┊j,k┊, ┊q,r┊, ┊t,u┊┊
The bundles (equivalence classes) are shown below.
 ┊ ┊a, b, c┊, ┊e, f, g┊ ┊
 ┊ ┊d┊, ┊s┊ ┊
 ┊ ┊┊, ┊┊ ┊
 ┊ ┊h, i┊, ┊j, k┊, ┊q, r┊, ┊t, u┊ ┊
 ┊ ┊ l, m, n, o, p┊, ┊v, w, x, y, z┊ ┊
Step 3: Define the nullclass: Notice that the third classofclasses, ┊ ┊┊, ┊┊ ┊ , is special because its classes contain no elements, i.e. no elements satisfy the predicates that created this particular class/collection. Example: the predicates are:
 “For all childnames: “childname is the name of a child in family F_{ρ}”.
 “For all childnames: “childname is the name of a child in family F_{σ}”.
Thes particular predicates cannot be satisfied because families F_{ρ} and F_{σ} are childless. There are no terms (names) that satisfy these particular predicates. Remarkably, the class of things, signified by the fictitious ┊┊, that satisfy each of these this classes is not only empty, it does not exist at all (more or less, for Russell the agnosticaboutclassexistence); for DedekindFrege it does exist.
This peculiar nonexistent entity ┊┊ is nicknamed the “null class” or the “empty class”. This is not the same as the class of all null classes ┊ ┊┊ ┊: the class of all null classes is destined to become “0”; see below. Russell symbolized the null/empty class ┊┊ with Λ. So what exactly is the Russellian null class? In PM Russell says that “A class is said to exist when it has at least one member . . . the class which has no members is called the “null class” . . . “α is the nullclass” is equivalent to "α does not exist". One is left uneasy: Does the null class itself “exist”? This problem bedeviled Russell throughout his writing of 1903.^{[12]} After he discovered the paradox in Frege’s Begriffsschrift he added Appendix A to his 1903 where through the analysis of the nature of the null and unit classes, he discovered the need for a “doctrine of types”; see more about the unit class, the problem of impredicative definitions and Russell's "vicious circle principle" below.^{[13]}
Step 4: Assign a "numeral" to each bundle: For purposes of abbreviation and identification, to each bundle assign a unique symbol (aka a “numeral”). These symbols are arbitrary. (The symbol ≡ means "is an abbreviation for" or "is a definition of"):
 ┊ ┊a, b, c┊, ┊e, f, g┊ ┊ ≡ ✖
 ┊ ┊d┊, ┊s┊ ┊ ≡ ■
 ┊ ┊┊ ┊ ≡ ♣
 ┊ ┊h, i┊, ┊j, k┊ ┊, ┊q, r┊, ┊t, u┊ ┊ ≡ ❥
 ┊ ┊ l, m, n, o, p┊, ┊v, w, x, y, z┊ ┊ ≡ ♦
Step 5: Define “0”: In order to "order" the bundles into the familiar numberline a starting point traditionally called “zero”, is required. Russell picked the empty or null class of classes to fill this role. This null classofclasses ┊ ┊┊ ┊┊ ┊ has been labeled "0" ≡ ♣^{[14]}
Step 6: Define the notion of “successor”: Russell defined a new characteristic "hereditary", a property of certain classes with the ability to "inherit" a characteristic from another class (or classofclasses) i.e. “A property is said to be "hereditary" in the naturalnumber series if, whenever it belongs to a number n, it also belongs to n+1, the successor of n.” (1903:21). He asserts that “the natural numbers are the posterity  the “children”, the inheritors of the “successor”  of 0 with respect to the relation “the immediate predecessor of (which is the converse of “successor”) (1919:23).
Note Russell has used a few words here without definition, in particular “number series”, “number n”, and “successor”. He will define these in due course. Observe in particular that Russell does not use the unit classofclasses "1" to construct the successor (in our example ┊ ┊d┊, ┊s┊ ┊ ≡ ■ ) . The reason is that, in Russell's detailed analysis,^{[15]} if a unit class ■ becomes a entity in its own right, then it too can be an element in its own proposition; this causes the proposition to become "impredicative" and result in a "vicious circle". Rather, he states (confusingly): “We saw in Chapter II that a cardinal [natural] number is to be defined as a class of classes, and in Chapter III that the number 1 is to be defined as the class of all unit classes, of all that have just one member, as we should say but for the vicious circle. Of course, when the number 1 is defined as the class of all unit classes, unit classes must be defined so as not to assume that we know what is meant by one (1919:181).
For his definition of successor, Russell will use for his "unit" a single entity or "term" as follows:
 “It remains to define "successor." Given any number n let α be a class which has n members, and let x be a term which is not a member of α. Then the class consisting of α with x added on will have +1 members. Thus we have the following definition:
 the successor of the number of terms in the class α is the number of terms in the class consisting of α together with x where x is not any term belonging to the class.” (1919:23)
Russell’s definition requires a new “term” (name, thing) which is “added into” the collections inside the bundles. To keep the example abstract this will be abbreviated by the name "Smiley" ≡ ☺ (on the assumption that no one has ever actually named their child "Smiley").
Step 7: Construct the successor of the null class: For example into the null class Λ stick the smiley face. From the previous, it is not obvious how to do this. The predicate:
 “For all childnames: "childname is the name of a child in family F_{α}”.
has to be modified to creating a predicate that contains a term that is always true:
 “For all childnames: "childname is the name of a child in family F_{α} *AND* Smiley";
In the case of the family with no children, “Smiley” is the only “term” that satisfies the predicate. Russell fretted over the use of the word *AND* here, as in “Barbie AND Smiley”, and called this kind of AND (symbolized below with *&* ) a “numerical conjunction” ^{[16]}:
 ┊ ┊┊ ┊ *&* ☺ → ┊┊☺┊┊
By the relation of similarity ≈, this new class can be put into the equivalence class (the unit class) defined by ■:
 ┊┊☺┊┊ ≈ ┊d┊,┊s┊ → ┊┊☺┊,┊d┊,┊s┊┊≡ ■, i.e.
 0 *&* ☺ → ■,
Step 8: For every equivalence class, create its successor: Note that the smileyface symbol must be inserted into every collection/class in a particular equivalenceclass bundle, then by the relation of similarity ≈ each newlygenerated classofclasses must be put into the equivalence class that defines n+1:
 ❥ *&* ☺ ≡┊┊h,i┊, ┊j,k┊, ┊q,r┊, ┊t,u┊┊ *&* ☺ → ┊┊h, i, ☺┊, ┊j, k, ☺┊, ┊q, r, ☺┊, ┊t, u, ☺┊, ┊a, b, c┊, ┊e, f, g┊┊ ≡ ✖, i.e.
 ❥ *&* ☺ → ✖
And in a similar manner, by use of the abbreviations set up above, for each numeral its successor is created:
 0
 0 *&* ☺ = ■
 ■ *&* ☺ = ❥
 ❥ *&* ☺ = ✖
 ✖ *&* ☺ = ? [no symbol]
 ? *&* ☺ = ♦
 ♦ *&* ☺ = etc, etc
Step 9: Order the numbers: The process of creating a successor requires the relation " . . . is the successor of . . .", call it "S", between the various "numerals", for example ■ S 0, ❥ S ■, and so forth. “We must now consider the serial character of the natural numbers in the order 0, 1, 2, 3, . . . We ordinarily think of the numbers as in this order, and it is an essential part of the work of analysing our data to seek a definition of "order" or "series " in logical terms. . . . The order lies, not in the class of terms, but in a relation among the members of the class, in respect of which some appear as earlier and some as later." (1919:31)
Russell applies to the notion of “ordering relation” three criteria: First, he defines the notion of “asymmetry” i.e. given the relation such as S (" . . . is the successor of . . . ") between two terms x, and y: x S y ≠ y S x. Second, he defines the notion of transitivity for three numerals x, y and z: if x S y and y S z then x S z. Third, he defines the notion of “connected”: “Given any two terms of the class which is to be ordered, there must be one which precedes and the other which follows. . . . A relation is connected when, given any two different terms of its field [both domain and converse domain of a relation e.g. husbands versus wives in the relation of married] the relation holds between the first and the second or between the second and the first (not excluding the possibility that both may happen, though both cannot happen if the relation is asymmetrical).(1919:32)
He concludes: ”. . . [natural] number m is said to be less than another number n when n possesses every hereditary property possessed by the successor of m. It is easy to see, and not difficult to prove, that the relation "less than," so defined, is asymmetrical, transitive, and connected, and has the [natural] numbers for its field [i.e. both domain and converse domain are the numbers].” (1919:35)
Criticism
The problem of presuming the "extralogical" notion of “iteration”: Kleene points out that, “the logicistic thesis can be questioned finally on the ground that logic already presupposes mathematical ideas in its formulation. In the Intuitionistic view, an essential mathematical kernel is contained in the idea of iteration” (Kleene 1952:46)
Bernays 19301931 observes that this notion "two things" already presupposes something, even without the claim of existence of two things, and also without reference to a predicate, which applies to the two things; it means, simply, “a thing and one more thing. . . . With respect to this simple definition, the Number concept turns out to be an elementary structural concept . . . the claim of the logicists that mathematics is purely logical knowledge turns out to be blurred and misleading upon closer observation of theoretical logic. . . . [one can extend the definition of “logical”] however, through this definition what is epistemologically essential is concealed, and what is peculiar to mathematics is overlooked” (in Mancosu 1998:243).
Hilbert 1931:2667, like Bernays, detects “something extralogical” in mathematics: “Besides experience and thought, there is yet a third source of knowledge. Even if today we can no longer agree with Kant in the details, nevertheless the most general and fundamental idea of the Kantian epistemology retains its significance: to ascertain the intuitive a priori mode of thought, and thereby to investigate the condition of the possibility of all knowledge. In my opinion this is essentially what happens in my investigations of the principles of mathematics. The a priori is here nothing more and nothing less than a fundamental mode of thought, which I also call the finite mode of thought: something is already given to us in advance in our faculty of representation: certain extralogical concrete objects that exist intuitively as an immediate experience before all thought. If logical inference is to be certain, then these objects must be completely surveyable in all their parts, and their presentation, their differences, their succeeding one another or their being arrayed next to one another is immediately and intuitively given to us, along with the objects, as something that neither can be reduced to anything else, nor needs such a reduction.” (Hilbert 1931 in Mancosu 1998: 266, 267).
In brief: the notion of “sequence” or “successor” is an a priori notion that lies outside symbolic logic.
Hilbert dismissed logicism as a "false path": “Some tried to define the numbers purely logically; others simply took the usual numbertheoretic modes of inference to be selfevident. On both paths they encountered obstacles that proved to be insuperable.” (Hilbert 1931 in Mancoso 1998:267) .
Mancosu states that Brouwer concluded that: “the classical laws or principles of logic are part of [the] perceived regularity [in the symbolic representation]; they are derived from the post factum record of mathematical constructions . . . Theoretical logic . . . [is] an empirical science and an application of mathematics” (Brouwer quoted by Mancosu 1998:9).
Gödel 1944: With respect to the technical aspects of Russellian logicism as it appears in Principia Mathematic (either edition), Gödel is flatout disappointed:
 "It is to be regretted that this first comprehensive and thoroughgoing presentation of a mathematical logic and the derivation of mathematics from it [is?] so greatly lacking in formal precision in the foundations (contained in *1  *21 of Principia) that it presents in this respect a considerable step backwards as compared with Frege. What is missing, above all, is a prcise statement of the syntax of the formalism"(cf footnote 1 in Gödel 1944 Collected Works 1990:120).
In particular he pointed out that "The matter is especially doubtful for the rule of substitution and of replacing defined symbols by their definiens" (Russell 1944:120)
With respect the philosophy that formed these foundations, Gödel would home in on Russell's "noclass theory", or what Gödel would call his "nominalistic kind of contructivism, such as that embodied in Russell's "no class theory" . . . which might better be called fictionalism" (cf footnote 1 in Gödel 1944:119). See more in "Gödel's criticism and suggestions" below.
GrattanGuinness: [TBD] A complicated theory of relations continued to strangle Russell's explanatory 1919 Introduction to Mathematical Philosophy and his 1927 second edition of Principia. Set theory, meanwhile had moved on with its reduction of relation to the ordered pair of sets. GrattanGuiness observes that in the second edition of Principia Russell ignored this reduction that had been achieved by his own student Norbert Wiener (1914). Perhaps because of "residual annoyance, Russell did not react at all".^{[17]} By 1914 Hausdorff would provide another, equivalent definition, and Kuratowski in 1921 would provide the one in use today.^{[18]}
The unit class, impredicativity and the vicious circle principle
A benign impredicative definition: Suppose the local librarian wants to catalog (index) her collection into a single book (call it Ι for "index"). Her index must list ALL the books and their locations in the library. As it turns out, there are only three books, and these have titles Ά, β, and Γ. To form her indexbook I, she goes out and buys a book of 200 blank pages and labels it "I". Now she has four books: I, Ά, β, and Γ. Her task is not difficult. When completed, the contents of her index I is 4 pages, each with a unique title and unique location (each entry abbreviated as Title.Location_{T}):
 I ← { I.L_{I}, Ά.L_{Ά}, β.L_{β}, Γ.L_{Γ}}.
This sort of definition of I was deemed by Poincaré to be "impredicative". He opined that only predicative definitions can be allowed in mathematics:
 "a definition is 'predicative' and logically admissible only if it excludes all objects that are dependent upon the notion defined, that is, that can in any way be determined by it".^{[19]}
By Poincaré's definition, the librarian's index book is "impredicative" because the definition of I is dependent upon the definition of the totality I, Ά, β, and Γ. As noted below, some commentators insist that impredicativity in commonsense versions is harmless, but as the examples show below there are versions which are not harmless. In the teeth of these, Russell would enunciate a strict prohibition—his "vicious circle principle":
 "No totality can contain members definable only in terms of this totality, or members involving or presupposing this totality" (vicious circle principle)" (Gödel 1944 appearing in Collected Works Vol. II 1990:125).^{[20]}
A pernicious impredicativity: α = NOTα: To create a pernicious paradox, apply input α to the simple function box F(x) with output ω = 1  α. This is the algebraiclogic equivalent of the symboliclogical ω = NOTα for truth values 1 and 0 rather than "true" and "false". In either case, when input α = 0, output ω = 1; when input α = 1, output ω = 0.
To make the function "impredicative", wrap around output ω to input α, i.e. identify (equate) the input with (to) the output (at either the output or input, it does not matter):
 α = 1α
Algebraically the equation is satisfied only when α = 0.5. But logically, when only "truth values" 0 and 1 are permitted, then the equality cannot be satisfied. To see what is happening, employ an illustrative crutch: assume (i) the starting value of α = α_{0} and (ii) observe the inputoutput propagation in discrete timeinstants that proceed left to right in sequence across the page:
 α_{0} → F(x) → 1α_{0} → F(x) → (1 (1α_{o})) → F(x) → (1(1(1α_{o}))) → F(x) → ad nauseam
Start with α_{0} = 0:
 α_{0} = 0 → F(x) → 1 → F(x) → 0 → F(x) → 1 → F(x) → ad nauseam
Observe that output ω oscillates between 0 and 1. If the "discrete timeinstant" crutch (ii) is dropped, the functionbox's output (and input) is both 1 and 0 simultaneously.
Fatal impredicativity in the definition of the unit class: The problem that bedeviled the logicists (and set theorists too, but with a different resolution) derives from the α = NOTα paradox^{[21]} Russell discovered in Frege's 1879 Begriffsschrift^{[22]} that Frege had allowed a function to derive its input "functional" (value of its variable) not only from an object (thing, term), but from the function's own output as well.^{[23]}
As described above, Both Frege's and Russell's construction of natural numbers begins with the formation of equinumerous classesofclasses (bundles), then with an assignment of a unique "numeral" to each bundle, and then placing the bundles into an order via a relation S that is asymmetric: x S y ≠ y S x. But Frege, unlike Russell, allowed the class of unit classes (in the example above [[d], [s]]) to be identified as a unit itself:
 [[d], [s]] ≡ ■ ≡ 1
But, since the class ■ or 1 is a single object (unit) in its own right, it too must be included in the classofunitclasses as an additional class [■]. And this inclusion results in an "infinite regress" (as Godel called it) of increasing "type" and increasing content:
 [[d], [s], [■]] ≡ ■
 [[d], [s], [[d], [s], [■]]]] ≡ ■
 [[d], [s], [[d], [s], [[[d], [s], [[d], [s], [■]]]]]]]] ≡ ■, ad nauseum
Russell would make this problem go away by declaring a class to be a "fiction" (more or less). By this he meant that the class would designate only the elements that satisfied the propositional function (e.g. d and s) and nothing else. As a "fiction" a class cannot be considered to be a thing: an entity, a "term", a singularity, a "unit". It is an assemblage e.g. d,s but it is not (in Russell's view) worthy of thinghood:
 "The class as many . . . is unobjectionable, but is many and not one. We may, if we choose, represent this by a single symbol: thus x ε u will mean " x is one of the u 's." This must not be taken as a relation of two terms, x and u, because u as the numerical conjunction is not a single term . . . Thus a class of classes will be many many's; its constituents will each be only many, and cannot therefore in any sense, one might suppose, be single constituents.[etc]" (1903:516).
This supposes that "at the bottom" every single solitary "term" can be listed (specified by a "predicative" predicate) for any class, for any class of classes, for class of classes of classes, etc, but it introduces a new problem—a hierarchy of "types" of classes.
A solution to impredicativity: a hierarchy of types
Classes as nonobjects, as useful fictions: Gödel 1944:131 observes that "Russell adduces two reasons against the extensional view of classes, namely the existence of (1) the null class, which cannot very well be a collection, and (2) the unit classes, which would have to be identical with their single elements." He suggests that Russell should have regarded these as fictitious, but not derive the further conclusion that all classes (such as the classofclasses that define the numbers 2, 3, etc) are fictions.
But Russell did not do this. After a detailed analysis in Appendix A: The Logical and Arithmetical Doctrines of Frege in his 1903, Russell concludes:
 "The logical doctrine which is thus forced upon us is this: The subject of a proposition may be not a single term, but essentially many terms; this is the case with all propositions asserting numbers other than 0 and 1" (1903:516).
In the following notice the wording "the class as many" a class is an aggregate of those terms (things) that satisfy the propositional function, but a class is not a thinginitself:
 "Thus the final conclusion is, that the correct theory of classes is even more extensional than that of Chapter VI; that the class as many is the only object always defined by a propositional function, and that this is adequate for formal purposes" (1903:518).
It is as if Russellasrancher were to round up all his critters (sheep, cows and horses) into three fictitious corrals (one for the sheep, one for the cows, and one for the horses) that are located in his fictitious ranch. What actually exists are the sheep, the cows and the horses (the extensions), but not the fictitious "concepts" corrals and ranch.
Ramified theory of types: functionorders and argumenttypes, predicative functions: When Russell proclaimed all classes are useful fictions he solved the problem of the "unit" class, but the overall problem did not go away; rather, it arrived in a new form: "It will now be necessary to distinguish (1) terms, (2) classes, (3) classes of classes, and so on ad infinitum; we shall have to hold that no member of one set is a member of any other set, and that x ε u requires that x should be of a set of a degree lower by one than the set to which u belongs. Thus x ε x will become a meaningless proposition; and in this way the contradiction is avoided" (1903:517).
This is Russell's "doctrine of types". To guarantee that impredicative expressions such as x ε x can be treated in his logic, Russell proposed, as a kind of working hypothesis, that all such impredicative definitions have predicative definitions. This supposition requires the notions of function"orders" and argument"types". First, functions (and their classesasextensions, i.e. "matrices") are to be classified by their "order", where functions of individuals are of order 1, functions of functions (classes of classes) are of order 2, and so forth. Next, he defines the "type" of a function's arguments (the function's "inputs") to be their "range of significance", i.e. what are those inputs α (individuals? classes? classesofclasses? etc.) that, when plugged into f(x), yield a meaningful output ω. Note that this means that a "type" can be of mixed order, as the following example shows:
 "Joe DiMaggio and the Yankees won the 1947 World Series".
This sentence can be decomposed into two clauses: "x won the 1947 World Series" + "y won the 1947 World Series". The first sentence takes for x an individual "Joe DiMaggio" as its input, the other takes for y an aggregate "Yankees" as its input. Thus the compositesentence has a (mixed) type of 2, mixed as to order (1 and 2).
By "predicative", Russell meant that the function must be of an order higher than the "type" of its variable(s). Thus a function (of order 2) that creates a class of classes can only entertain arguments for its variable(s) that are classes (type 1) and individuals (type 0), as these are lower types. Type 3 can only entertain types 2, 1 or 0, and so forth. But these types can be mixed (for example, for this sentence to be (sort of) true: " z won the 1947 World Series " could accept the individual (type 0) "Joe DiMaggio" and/or the names of his other teammates, and it could accept the class (type 1) of individual players "The Yankees".
The axiom of reducibility: The axiom of reducibility is the hypothesis that any function of any order can be reduced to (or replaced by) an equivalent predicative function of the appropriate order.^{[24]} A careful reading of the first edition indicates that an n^{th} order predicative function need not be expressed "all the way down" as a huge "matrix" or aggregate of individual atomic propositions. "For in practice only the relative types of variables are relevant; thus the lowest type occurring in a given context may be called that of individuals" (p. 161). But the axiom of reducibility proposes that in theory a reduction "all the way down" is possible.
Russell 1927 abandons the axiom of reducibility, and the edifice collapses: By the 2nd edition of PM of 1927, though, Russell had given up on the axiom of reducibility and concluded he would indeed force any order of function "all the way down" to its elementary propositions, linked together with logical operators:
 "All propositions, of whatever order, are derived from a matrix composed of elementary propositions combined by means of the stroke" (PM 1927 Appendix A, p. 385),
(The "stroke" is Sheffer's inconvenient logical NAND that Russell adopted for the 2nd edition—a single logical function that replaces logical OR and logical NOT).
The net result, though, was a collapse of his theory. Russell arrived at this disheartening conclusion: that "the theory of ordinals and cardinals survives . . . but irrationals, and real numbers generally, can no longer be adequately dealt with. . . .Perhaps some further axiom, less objectionable than the axiom of reducibility, might give these results, but we have not succeeded in finding such an axiom." (PM 1927:xiv).
Gödel 1944 agrees that Russell's logicist project was stymied; he seems to disagree that even the integers survived:
 "[In the second edition] The axiom of reducibility is dropped, and it is stated explicitly that all primitive predicates belong to the lowest type and that the only purpose of variables (and evidently also of constants) of higher orders and types is to make it possible to assert more complicated truthfunctions of atomic propositions" (Gödel 1944 in Collected Works:134).
Gödel asserts, however, that this procedure seems to presuppose arithmetic in some form or other (p. 134). He deduces that "one obtains integers of different orders" (p. 134135); the proof in Russell 1927 PM Appendix B that "the integers of any order higher than 5 are the same as those of order 5" is "not conclusive" and "the question whether (or to what extent) the theory of integers can be obtained on the basis of the ramified hierarchy [classes plus types] must be considered as unsolved at the present time". Gödel concluded that it wouldn't matter anyway because propositional functions of order n (any n) must be described by finite combinations of symbols (cf all quotes and content derived from page 135).
Gödel's criticism and suggestions
Gödel in his 1944 bores down to the exact place where Russell's logicism fails and offers a few suggestions to rectify the problems. He submits the "vicious circle principle" to reexamination, tearing it apart into three phrases "definable only in terms of", "involving" and "presupposing". It is the first clause that "makes impredicative definitions impossible and thereby destroys the derivation of mathematics from logic, effected by Dedekind and Frege, and a good deal of mathematics itself". Since, he argues, mathematics is doing quite well, thank you, with its various inherent impredicativities (e.g. "real numbers defined by reference to all real numbers"), he concludes that what he has offered is "a proof that the vicious circle principle is false [rather] than that classical mathematics is false" (all quotes Gödel 1944:127).
Russell's noclass theory is the root of the problem: Gödel believes that impredicativity is not "absurd", as it appears throughout mathematics. Where Russell's problem derives from is the "constructivistic (or nominalistic^{[25]}) standpoint toward the objects of logic and mathematics, in particular toward propositions, classes, and notions . . . a notion being a symbol . . . so that a separate object denoted by the symbol appears as a mere fiction" (p. 128).
Indeed, this "no class" theory of Russell, Gödel concludes:
 "is of great interest as one of the few examples, carried out in detail, of the tendency to eliminate assumptions about the existence of objects outside the "data" and to replace them by constructions on the basis of these data^{33}. [^{33} The "data" are to understand in a relative sense here; i.e. in our case as logic without the assumption of the existence of classes and concepts]. The result has been in this case essentially negative; i.e. the classes and concepts introduced in this way do not have all the properties required from their use in mathematics. . . . All this is only a verification of the view defended above that logic and mathematics (just as physics) are built up on axioms with a real content which cannot be explained away" (p. 132)
He concludes his essay with the following suggestions and observations:
 "One should take a more conservative course, such as would consist in trying to make the meaning of terms "class" and "concept" clearer, and to set up a consisent theory of classes and concepts as objectively existing entities. This is the course which the actual development of mathematical logic has been taking and which Russell himself has been forced to enter upon in the more constructive parts of his work. Major among the attempts in this direction . . . are the simple theory of types . . . and axiomatic set theory, both of which have been successful at least to this extent, that they permit the derivation of modern mathematics and at the same time avoid all known paradoxes . . . ¶ It seems reasonable to suspect that it is this incomplete understanding of the foundations which is responsible for the fact that mathematical logic has up to now remained so far behind the high expectations of Peano and others . . .."(p. 140)
Neologicism
Neologicism describes a range of views claiming to be the successor of the original logicist program.^{[26]} More narrowly, it is defined as attempts to resurrect Frege's programme through the use of Hume's Principle.^{[27]} Two of the major proponents of neologicism are Crispin Wright and Bob Hale.^{[28]}
See also
 Nominalism
 Mathematical fictionalism
Notes
 ^ Logicism
 ^ Principia Mathematica entry in the Stanford Encyclopedia of Philosophy.
 ^ The exact quote from Russell 1919 is the following: "It is time now to turn to the considerations which make it necessary to advance beyond the standpoint of Peano, who represents the last perfection of the "arithetisation" of mathematics, to that of Frege, who first succeeded in "logicising" mathematics, i.e. in reducing to logic the arithmetical notions which his predecessors had shown to be sufficient for mathematics" (Russell 1919/2005:17).
 ^ Perry in his 1997 Introduction to Russell 1912:ix)
 ^ Cf Russell 1912:74.
 ^ "It must be admitted . . . that logical principles are known to us, and cannot be themselves proved by experience, since all proof presupposes them. In this, therefore . . . the rationalists were in the right" (Russell 1912:74).
 ^ "Nothing can be known to exist except by the help of experience" (Russell 1912:74).
 ^ cf The Philosophy of Mathematics and Hilbert’s Proof Theory 1930:1931 in Mancosu p. 242.
 ^ In his 1903 and in PM Russell refers to such assumptions (there are others) as "primitive propositions" ("pp" as opposed to "axioms" (there are some of those, too). But the reader is never certain whether these pp are axioms/axiomschemas or constructiondevices (like substitution or modus ponens), or what, exactly. Gödel 1944:120 comments on this absence of formal syntax and the absence of a clearlyspecified substitution process.
 ^ To be precise both childname = variable x and family name Fn are variables. Childname 's domain is "all childnames in this and every other possible world", and family name Fn has a domain over the 12 families on the street.
 ^ “If the predicates are partitioned into classes with respect to equinumerosity in such a way that all predicates of a class are equinumerous to one another and predicates of different classes are not equinumerous, then each such class represents the Number, which applies to the predicates that belong to it” (Bernays 19301 in Mancosu 1998:240.
 ^ section 487ff (pages 513ff in the Appendix A).
 ^ Cf sections 487ff (pages 513ff in the Appendix A).
 ^ Whether or not the null class ┊ ┊┊ ┊┊ ┊ is reducible to ┊ ┊┊ ┊ is unclear; the conclusion is not important for this example.
 ^ 1909 Appendix A
 ^ 1903:133ff, Section 130: “Numerical Conjunction” and plurality”.
 ^ Russell deemed Wiener "the infant phenomenon . . . more infant than phenomenon; see Russell's confrontation with Weiner in GrattanGuiness 2000:419ff.
 ^ See van Heijenoort's commentary and Norbert Wiener's 1914 A simplification of the logic of relations in van Heijenoort 1967:224ff.
 ^ Zermelo 1908 in van Heijenoort 1967:190. See the discussion of this very quotation in Mancosu 1998:68.
 ^ This same definition appears also in Kleene 1952:42.
 ^ An excellent source for details is Fairouz Kamareddine, Twan Laan and Rob Nderpelt, 2004, A Modern Perspective on Type Theory, From its Origins Until Today, Kluwer Academic Publishers, Dordrecht, The Netherlands, ISBN. They give a demonsration of how to create the paradox (pages 1–2), as follows: Define an aggregate/class/set y this way: ∃y∀x[ x ε y ↔ Φ(x)]. (This says: There exists a class y such that for ANY input x, x is an element of set y if and only if x satisfies the given function Φ.) Note that (i) input x is unrestricted as to the "type" of thing that it can be (it can be a thing, or a class), and (ii) function Φ is unrestricted as well. Pick the following tricky function Φ(x) = ¬(x ε x). (This says: Φ(x) is satsified when x is NOT an element of x)). Because y (a class) is also "unrestricted" we can plug "y" in as input: ∃y[ y ε y ↔ ¬(y ε y)]. This says that "there exists a class y that is an element of itself only if it is NOT and element of itself. That is the paradox.
 ^ Russell's letter to Frege announcing the "disovery", and Frege's letter back to Russell in sad response, together with commentary, can be found in van Heijenoort 1967:124128. Zermelo in his 1908 claimed priority to the discovery; cf footnote 9 on page 191 in van Heijenoort.
 ^ van Heijenoort 1967:3 and pages 124128
 ^ "The axiom of reducibility is the assumption that, given any function φẑ, there is a formally equivalent, predicative function, i.e. there is a predicative function which is true when φz is true and false when φz is false. In symbols, the axiom is: ⊦ :(∃ψ) : φz. ≡_{z} .ψ!z." (PM 1913/1962 edition:56, the original uses x with a circumflex). Here φẑ indicates the function with variable ẑ, i.e. φ(x) where x is argument "z"; φz indicates the value of the function given argument "z"; ≡_{z} indicates "equivalence for all z"; ψ!z indicates a predicative function, i.e. one with no variables except individuals.
 ^ Perry observes that Plato and Russell are "enthusiastic" about "universals", then in the next sentence writes: " 'Nominalists' think that all that particulars really have in common are the words we apply to them"(Perry in his 1997 Introduction to Russell 1912:xi). Perry adds that while your sweatshirt and mine are different objects generalized by the word "sweatshirt", you have a relation to yours and I have a relation to mine. And Russell "treated relations on par with other universals" (p. xii). But Gödel is saying that Russell's "noclass" theory denies the numbers the status of "universals".
 ^ What is Neologicism?
 ^ PHIL 30067: Logicism and NeoLogicism
 ^ http://www.standrews.ac.uk/~mr30/papers/EbertRossbergPurpose.pdf
Annotated Bibliography
 Richard Dedekind, circa 1858, 1878, Essays on the Theory of Numbers, English translation published by Open Court Publishing Company 1901, Dover publication 1963, Mineola, NY, ISBN 0486210103. Contains two essays—I. Continuity and Irrational Numbers with original Preface, II. The Nature and Meaning of Numbers with two Prefaces (1887,1893).
 Howard Eves, 1990, Foundations and Fundamental Concepts of Mathematics Third Edition, Dover Publications, Inc, Mineola, NY, ISBN 048669609X.
 I. GrattanGuinness, 2000, The Search for Mathematical Roots, 18701940: Logics, Set Theories and The Foundations of Mathematics from Cantor Through Russell to Gödel, Princiton University Press, Princeton NJ, ISBN 069105858X.
 Jean van Heijenoort, 1967, From Frege to Gödel: A Source Book in Mathematical Logic, 18791931, 3rd printing 1976, Harvard University Press, Cambridge, MA, ISBN 0674324498. Includes Frege's 1879 Begriffsschrift with commentary by van Heijenoort, Russell's 1908 Mathematical logic as based on the theory of types with commentary by Willard V. Quine, Zermelo's 1908 A new proof of the possibility of a wellordering with commentary by van Heijenoort, letters to Frege from Russell and from Russel to Frege, etc.
 Stephen C. Kleene, 1971, 1952, Introduction To Metamathematics 1991 10th impression,, NorthHolland Publishing Company, Amsterdam, NY, ISBN 0 7204 2103 9.
 Mario Livio August 2011 "Why Math Works: Is math invented or discovered? A leading astrophysicist suggests that the answer to the millenniaold question is both", Scientific American (ISSN 00368733), Volume 305, Number 2, August 2011, Scientific American division of Nature America, Inc, New York, NY.
 Bertrand Russell, 1903, The Principles of Mathematics Vol. I, Cambridge: at the University Press, Cambridge, UK.
 Paolo Mancosu, 1998, From Brouwer to Hilbert: The Debate on the Foundations of Mathematics in the 1920s, Oxford University Press, New York, NY, ISBN 0195096320.
 Bertrand Russell, 1912, The Problems of Philosophy (with Introduction by John Perry 1997), Oxford University Press, New York, NY, ISBN 019511552X.
 Bertrand Russell, 1919, Introduction to Mathematical Philosophy, Barnes & Noble, Inc, New York, NY, eISBN 1411329427. This is a nonmathematical companion to Principia Mathematica.

 Amit Hagar 2005 Introduction to Bertrand Russell, 1919, Introduction to Mathematical Philosophy, Barnes & Noble, Inc, New York, NY, eISBN 1411329427.

 Albert North Whitehead and Bertrand Russell, 1927 2nd edition, (first edition 19101913), Principia Mathematica to *56,1962 Edition, Cambridge at the University Press, Cambridge UK, no ISBN. Second edition, abridged to *56, with Introduction to the Second Edition pages Xiiixlvi, and new Appendix A (*8 Propositions Containing Apparent Variables) to replace *9 Theory of Apparent Variables, and Appendix C TruthFunctions and Others.
External links
Categories: Theories of deduction
 Philosophical schools and traditions
Wikimedia Foundation. 2010.