This is a list of the notation used in Alfred North Whitehead and Bertrand Russell's Principia Mathematica (1910–1913).
The second (but not the first) edition of Volume I has a list of notation used at the end.
This is a glossary of some of the technical terms in Principia Mathematica that are no longer widely used or whose meaning has changed.
Symbol | Approximate meaning | Reference | ||
---|---|---|---|---|
✸ | Indicates that the following number is a reference to some proposition | |||
α,β,γ,δ,λ,κ, μ | Classes | Chapter I page 5 | ||
f,g,θ,φ,χ,ψ | Variable functions (though θ is later redefined as the order type of the reals) | Chapter I page 5 | ||
a,b,c,w,x,y,z | Variables | Chapter I page 5 | ||
p,q,r | Variable propositions (though the meaning of p changes after section 40). | Chapter I page 5 | ||
P,Q,R,S,T,U | Relations | Chapter I page 5 | ||
. : :. :: | Dots used to indicate how expressions should be bracketed, and also used for logical "and". | Chapter I, Page 10 | ||
\hatx | Indicates (roughly) that x is a bound variable used to define a function. Can also mean (roughly) "the set of x such that...". | Chapter I, page 15 | ||
! | Indicates that a function preceding it is first order | Chapter II.V | ||
⊦ | Assertion: it is true that |
| ||
~ | Not |
| ||
∨ | Or |
| ||
⊃ | (A modification of Peano's symbol Ɔ.) Implies |
| ||
= | Equality |
| ||
Df | Definition |
| ||
Pp | Primitive proposition |
| ||
Dem. | Short for "Demonstration" |
| ||
. | Logical and |
| ||
p⊃q⊃r | p⊃q and q⊃r |
| ||
≡ | Is equivalent to |
| ||
p≡q≡r | p≡q and q≡r |
| ||
Hp | Short for "Hypothesis" |
| ||
(x) | For all x This may also be used with several variables as in 11.01. |
| ||
(∃x) | There exists an x such that. This may also be used with several variables as in 11.03. |
| ||
≡x, ⊃x | The subscript x is an abbreviation meaning that the equivalence or implication holds for all x. This may also be used with several variables. |
| ||
= | x=y means x is identical with y in the sense that they have the same properties |
| ||
≠ | Not identical |
| ||
x=y=z | x=y and y=z |
| ||
℩ | This is an upside-down iota (unicode U+2129). ℩x means roughly "the unique x such that...." |
| ||
[] | The scope indicator for definite descriptions. |
| ||
E! | There exists a unique... |
| ||
ε | A Greek epsilon, abbreviating the Greek word ἐστί meaning "is". It is used to mean "is a member of" or "is a" |
| ||
Cls | Short for "Class". The 2-class of all classes |
| ||
, | Abbreviation used when several variables have the same property |
| ||
~ε | Is not a member of |
| ||
Prop | Short for "Proposition" (usually the proposition that one is trying to prove). | Note before *2.17 | ||
Rel | The class of relations |
| ||
⊂ ⪽ | Is a subset of (with a dot for relations) |
| ||
∩ ⩀ | Intersection (with a dot for relations). α∩β∩γ is defined to be (α∩β)∩γ and so on. |
| ||
∪ ⨄ | Union (with a dot for relations) α∪β∪γ is defined to be (α∪β)∪γ and so on. | 22.03, *22.71, *23.03, *23.71 | ||
− ∸ | Complement of a class or difference of two classes (with a dot for relations) |
| ||
V ⩒ | The universal class (with a dot for relations) |
| ||
Λ ⩑ | The null or empty class (with a dot for relations) | 24.02 | ||
∃! | The following class is non-empty |
| ||
‘ | R ‘ y means the unique x such that xRy |
| ||
Cnv | Short for converse. The converse relation between relations |
| ||
Ř | The converse of a relation R |
| ||
\overrightarrow{R} | A relation such that x\overrightarrow{R}z y\overrightarrow{R}z |
| ||
\overleftarrow{R} | Similar to \overrightarrow{R} |
| ||
sg | Short for "sagitta" (Latin for arrow). The relation between \overrightarrow{R} |
| ||
gs | Reversal of sg. The relation between \overleftarrow{R} | 32.04 | ||
D | Domain of a relation (αDR means α is the domain of R). |
| ||
D | (Upside down D) Codomain of a relation |
| ||
C | (Initial letter of the word "campus", Latin for "field".) The field of a relation, the union of its domain and codomain |
| ||
F | The relation indicating that something is in the field of a relation |
| ||
The composition of two relations. Also used for the Sheffer stroke in *8 appendix A of the second edition. |
| |||
R2, R3 | Rn is the composition of R with itself n times. |
| ||
\upharpoonleft | \alpha\upharpoonleftR |
| ||
\upharpoonright | R\upharpoonright\alpha |
| ||
\uparrow | Roughly a product of two sets, or rather the corresponding relation |
| ||
⥏ | P⥏α means \alpha\upharpoonleftP\upharpoonright\alpha |
| ||
“ | (Double open quotation marks.) R“α is the domain of a relation R restricted to a class α |
| ||
Rε | αRεβ means "α is the domain of R restricted to β" |
| ||
‘‘‘ | (Triple open quotation marks.) αR‘‘‘κ means "α is the domain of R restricted to some element of κ" |
| ||
E! | Means roughly that a relation is a function when restricted to a certain class |
| ||
♀ | A generic symbol standing for any functional sign or relation |
| ||
” | Double closing quotation mark placed below a function of 2 variables changes it to a related class-valued function. |
| ||
p | The intersection of the classes in a class. (The meaning of p changes here: before section 40 p is a propositional variable.) |
| ||
s | The union of the classes in a class |
| ||
R | S applies R to the left and S to the right of a relation |
| ||
I | The equality relation |
| ||
J | The inequality relation |
| ||
ι | Greek iota. Takes a class x to the class whose only element is x. |
| ||
1 | The class of classes with one element |
| ||
0 | The class whose only element is the empty class. With a subscript r it is the class containing the empty relation. |
| ||
2 | The class of classes with two elements. With a dot over it, it is the class of ordered pairs. With the subscript r it is the class of unequal ordered pairs. |
| ||
\downarrow | An ordered pair |
| ||
Cl | Short for "class". The powerset relation |
| ||
Cl ex | The relation saying that one class is the set of non-empty classes of another |
| ||
Cls2, Cls3 | The class of classes, and the class of classes of classes |
| ||
Rl | Same as Cl, but for relations rather than classes |
| ||
ε | The membership relation |
| ||
t | The type of something, in other words the largest class containing it. t may also have further subscripts and superscripts. |
| ||
t0 | The type of the members of something |
| ||
αx | the elements of α with the same type as x |
| ||
α(x) | The elements of α with the type of the type of x. |
| ||
→ | α→β is the class of relations such that the domain of any element is in α and the codomain is in β. |
| ||
Short for "similar". The class of bijections between two classes |
| |||
sm | Similarity: the relation that two classes have a bijection between them |
| ||
PΔ | λPΔκ means that λ is a selection function for P restricted to κ |
| ||
excl | Refers to various classes being disjoint |
| ||
↧ | P↧x is the subrelation of P of ordered pairs in P whose second term is x. |
| ||
Rel Mult | The class of multipliable relations |
| ||
Cls2 Mult | The multipliable classes of classes |
| ||
Mult ax | The multiplicative axiom, a form of the axiom of choice |
| ||
R* | The transitive closure of the relation R |
| ||
Rst, Rts | Relations saying that one relation is a positive power of R times another |
| ||
Pot | (Short for the Latin word "potentia" meaning power.) The positive powers of a relation |
| ||
Potid | ("Pot" for "potentia" + "id" for "identity".) The positive or zero powers of a relation |
| ||
Rpo | The union of the positive power of R |
| ||
B | Stands for "Begins". Something is in the domain but not the range of a relation |
| ||
min, max | used to mean that something is a minimal or maximal element of some class with respect to some relation |
| ||
gen | The generations of a relation |
| ||
✸ | P✸Q is a relation corresponding to the operation of applying P to the left and Q to the right of a relation. This meaning is only used in *95 and the symbol is defined differently in *257. |
| ||
Dft | Temporary definition (followed by the section it is used in). |
| ||
IR,JR | Certain subsets of the images of an element under repeatedly applying a function R. Only used in *96. |
| ||
\overleftrightarrow{R} | The class of ancestors and descendants of an element under a relation R |
|
Symbol | Approximate meaning | Reference | |
---|---|---|---|
Nc | The cardinal number of a class |
| |
NC | The class of cardinal numbers |
| |
μ(1) | For a cardinal μ, this is the same cardinal in the next higher type. |
| |
μ(1) | For a cardinal μ, this is the same cardinal in the next lower type. |
| |
+ | The disjoint union of two classes |
| |
+c | The sum of two cardinals |
| |
Crp | Short for "correspondence". |
| |
ς | (A Greek sigma used at the end of a word.) The series of segments of a series; essentially the completion of a totally ordered set |
|
Symbol | Approximate meaning | Reference | |
---|---|---|---|
Bord | Abbreviation of "bene ordinata" (Latin for "well-ordered"), the class of well-founded relations |
| |
Ω | The class of well ordered relations[1] | 250.02 |