Philosophy of Mathematics (P.O.M): The study of the philosophical concepts and theories which govern mathematics. It is **Realism, in this context, refers especially concerned with the relationship between logic and mathematics, and the to the question of whether concept of realism and how it applies to math as we understand it. [1] mathematical objects are real Elizabeth Kline and Clare Hinds
Logicism: The idea that Intuitionism: The idea that Formalism: The idea that Naturalism: Exists as a sort mathematical concepts are numerical systems, and the mathematical theories and of intermediary between logical concepts rules of math are imagined statements can be intuitionism and classical math and not concrete formalized and proven free ● States that the only possible ● Gottlob Frege used Hume’s Principle of contradictions authorities in math are to formulate his idea ● L.E.J. Brouwer ○ Natural sciences (equinumerosity) [7] ○ Math itself ● Contradiction to classical ● Hilbertian Formalism ○ Combination of the two ● Second Order Logic [1/7] mathematics ● Formalization: axiomatized theory is
expressed using appropriate first ● Often used as an argument for why ● Numbers have qualities that ● Mathematical statement = mental order language intuitionistic math should not differentiate them from other objects construction ● Five types of first order language are replace classical math [7] variables, connectives, equal sign,
● Rejects the idea of infinity and “For all” and “there exist” ● Philosophy is not “better” than ● Hume’s Principle can’t be a ■ Undefined terms science, thus, scientific truths should definition of numbers, neither can ● Rejects non-constructive proofs (no ● Formalizing an axiomatized theory = philosophical truth Frege’s program [7] example for the proof) allows fundamental questions to be
answered mathematically ● Math and science have the strongest ● Russell found the contradiction [1] ● Depends on time ● Avoid accidental contradictions methodologies ● Gödel found the contradiction [6] [2] ● Zermelo and Fraenkel (ZF) set theory-9 axioms [9]
Naive Set Theory and Russell’s Why We Should Care and Further Gödel’s Incompleteness Theorems: Paradox: Questions: ● Knowing the origin of a concept often aids in ● Completeness: within the system, every statement ● Russell’s Paradox appears within naive set theory understanding why the concept works or its negation can be proven [4] ● Has implications in many other branches of math ● Consistency: only a statement or its negation can (set theory, computational math (CM), etc.) be derived, but not both ● Naive Set Theory: Considers the set of all sets, can ● Theorem 1: Consistent (sufficiently complex) be in the set iff it’s not a member of itself [4] ● Our prior knowledge is limited, meaning that a formal systems are incomplete broad topic has many implications whose full ● Theorem 2: Within a consistent (sufficiently ● “Barber Paradox” simplifies the idea impact we cannot quite understand complex) formal system, the [4] ● Vocabulary is also limited for this particular area, consistency of the system thus, deciphering academic sources was difficult cannot be proven within itself ● Game formalism, ZF Set Theory, Gödel & CM ● The set cannot include itself [3] [8]
paulaustinmurphypam.blogspot.com/2014/07/constructivism-intuitionism.html. Accessed 3 May 2021. [8] Raatikainen, Panu, "Gödel’s Incompleteness Theorems", The Stanford Encyclopedia of Philosophy Sources: [1] Horsten, Leon, "Philosophy of Mathematics", The Stanford Encyclopedia of [3] Irvine, Andrew David and Harry Deutsch, "Russell’s Paradox", The Stanford Encyclopedia of [6] Paseau, Alexander, "Naturalism in the Philosophy of Mathematics", The Stanford Encyclopedia of (Spring 2021 Edition), Edward N. Zalta (ed.), Philosophy (Spring 2019 Edition). Edward N. Zalta (ed.), Philosophy (Spring 2021 Edition), Edward N. Zalta (ed.),