Egyptian, Babilonian mathematics: procedures, no proofs, no general theorems. No distinction between exact and approximative calculation. Classical literature:

Slides:



Advertisements
Similar presentations
With examples from Number Theory
Advertisements

Discrete Math Methods of proof 1.
Introduction to Proofs
Chapter 3 Elementary Number Theory and Methods of Proof.
Mathematical induction Isaac Fung. Announcement ► Homework 1 released ► Due on 6 Oct 2008 (in class)
1 Logic Logic in general is a subfield of philosophy and its development is credited to ancient Greeks. Symbolic or mathematical logic is used in AI. In.
Euclid’s Plane Geometry Logical Proofs & Logical Thought.
Copyright © Cengage Learning. All rights reserved.
Math 409/409G History of Mathematics Books III of the Elements Circles.
Whiteboardmaths.com © 2004 All rights reserved
Induction and recursion
CS1001 Lecture 22. Overview Mechanizing Reasoning Mechanizing Reasoning G ö del ’ s Incompleteness Theorem G ö del ’ s Incompleteness Theorem.
Logic and Set Theory.
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
So far we have learned about:
First Order Logic (chapter 2 of the book) Lecture 3: Sep 14.
TR1413: Discrete Mathematics For Computer Science Lecture 1: Mathematical System.
Discrete Mathematics and its Applications
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
Greek Mathematics Period (600 B.C.-A.D. 500)
By: Darion Keyes. Nothing is known about Euclid’s life except what the Greek philosopher Proclus said in his reports “summary” of famous Greek mathematicians.
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
By: Ines Burazin Tomislav Haršanji Igor Sušić Matea Ugrica
To construct a logical argument using algebraic properties
WARM UP EXERCSE Consider the right triangle below with M the midpoint of the hypotenuse. Is MA = MC? Why or why not? MC B A 1.
Egyptian and Babylonian Period (2000 B.C B.C.) Introduction to early numeral systems Simple arithmetic Practical geometry Decimal and Sexagesimal.
TaK “This was one of the great events of my life, as dazzling as first love. I had not imagined that there was anything so delicious in the world” Bertrand.
Copyright © Peter Cappello Mathematical Induction Goals Explain & illustrate construction of proofs of a variety of theorems using mathematical induction.
MATH 224 – Discrete Mathematics
Michelle Huchette Block 2. * Greek * From Alexandria, taught mathematics there * Worked with prepositions and proofs * Created the basis for teachings.
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Mathematics. We tend to think of math as an island of certainty in a vast sea of subjectivity, interpretability and chaos. What is it?
Theorems and conjectures
TOK: Mathematics Unit 1 Day 1. Introduction Opening Question Is math discovered or is it invented? Think about it. Think real hard. Then discuss.
Logic in Computer Science - Overview Sep 1, 2009 박성우.
Math 409/409G History of Mathematics Books X – XIII of the Elements.
Euclid and the “elements”. Euclid (300 BC, 265 BC (?) ) was a Greek mathematician, often referred to as the "Father of Geometry”. Of course this is not.
Math 409/409G History of Mathematics Books VII – IX of the Elements Part 3: Prime Numbers.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.
Chapter 1A God and Science.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
Module #1 - Logic Based on Rosen, Discrete Mathematics & Its Applications. Prepared by (c) , Michael P. Frank. Modified By Mingwu Chen 1 Module.
LECTURE 18 THE COSMOLOGICAL ARGUMENT: ANOTHER ATTEMPT TO PROVE THAT SOME THING NECESSSARILY EXISTS.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Methods of Proof – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Methods of Proof Reading: Kolman, Section 2.3.
Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.
András Máté Department of Logic, ELTE
1 Introduction to Abstract Mathematics Proof Methods , , ~, ,  Instructor: Hayk Melikya Purpose of Section:Most theorems in mathematics.
Mathematical Induction
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Parmenides and the Eleatics Using logic alone to derive startling metaphysical conclusions.
Map of the Greek world c.250 BCE.. Writing (7 th century BCE) Coinage (7 th century BCE) Democracy (c. 510 BCE) Mathematics (c. 585 BCE) ‘Greek inventions’
TOK: Mathematics Unit 1 Day 1. 2 – B 2 = AB – B 2 Factorize both sides: (A+B)(A-B) = B(A-B) Divide both sides by (A-B): A = B = B Since A = B, B+B=B Add.
Deductive Reasoning. Inductive: premise offers support and evidenceInductive: premise offers support and evidence Deductive: premises offers proof that.
Chapter 1 Logic and proofs
A historical introduction to the philosophy of mathematics
Indirect Argument: Two Classical Theorems
Chapter 3 The Real Numbers.
The Problem of Evil.
Lecture 22: Gödel’s Theorem CS200: Computer Science
Copyright © Cengage Learning. All rights reserved.
Geometry.
Examples of Mathematical Proof
5.6 Inequalities in Two Triangles and Indirect Proof
Plato Mathematics, dialectics, method
Presentation transcript:

Egyptian, Babilonian mathematics: procedures, no proofs, no general theorems. No distinction between exact and approximative calculation. Classical literature: Neugebauer, The exact sciences in antiquity van der Waerden, Awakening science Early Greek mathematics (6th century B.C., Thales’ time) Convincing by intuitivity Arithmetic of pebbles (pséphoi, calculi): triangle numbers, quadrat numbers, etc. Theorem: if you take a triangle number eight times and add one you get a quadrat number Geometry: general theorems with easy intuitive proof (Thales’ theorem) Sometimes, an exact proof would need Archimedes’ infinitesimal methods The verb of proof: deiknymi, literally „to show”

The „anti-empirical, anti-visual” turn (5th century B.C.): Nothing is accepted as obvious, everything should be proved. Deductive method appears; the first stoikheia Geometry becomes the main area of research The discovery of irrationality (incommensurability) Pythagorean theorem Tetragonalisation problems Hippocrates’ lunulae (little moons) An interesting section of Euclid’ Elements: the theory of odd and even. Book IX (Applications of number theory)

From Prop. 35 on: deep theorems of number theory again. Szabó: Prop is an older enclosure in the text: a pythagorean mathéma. „Visualisation”: perfectly irrelevant, not intuitive at all. (Goes back to manuscripts from the late antiquity.)

Why the turn? Szabó’s question: How mathematics became a deductive science? László Kalmár: „The development of mathematical rigor from intuition to axiomatic method” (1942): a rational reconstruction of history The best maths (creative, beautiful etc.) is the informal, intuitive maths. Why we need to be deductive? To convince others (the sceptics). We must reduce our claims to basic propositions that can be accepted by the other. Szabó: this is the principle of antique dialectics (originated by Zeno of Elea). The turn presupposes that we believe more to logic (to argumentation) than to our eyes. Incommensurability needs indirect proof and cannot be proved on an intuitive way. [?] This is surely true for the proof Aristotle alludes to.

Let us call indirect proof an argument that uses one of the following principles: {A  B;  B}   A [ModusTollens, MT] {A  B; A   B}   A [Consequentia Mirabilis, CM] Indirect hypothesis: A It implies something false (MT) or just a contradiction (CM). Therefore, A is false. Therefore,  A is true. Why is this way of argumentation valid? A plausible argument for MT: A is either true or false. [Principle of Excluded Middle, PEM] If it is true, then B is true, too. [Modus Ponens, MP.] But we know that B is false. And a proposition cannot be true and false at once. [Principle of Contradiction, PC] Therefore, it cannot be the case. Therefore A is false. It seems that both PEM and PC is needed to the validity of indirect proofs.

Milesian cosmogony: explanations to the origin of the world/nature by experience and analogy Criticism: (Parmenides, fr. 7)

Fr. 8, 5-9: [About „what is”, or the Being] It Stucture: (Question = indirect hypothesis) If it was created, it was created from something that which is not. But there is nothing which is not. (*) Therefore, it was not created. All the arguments for the „signs of the Being” have the same structure. They always use something like the premiss (*). Why should we accept it?

Fr. 2 „it is and it cannot not –be” Fr. 7: almost the same But what does it mean?

Four „senses” of the verb of being: 1.Existence predicate 2.Veridic (is the case that …) 3.Copula a)Sign of identity b)Supplement for noun predicates All the four are relevan to the understanding of Parmenides. Each one generates an interpretation and even formalisation of the saying. The expression is elliptic under each interpretation. Neglect the modal expression (‚cannot’). 1. Interpretation: Everything (every thing) exists and there are no non-existents.  xE(x)  x  E(x) A plausible meaning postulate for the existence predicate.