Principia Mathematica

1870

The Search for Mathematical Roots 1870–1940, Princeton University Press, Princeton NJ, . Ludwig Wittgenstein (2009), Major Works: Selected Philosophical Writings, HarperrCollins, New York, .

1879

His use of dots as brackets is adopted, and so are many of his symbols" (PM 1927:4). PM changed Peano's Ɔ to ⊃, and also adopted a few of Peano's later symbols, such as ℩ and ι, and Peano's practice of turning letters upside down. PM adopts the assertion sign "⊦" from Frege's 1879 Begriffsschrift: "(I)t may be read 'it is true that'" Thus to assert a proposition p PM writes: "⊦.

From Frege to Gödel: A Source book in Mathematical Logic, 1879–1931, 3rd printing, Harvard University Press, Cambridge MA, . Michel Weber and Will Desmond (eds.) (2008) Handbook of Whiteheadian Process Thought, Frankfurt / Lancaster, Ontos Verlag, Process Thought X1 & X2. == External links == Stanford Encyclopedia of Philosophy: * Principia Mathematica – by A.

1903

PM is not to be confused with Russell's 1903 The Principles of Mathematics.

PM was originally conceived as a sequel volume to Russell's 1903 Principles, but as PM states, this became an unworkable suggestion for practical and philosophical reasons: "The present work was originally intended by us to be comprised in a second volume of Principles of Mathematics...

1910

The Principia Mathematica (often abbreviated PM) is a three-volume work on the foundations of mathematics written by the mathematicians Alfred North Whitehead and Bertrand Russell and published in 1910, 1912, and 1913.

1912

The Principia Mathematica (often abbreviated PM) is a three-volume work on the foundations of mathematics written by the mathematicians Alfred North Whitehead and Bertrand Russell and published in 1910, 1912, and 1913.

1913

The Principia Mathematica (often abbreviated PM) is a three-volume work on the foundations of mathematics written by the mathematicians Alfred North Whitehead and Bertrand Russell and published in 1910, 1912, and 1913.

1918

In particular: : Tractatus Logico-Philosophicus (Vienna 1918), original publication in German). Jean van Heijenoort editor (1967).

1919

Thus, the statement "there are no contradictions in the Principia system" cannot be proven in the Principia system unless there are contradictions in the system (in which case it can be proven both true and false). === Wittgenstein 1919, 1939 === By the second edition of PM, Russell had removed his axiom of reducibility to a new axiom (although he does not state it as such).

Ironically, this change came about as the result of criticism from Wittgenstein in his 1919 Tractatus Logico-Philosophicus.

1925

In 1925–27, it appeared in a second edition with an important Introduction to the Second Edition, an Appendix A that replaced ✸9 and all-new Appendix B and Appendix C.

1927

His use of dots as brackets is adopted, and so are many of his symbols" (PM 1927:4). PM changed Peano's Ɔ to ⊃, and also adopted a few of Peano's later symbols, such as ℩ and ι, and Peano's practice of turning letters upside down. PM adopts the assertion sign "⊦" from Frege's 1879 Begriffsschrift: "(I)t may be read 'it is true that'" Thus to assert a proposition p PM writes: "⊦.

p." (PM 1927:92) (Observe that, as in the original, the left dot is square and of greater size than the period on the right.) Most of the rest of the notation in PM was invented by Whitehead. === An introduction to the notation of "Section A Mathematical Logic" (formulas ✸1–✸5.71) === PM 's dots are used in a manner similar to parentheses.

1930

However, one can ask if some recursively axiomatizable extension of it is complete and consistent. ===Gödel 1930, 1931=== In 1930, Gödel's completeness theorem showed that first-order predicate logic itself was complete in a much weaker sense—that is, any sentence that is unprovable from a given set of axioms must actually be false in some model of the axioms.

1931

However, one can ask if some recursively axiomatizable extension of it is complete and consistent. ===Gödel 1930, 1931=== In 1930, Gödel's completeness theorem showed that first-order predicate logic itself was complete in a much weaker sense—that is, any sentence that is unprovable from a given set of axioms must actually be false in some model of the axioms.

1939

Thus, the statement "there are no contradictions in the Principia system" cannot be proven in the Principia system unless there are contradictions in the system (in which case it can be proven both true and false). === Wittgenstein 1919, 1939 === By the second edition of PM, Russell had removed his axiom of reducibility to a new axiom (although he does not state it as such).

the continuum) cannot be described by the new theory proposed in PM Second Edition. Wittgenstein in his Lectures on the Foundations of Mathematics, Cambridge 1939 criticised Principia on various grounds, such as: It purports to reveal the fundamental basis for arithmetic.

1944

Gödel 1944:126 describes it this way: "This change is connected with the new axiom that functions can occur in propositions only "through their values", i.e., extensionally .

it is chiefly the rule of substitution which would have to be proved" (Gödel 1944:124) ==Contents== ===Part I Mathematical logic.

1962

(PM 1962:11) and logical product defined as p .

(PM 1962:12) Equivalence: Logical equivalence, not arithmetic equivalence: "≡" given as a demonstration of how the symbols are used, i.e., "Thus ' p ≡ q ' stands for '( p ⊃ q ) .

( q ⊃ p )'." (PM 1962:7).

( q ⊃ p ) (PM 1962:12),Notice the appearance of parentheses.

This grammatical usage is not specified and appears sporadically; parentheses do play an important role in symbol strings, however, e.g., the notation "(x)" for the contemporary "∀x". Truth-values: "The 'Truth-value' of a proposition is truth if it is true, and falsehood if it is false" (this phrase is due to Gottlob Frege) (PM 1962:7). Assertion-sign: "'⊦.

The first of these does not necessarily involve the truth either of p or of q, while the second involves the truth of both" (PM 1962:92). Inference: PM 's version of modus ponens.

q ' [in other words, the symbols on the left disappear or can be erased]" (PM 1962:9). The use of dots Definitions: These use the "=" sign with "Df" at the right end. Summary of preceding statements: brief discussion of the primitive ideas "~ p" and "p ∨ q" and "⊦" prefixed to a proposition. Primitive propositions: the axioms or postulates.

Appendix A strengthens the notion of "matrix" or "predicative function" (a "primitive idea", PM 1962:164) and presents four new Primitive propositions as ✸8.1–✸8.13. ✸88.

The one-variable definition is given below as an illustration of the notation (PM 1962:166–167): ✸12.1 ⊢: (Ǝ f): φx .≡x.

f ! x Pp; : Pp is a "Primitive proposition" ("Propositions assumed without proof") (PM 1962:12, i.e., contemporary "axioms"), adding to the 7 defined in section ✸1 (starting with ✸1.1 modus ponens).

(PM 1962:188) ⊢: x ε ẑ(φz) .≡.

(PM 1962:25) At least PM can tell the reader how these fictitious objects behave, because "A class is wholly determinate when its membership is known, that is, there cannot be two different classes having the same membership" (PM 1962:26).

ψx :"This last is the distinguishing characteristic of classes, and justifies us in treating ẑ(ψz) as the class determined by [the function] ψẑ." (PM 1962:188) Perhaps the above can be made clearer by the discussion of classes in Introduction to the Second Edition, which disposes of the Axiom of Reducibility and replaces it with the notion: "All functions of functions are extensional" (PM 1962:xxxix), i.e., φx ≡x ψx .⊃.

(x): ƒ(φẑ) ≡ ƒ(ψẑ) (PM 1962:xxxix) This has the reasonable meaning that "IF for all values of x the truth-values of the functions φ and ψ of x are [logically] equivalent, THEN the function ƒ of a given φẑ and ƒ of ψẑ are [logically] equivalent." PM asserts this is "obvious": "This is obvious, since φ can only occur in ƒ(φẑ) by the substitution of values of φ for p, q, r, ...

(all quotes: PM 1962:xxxix). == Consistency and criticisms == According to Carnap's "Logicist Foundations of Mathematics", Russell wanted a theory that could plausibly be said to derive all of mathematics from purely logical axioms.

Also Cantor's proof that 2n > n breaks down unless n is finite." (PM 2nd edition reprinted 1962:xiv, also cf.

1967

y = b Df. This has the meaning: "The y satisfying φŷ exists," which holds when, and only when φŷ is satisfied by one value of y and by no other value." (PM 1967:173–174) === Introduction to the notation of the theory of classes and relations === The text leaps from section ✸14 directly to the foundational sections ✸20 GENERAL THEORY OF CLASSES and ✸21 GENERAL THEORY OF RELATIONS.




All text is taken from Wikipedia. Text is available under the Creative Commons Attribution-ShareAlike License .

Page generated on 2021-08-05