propositions, and proofs. Definition 1 A point is that which has no part. Definition 2 A line is length without breadth. Definition 3 A surface is that which has length and breadth only. Axiom 5 The whole is greater than the part. 5
it have been postulated to draw a straight-line from any point to any point. 2. To produce a finite straight line continuously in a straight line. 3. To draw a circle with any center and radius. 4. All right-angles are equal to one another. 5. If a straight-line falling across two straight-lines makes internal angles on the same side less than two right-angles, then the two (other) straight-lines, being produced to infinity meet on that side (of the original straight-line) that the (sum of the internal angles) is less than two right-angles (and do not meet on the other side). 6
a point not on it, there is exactly one line parallel to the original line passing through the point. A parallel line and a point 𝑝 not on the line Figure adapted from 「数学の世界史」 10 7
to derive the parallel postulate using the other postulates. ∘ Alhazen (965-1039) and Khayyam (1048 – 1131) explored these investigations. ∘ The Saccheri-Legendre Theorem states that if the parallel postulate is not assumed, then the sum of the angles of a triangle is less than or equal to 180 degrees. ∘ The negation of the parallel postulate does not result in a contradiction with the other postulates. ∘ Lobachevsky (1792-1856) and János Bolyai (1802-1860) independently proposed a system in which multiple parallels exist, leading to a consistent geometry. 8
at exactly two points. Spherical and hyperbolic spaces In spherical geometry, a great circle corresponds to a straight line in Euclidean geometry. Figure adapted from ” はじめての構造主義”9 9
a rethinking of mathematical foundations. ∘ This discovery led mathematicians to realize that mathematics could be constructed on various axiom systems. ∘ Georg Cantor developed set theory as a foundational framework, providing a unified way to handle different mathematical concepts. 11
concepts using only the empty set. 1. Begin with the empty set, denoted by ∅ = {𝑥|𝑥 ≠ 𝑥}. 2. Define the successor function 𝑆(𝑛) = 𝑛 ∪ {𝑛}, which essentially adds one to a number by creating a new set. 3. Define ∅ as 0: 0 = ∅. 4. 1 is defined as 𝑆(0) = {∅}. 5. 2 is 𝑆(1) = {∅, {∅}}. 6. Continue this process to generate all natural numbers. 12
set theory to provide a logical basis for arithmetic. ∘ In ”The Foundations of Arithmetic,” Frege aimed to show that arithmetic truths are derived from logical axioms. ∘ In ”On Sense and Reference,” Frege distinguished between sense and reference. ∘ Terms ”Morning Star” and ”Evening Star” have different senses but share the same reference. Figure adapted from Philosophy for Beginners6 14
inferences was explored even in the 17th century. ∘ Calculus derivatives ∘ The binary number system ∘ Characteristica universalis ∘ A universal system of signs aimed at eliminating natural language ambiguity by developing an ”alphabet of human thoughts” Figures adapted from Philosophy for Beginners6 15
classes of individuals in propositions. ”The Laws of Thought”2 Let us then agree to represent the class of individuals to which a particular name or description is ap- plicable, by a single letter, as x. If the name is “men,” for instance, let x represent “all men,” Figure adapted from ”The Universal Computer: The Road from Leibniz to Turing” 16
as “𝜑 is ” are represented by predicates 𝑃(𝜑), mapping an argument 𝜑 to truth values, and extending propositional logic. ∘ Introduces the universal quantifier ∀ meaning “for any 𝜙,” and the existential quantifier ∃ meaning “there exists 𝑥.” ∘ For example, the statement “Pets at home are either dogs or cats” is represented as ∀𝑥.𝑃(𝑥) → 𝐷(𝑥) ∨ 𝐶(𝑥). ∘ Complex propositions can be expressed as combinations of simpler ones. 18
set theory. 1. Consider the set 𝑅 defined as: 𝑅 = {𝑥 ∣ 𝑥 ∉ 𝑥}, where 𝑅 includes all sets that do not contain themselves. 2. If 𝑅 ∈ 𝑅, then by definition, 𝑅 should not contain itself. 3. If 𝑅 ∉ 𝑅, then according to the definition, 𝑅 must contain itself. 19
𝜖𝑄 ≡ ∀𝑥[𝑃(𝑥) ≡ 𝑄(𝑥)], leads to contradiction. ∘ 𝜖𝑃 denotes the set of elements satisfying predicate 𝑃. ∘ 𝑅 can be expressed as ∃𝑃[𝑥 = 𝜖𝑃 ∧ ¬𝑃(𝑥)] in predicate logic. ∘ Substituting 𝑥 as 𝜖𝑅, we find 𝑅(𝜖𝑅) ≡ ¬𝑅(𝜖𝑅). ∘ In Frege’s work, there is a distinction between objects, predicates, and predicates of predicates. This hierarchy can be seen as an early notion of type theory. 20
Oxford University Press, 2016. [2] George Boole. THE LAWS OF THOUGHT. 1854. URL: https://plato.stanford.edu/entries/settheory-early/. [3] Martin Davis. The Universal Computer: The Road from Leibniz to Turing. CRC Press, 2018. [4] Epistemology of Geometry. 2021. URL: https: //plato.stanford.edu/entries/epistemology-geometry/. [5] Richard Fitzpatrick. EUCLID’S ELEMENTS OF GEOMETRY. 2008. URL: https: //farside.ph.utexas.edu/Books/Euclid/Elements.pdf. 21