What is the logic? The primary concern in logic is to identify and classify valid form of inference. The notions of 'validity' ,'form' and 'inference'

Slides:



Advertisements
Similar presentations
Geometry Logic.
Advertisements

TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Truth Functional Logic
Preview of SL Logic Class 3. Either it is raining or it is snowing A A: It is raining B: It is snowing B  : Or 
Logic & Critical Reasoning
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.
Chapter Two Symbolizing in Sentential Logic This chapter is a preliminary to the project of building a model of validity for sentential arguments. We.
04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Deduction In addition to being able to represent facts, or real- world statements, as formulas, we want to be able to manipulate facts, e.g., derive new.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
CS128 – Discrete Mathematics for Computer Science
6.1 Symbols and Translation
Today’s Topics n Review of Grouping and Statement Forms n Truth Functions and Truth Tables n Uses for Truth Tables n Truth Tables and Validity.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
Today’s Topics n Review Logical Implication & Truth Table Tests for Validity n Truth Value Analysis n Short Form Validity Tests n Consistency and validity.
From Chapter 4 Formal Specification using Z David Lightfoot
1 Section 1.1 Logic. 2 Proposition Statement that is either true or false –can’t be both –in English, must contain a form of “to be” Examples: –Cate Sheller.
Adapted from Discrete Math
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 4.
Propositions and Truth Tables
Chapter 8 Logic DP Studies. Content A Propositions B Compound propositions C Truth tables and logical equivalence D Implication and equivalence E Converse,
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Discrete Mathematics and Its Applications
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Ch.1 (Part 1): The Foundations: Logic and Proofs Introduction.
Chapter 1: The Foundations: Logic and Proofs
Conditional Statements and Material Implication. The Conditional: The Fourth Connective Conditional statement: when two statements are combined by placing.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Fallacies The proposition [(p  q)  q]  p is not a tautology, because it is false when p is false and q is true. This type of incorrect reasoning is.
Discrete Structures – CS Text Discrete Mathematics and Its Applications Kenneth H. Rosen (7 th Edition) Chapter 1 The Foundations: Logic and Proofs.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
Thinking Mathematically
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Propositional Logic A symbolic representation of deductive inference. Use upper case letters to represent simple propositions. E.g. Friday class rocks.
Logic The Lost Art of Argument. Logic - Review Proposition – A statement that is either true or false (but not both) Conjunction – And Disjunction – Or.
CS2351 Artificial Intelligence Bhaskar.V Class Notes on Knowledge Representation - Logical Agents.
Section 1.1 Propositions and Logical Operations. Introduction Remember that discrete is –the study of decision making in non-continuous systems. That.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
Artificial Intelligence Logical Agents Chapter 7.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
Simple Logic.
Presented by: Tutorial Services The Math Center
AND.
CSNB 143 Discrete Mathematical Structures
Discrete Mathematics Logic.
Thinking Mathematically
Truth Tables – Logic (Continued)
Logic – Bell Ringer.
Chapter 8 Logic Topics
2 Chapter Introduction to Logic and Sets
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
CS201: Data Structures and Discrete Mathematics I
Applied Discrete Mathematics Week 1: Logic
1 Chapter An Introduction to Problem Solving
Discrete Mathematics and Its Applications Kenneth H
The Logic of Declarative Statements
Discrete Mathematics Logic.
1 Chapter An Introduction to Problem Solving
MAT 3100 Introduction to Proof
Statements of Symbolic Logic
TRUTH TABLES.
Introductory Logic PHI 120
6.4 Truth Tables for Arguments
Logic of Informatics Introduction.
CS201: Data Structures and Discrete Mathematics I
Truth tables.
Presentation transcript:

What is the logic? The primary concern in logic is to identify and classify valid form of inference. The notions of 'validity' ,'form' and 'inference' are the key ones. They can be explained in the following way.Consider these two arguments: 'Either Tom broke the clock or Harry did.Harry did not break the clock. Therefore Tom did' 'Either is rained on Thuesday or on Wednesday. But on Wednesday there was no rain, Therefore it rained on Tuesday'

Each has two premisses from wich a conclusion The conclusion: therefore. To drawn a conclusion from premisses is to infer it from them.;the conclusion follow from the premisses. : 'Either Tom broke the clock or Harry did.Harry did not break the clock. Therefore Tom did' 'Either is rained on Thuesday or on Wednesday. But on Wednesday there was no rain. Therefore it rained on Tuesday Structure= Either p or q; not q; Therefore p. The letters 'p' 'q' are formulae wich 'stand for' propositions

Simple,atomic,complex, 'p' and 'q' also stand for atomic propositions 'p or q' is a proposition complex made up of two simple propositions or atomic propositions Why? Because stand for Either Tom broke the clock or Harry did Tom broke the clock= simple=p Harry did= simple=q

If the premisses are true, the truth of the conclusion are guaranteed Why? Because the propositions are logical.Ma this must be explained. Either p or q; not q; Therefore p. Why this is logical proposition? Because we compute (just as in mathematics). [(Either p or q) not q] therefore p. In mathematical logic 'or' becomes the symbol v In mathematical logic 'not' becomes the symbol ¬ In mathematical logic 'therefore' becomes the symbol ⊃ [(p v q) ¬ q] ⊃ p (Either disappears)

The logical calculus You could say we just put new symbols. It true, but these new symbols allow you to calculate the true and false. p can be true and can be false as q True-p-False ; True-q-False T-p-F; T-q-F 2 +2 = 4 but what gives true + false ?

The scholastic sense of Wittgenstein W= true Wittgenstein had the idea to connect the two propositions But we can report exactly the picture of Wittgenstein's also so p q WF WW FW FF The first hookup of Wittgenstein is the first line, the second the second line,etc.

The negation ¬ p FW WF F- W-p-F- W If you deny it a true statement is false, a false proposition if you deny it becomes true

the disjunction or, v The disjunction here is done with two propositions p q WF = W WW=W FW = W FF = F

The conjuction (and) ^ (new symbol) The conjunction is true only if the two propositions are true pq WF = F WW= W FW= F FF= F

Implication (therefore ⊃) The implication is false only if the antecedent is true and the consequent is false pq WF = F WW =W FW = W FF = W

[(p v q) ^ ¬ q] ⊃ p W W F W W F W W W W W F FW W W F W W F F W W F we now write p and q and calculate all possible values (true,false) ​​we see that the proposition is logical because the implication is always true. [(p v q) ^ ¬ q] ⊃ p W W F W W F W W W W W F FW W W F W W F F W W F F F F F WF W F

we now write p and q and calculate all possible values (true,false) ​​we see that the proposition is logical because the implication is always true. Calculus