HISTORY OF LOGIC BY JOHN NAGUIB. What is Logic? The science or study of how to evaluate arguments and reasoning. “Logic is new and necessary reasoning”

Slides:



Advertisements
Similar presentations
Automata Theory CS 3313 Chapter 1 An overview of Automata Theory.
Advertisements

Brief Introduction to Logic. Outline Historical View Propositional Logic : Syntax Propositional Logic : Semantics Satisfiability Natural Deduction : Proofs.
INTRODUCTION LOGICAL OPERATIONS TRUTH TABLE AND RULES.
What kind of mp3 player do mathematicians use?
Set Theory BY Miss Manita Modphai. ©1999 Indiana University Trustees Why Study Set Theory? Understanding set theory helps people to … see things in terms.
REPRESENTAÇÃO DO CONHECIMENTO Terças – 13 hs – sala 512 RDC.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Instructor: Hayk Melikya
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Analytic Philosophy. Logic and the dream of a precise and unambiguous language Leibniz and the Characteristica universalis and the Calculus ratiocinator.
Philosophy 103 Linguistics 103 Yet, still, Even further More and yet more, etc., ad infinitum, Introductory Logic: Critical Thinking Dr. Robert Barnard.
Decision Modeling Using Boolean Algebra in Spreadsheets Bryan Barney Reagan, Ph.D. Saint Leo University.
From Kant To Turing He Sun Max Planck Institute for Informatics.
February 11, 2015CS21 Lecture 161 CS21 Decidability and Tractability Lecture 16 February 11, 2015.
CS1001 Lecture 22. Overview Mechanizing Reasoning Mechanizing Reasoning G ö del ’ s Incompleteness Theorem G ö del ’ s Incompleteness Theorem.
Logic and Set Theory.
Proofs are Programs: 19th Century Logic and 21st Century Computing CS 510: Programming Languages (a talk adapted from Philip Wadler)
Gödel’s Incompleteness Theorem and the Birth of the Computer Christos H. Papadimitriou UC Berkeley.
Computability and Complexity 10-1 Computability and Complexity Andrei Bulatov Gödel’s Incompleteness Theorem.
Lecture 24: Gödel’s Proof CS150: Computer Science
Computability Thank you for staying close to me!! Learning and thinking More algorithms... computability.
The Arithmetic of Reasoning: Logic and Boolean Algebra -Jeff Johnson -Mike Grassel.
Mathematical Explanations and Arguments Number Theory for Elementary School Teachers: Chapter 1 by Christina Dionne Number Theory for Elementary School.
Class 36: Proofs about Unprovability David Evans University of Virginia cs1120.
Chapter 2 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
David Evans CS200: Computer Science University of Virginia Computer Science Class 24: Gödel’s Theorem.
Mathematician, Logician, and Philosopher. Mr.Frege was Born 1848 in Wismar, Mecklenburg- Schwerin. Mr.Frege was Born 1848 in Wismar, Mecklenburg- Schwerin.
Logic in Computer Science - Overview Sep 1, 2011 POSTECH 박성우.
Lambda Calculus History and Syntax. History The lambda calculus is a formal system designed to investigate function definition, function application and.
1 Concepts of Programming Languages TK 327, Fall 2015 MW 2:00 PM – 3:15 PM STV 104 Instructor:Dr. Chung-Chih Li Home page of the Class.
Logic. Mathematical logic is a subfield of mathematics exploring the applications of formal logic to mathematics. Topically, mathematical logic bears.
The Recursion Theorem Pages 217– ADVANCED TOPICS IN C O M P U T A B I L I T Y THEORY.
Propositional Logic Dr. Rogelio Dávila Pérez Profesor-Investigador División de Posgrado Universidad Autónoma Guadalajara
Copyright © Curt Hill Mathematical Logic An Introduction.
Lecture 18. Unsolvability Before the 1930’s, mathematics was not like today. Then people believed that “everything true must be provable”. (More formally,
CS 345: Chapter 8 Noncomputability and Undecidability Or Sometimes You Can’t Get It Done At All.
Course Overview and Road Map Computability and Logic.
نظریه زبان ها و ماشین ها فصل صفر - مقدمه دانشگاه صنعتی شریف نیمسال دوّم سال تحصیلی 8713.
Overview.  Explores the theoretical foundations of computing  What can and cannot be done by an algorithm  Most of the material predates computers!
History of Computing. Where did it start? Abucus 500 B.C. The abacus was first used by the Babylonians as an aid to simple arithmetic at sometime around.
CompSci 102 Discrete Math for Computer Science
Logic Seminar 1 Introduction Slobodan Petrović.
History 398 Fall 2004 History 398Lecture 20 FROM ENIAC TO EDVAC.
Thinking in Methodologies Class Notes. Gödel’s Theorem.
Artificial Intelligence “Introduction to Formal Logic” Jennifer J. Burg Department of Mathematics and Computer Science.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
T. Gregory BandyInteraction Machines SeminarFebruary 21, Union College - Computer Science Graduate Program Interaction Machines Are they more.
Sets and Size Basic Question: Compare the “size” of sets. First distinction finite or infinite. –What is a finite set? –How can one compare finite sets?
Spring, 2011 –– Computational Thinking – Dennis Kafura – CS 2984 Lambda Calculus Introduction.
Mr. Cervone. History of Logic - Aristotle Aristotle Greek philosopher 384 BC – 322 BC Born in Stageira, Chalcidice (Thessaloniki – Greece) Studied at.
GST 113: LOGIC, PHILOSOPHY AND HUMAN EXISTECE
The History Of Calculus
Marlee Mines.  Logic is more focused on deductive reasoning and proof.  Personally, I really thought that for math, logic was kind of fun. I liked that.
GEORGE BOOLE by 3B s.i.a Boole was born in 1815 in the English industrial town of Lincoln. George Boole's father was a tradesman in Lincoln.
A historical introduction to the philosophy of mathematics
Chapter 0: Introduction
Introduction to formal languages and automata
Computable Functions.
Maths symbols I_ Arithmetic symbols II_ Plus and minus
Maths symbols I_ Arithmetic symbols II_ Plus and minus
Gottfried Wilhelm von Leibniz
methods and simple tools e.g., abacus
Lecture 2 Propositional Logic
methods and simple tools e.g., abacus
Lecture 22: Gödel’s Theorem CS200: Computer Science
On Kripke’s Alleged Proof of Church-Turing Thesis
Proofs are Programs: 19th Century Logic and 21st Century Computing
Abstract Algebra.
Logic of Informatics Introduction.
An example of the “axiomatic approach” from geometry
Presentation transcript:

HISTORY OF LOGIC BY JOHN NAGUIB

What is Logic? The science or study of how to evaluate arguments and reasoning. “Logic is new and necessary reasoning” -Aristotle Studied within – Philosophy – Mathematics – Computer Science

When did it start?? A very long time ago… It started with Aristotle (the father of Logic), around 335 BC …

Other Logic Logic in India - Formal Logic started independently in India and continued to develop to early modern times. – It started in the 6 th Century BC by Medhatithi Gautama.

Islamic Logicians Al Farabi (872 – 950/951) Ibn Rushd Ibn Sina

The first who created systematic criteria for doing it. His conception of remains a cornerstone of the study of logic even today. Aristotle the father of logic

In the early 1 st Century AD, Aristotle’s logical works were compiled into 6 books (the Organon) They changed a bit through time because of Commentaries on Aristotle by his pupils

Modern Logic Periods 1500 Aristotle 350 BC AD Embryonic Period 1940 After WWII 1910 Metamathematical Period Algebraic Period 1850 Logicist Period

Embryonic Logic The beginning of the Modern Logic. Started with Leibniz. Starting of creation of a formalized universal language.

Gottfried Wilhelm Leibniz ( ): – Human reasoning could be reduced to calculations of a sort, and that such calculations could resolve many differences of opinion. – Leibniz enunciated the principal properties of what we now call conjunction, disjunction and negation. – All our complex ideas are compounded from a small number of simple ideas

Algebraic Period Originating with Boole. Algebraic formulae can be used to express logical relations. The introduction of De Morgan’s Laws. Venn Diagrams.

George Boole ( ): - Invented Boolean Logic - Provided a general symbolic method of logical inference

Augustus De Morgan (1806 – 1871): – He formulated De Morgan’s laws which are, The negation of a conjunction is the disjunction of the negations. The negation of a disjunction is the conjunction of the negations.

John Venn ( ): – Introduced the Venn diagram which is used in probability, logic, computer science and other fields. U A B A ∩ B

The Logicist Period The next great advances were made by the German mathematician Gottlob Frege. Axiomatic Predicate Logic. Problem of Multiple Generality is solved. Russell’s Paradox.

Gottlob Frege (1848 – 1925): – Considered to be the father of Analytic Philosophy. – His Objective was demonstrating that arithmetic is identical with logic. – He invented axiomatic predicate logic and quantified variables, which solved the problem of multiple generality. The Logicist Period

Bertrand Russell ( ): – He is widely held to be one of the 20th century's premier logicians. – Russell’s Paradox: If the "List of all lists that do not contain themselves" contains itself, then it does not belong to itself and should be removed. However, if it does not list itself, then it should be added to itself.

Ludwig Wittgenstein (1889 – 1951): – In his lifetime, he published just one book review, one article, a children's dictionary, and the 75-page Tractatus Logico-Philosophicus (1921) Tractatus Logico-Philosophicus – One of the most influential philosophers of the 20 th Century.

Metamathematical Period The names of Gödel and Tarski dominate the 1930s, a crucial period in the development of metamathematicsGödelTarskimetamathematics The study of mathematics using mathematical methods to produce Metatheories. Alonzo Church and Alan Turing give negative solutions to Hilbert’s Entsheidungsproblem.

Kurt Gödel: – Gödel Completeness Theorem: first-order sentence is deducible if and only if it is logically valid.first-order sentence deducible – Gödel's Incompleteness theorems

Alan Turing (1912 – 1954): – Introduced the concept of ordinal logic and the notion of relative computing.ordinal logicrelative computing – Turing Machine. – Turing test for Artificial Intelligence.

What happened after the World War II to Mathematical Logic? Mathematical Logic Model Theory Proof Theory Computability Theory Set Theory

Set theory is the branch of mathematics that studies sets, which are collections of objectsmathematicssets The modern study of set theory was initiated by Georg Cantor and Richard Dedekind in the 1870sGeorg CantorRichard Dedekind

Computability Theory Computability theory had its roots in the work of Turing, Church, Kleene, and Post in the 1930s and 40s. Developed to Recursion. Computation Complexity Theory, was also characterized in logical terms as a result of investigations into descriptive complexity.

Model Theory Is the study of mathematical Structures using tools from Mathematical Logic. Intersection between Mathematics, Philosophy, and Computer Science. Gödel's Incompleteness Theorem. The upward and downward Löwenheim-Skolem Theorems.

Proof Theory Branch of Mathematical Logic. Modern Proof theory established by David Hilbert.

Thank You