Me Talk Good One Day When Language and Logic Fail to Coincide.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Introduction to Proofs
Hypotheticals: The If/Then Form Hypothetical arguments are usually more obvious than categorical ones. A hypothetical argument has an “if/then” pattern.
PROOF BY CONTRADICTION
The Liar and Dialetheism The Liar, the Strengthened Liar Dialetheism: Motivations and Problems Keith Allen Office Hour: Weds (D/140)
Deductive Arguments: Categorical Logic
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
DEDUCTIVE AND INDUCTIVE ARGUMENTS Fundamentals of Logic Unit – 1 Chapter – 4 Fundamentals of Logic Unit – 1 Chapter – 4.
Deductive Validity Truth preserving: The conclusion logically follows from the premises. It is logically impossible for the premises to be true and the.
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 7: Beyond Classical Logic.
Knowledge Representation Methods
Introduction to Ethics Lecture 6 Ayer and Emotivism By David Kelsey.
Logos Formal Logic.
Deduction and Induction
An Introduction to Propositional Logic Translations: Ordinary Language to Propositional Form.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
TR1413: INTRO TO DISCRETE MATHEMATICS LECTURE 2: MATHEMATICAL INDUCTION.
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2.1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
BASIC CONCEPTS OF ARGUMENTS
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
Mathematical Induction
Adapted from Discrete Math
Philosophy 200 unwarranted assumption. Begging the Question This is a form of circular reasoning. Question- begging premises are distinct from their conclusions,
Artificial Intelligence Reasoning. Reasoning is the process of deriving logical conclusions from given facts. Durkin defines reasoning as ‘the process.
Part 2 Module 3 Arguments and deductive reasoning Logic is a formal study of the process of reasoning, or using common sense. Deductive reasoning involves.
1.5 Rules of Inference.
C OURSE : D ISCRETE STRUCTURE CODE : ICS 252 Lecturer: Shamiel Hashim 1 lecturer:Shamiel Hashim second semester Prepared by: amani Omer.
MGF 1107 Mathematics of Social Choice Part 1a – Introduction, Deductive and Inductive Reasoning.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
Time 2 hr No choice 1st six week course will be for the paper (including teasers) The 1st six week outlines attached in form of slides.
Deduction, Validity, Soundness Lecture II – 01/25/11.
March 3, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1Arguments Just like a rule of inference, an argument consists of one or more.
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.
Multiplying Signed Numbers © Math As A Second Language All Rights Reserved next #9 Taking the Fear out of Math ×
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
The Problem of Knowledge 2 Pages Table of Contents Certainty p – Radical doubt p Radical doubt Relativism p Relativism What should.
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 5: Classical Logic.
9.4 Mathematical Induction
Course Overview and Road Map Computability and Logic.
Logic in Everyday Life.
CHAPTER 1 INDUCTIVE AND DEDUCTIVE REASONING. 1.1 – MAKING CONJECTURES A conjecture is a testable expression that is based on available evidence, but is.
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 10 By Herbert I. Gross and Richard A. Medeiros next.
Reading: Chapter 4 (44-59) from the text book
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.
LECTURE 17 THE MODAL ONTOLOGICAL ARGUMENT (A VARIANT OF HARTSHORNE’S VERSION)
Logic UNIT 1.
Propositions and Arguments. What is a proposition? A proposition is a predicative sentence that only contains a subject and a predicate S is P.
Giving good reasons. When listening to others, we cannot concentrate only on our own feelings and reactions We must listen to what they are saying.
Philosophy and Logic The Process of Correct Reasoning.
09/17/07 BR- What is “logic?” What does it mean to make a logical argument? Today: Logic and How to Argue (Part 1)
CS104:Discrete Structures Chapter 2: Proof Techniques.
The Socratic Way. Beginnings Philosophy Philosophy What is it? What is it? It’s hard to say It’s hard to say I’ll approach this obliquely I’ll approach.
What is an argument? An argument is, to quote the Monty Python sketch, "a connected series of statements to establish a definite proposition." Huh? Three.
If then Therefore It is rainingthe ground is wet It is raining the ground is wet.
1 Introduction to Abstract Mathematics Proof Methods , , ~, ,  Instructor: Hayk Melikya Purpose of Section:Most theorems in mathematics.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Text Table of Contents #5: Evaluating the Argument.
The Nature of God Nancy Parsons. Attributes- Nature of God Candidates should be able to demonstrate knowledge and understanding of: 1.God as eternal,
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Chapter 7. Propositional and Predicate Logic
Deductive and Inductive REASONING
Logic programming ( Handbook of Logic in Artificial Intelligence, Vol) by D. M. Gabbay, C. Hogger, J.A. Robinson .
Propositional Logic.
Chapter 7. Propositional and Predicate Logic
CSNB234 ARTIFICIAL INTELLIGENCE
Philosophical Methods
Mathematical Induction
Starting out with formal logic
Presentation transcript:

Me Talk Good One Day When Language and Logic Fail to Coincide

Content and Logic Classic propositional logic has rules expressed in symbols – content is irrelevant. For example, this is a truth table for the conditional, which is of the format “if A then B”.  B is trueB is false A is true A  B is trueA  B is false A is false A  B is true

Content and Logic Classic propositional logic also has rules of deduction. A  B  (A & C)  B For example, if it is true that “If I am happy then I am smiling”, then it is also true that “If I am happy and grass is green then I am smiling”.

Content and Logic This format doesn’t always hold in natural language, because the content of the symbols might cause the deduction to fail. An example: A match is struck  The match will light  A match is struck and the match is wet  The match will light

Presupposition It turns out that this is not a failure of logic in language, but rather an instance of presupposition. This can be thought of as a set of implied assumptions. Natural language lets A  B essentially say the same thing as (A & 1 & 2 &…)  B, and everyone makes the same assumptions about 1, 2, and so on.

Presupposition Therefore, the example of the match deduction was faulty, and would be equivalent to saying (A & C)  B  (A & ~C)  B which is simply not true. The addition of water would contradict one of the unstated assumptions. The rules of logic hold.

Mathematical Induction While it is known that a conclusion reached through ordinary inductive reasoning is not certain, mathematical induction is different. An example: 0 is a natural number, and it is divisible by 1. If natural number n is divisible by 1, so is n+1.  Every natural number is divisible by 1.

The Sorites Paradox The Sorites Paradox is an example of the failure of mathematical induction in natural language. Here is an example: A person with no hairs on his/her head is bald. If a bald person grows a hair on his/her head, he/she is still bald.  No matter how many hairs a person has on his/her head, he/she is bald, so everyone is bald. Obviously, this is false, but the reasoning seems correct.

The Sorites Paradox The reason that the Sorites Paradox occurs in natural language is because of the existence of vague predicates. Words such as bald and poor are only partially defined. (This is not restricted to adjectives. Other vague words are quickly and neighbor.)

Vagueness

Vague predicates also create issues with some of the fundamental rules of classical propositional logic. Here’s Gollum. He’s not really bald, and he’s not really non-bald either.

Vagueness Because bald is only partially defined, it would be wrong to say that Gollum is either bald or non-bald, so ~(b v ~b). People would also agree that it would be correct to say that Gollum is not both bald and non-bald, so ~(b & ~b). But, classical propositional logic says that ~(b & ~b)  b v ~b. This is not the case with Gollum! So, it can be seen that predicates such as bald to not conform to the usual logical rules.

Why Do We Care? This is relevant if one were to try to write a program to analyze the validity of arguments (i.e., in a court case). This is also important for a program to pass the Turing Test.