1 CA 208 Logic Ex1 In your own words, define the following 1. Logic: 2. Valid reasoning/inference (2 equivalent definitions): 3. Propositions/statements:

Slides:

Advertisements

Similar presentations

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.

Advertisements

Chapter 21: Truth Tables.

Logic & Critical Reasoning

CS128 – Discrete Mathematics for Computer Science

1 CA 208 Logic Ex3 Define logical entailment  in terms of material implication  Define logical consequence |= (here the semantic consequence relation.

1 CA 208 Logic Logic Prof. Josef van Genabith Textbooks:  The Essence of Logic, John Kelly, Prentice Hall, 1997  Prolog Programming, Third Edition, Ivan.

1 CA 208 Logic PQ PQPQPQPQPQPQPQPQ

3.3 Rules Negation: ¬¬p implies p Conjunction: p&q implies p, q

Introduction to Logic Sections 1.1 and 1.2 of Rosen Spring 2010

1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.

Introduction to Logic Sections 1.1 and 1.2 of Rosen Fall 2010 CSCE 235 Introduction to Discrete Structures URL: cse.unl.edu/~cse235 Questions:

Introduction to Logic Logical Form: general rules

Discussion #9 1/9 Discussion #9 Tautologies and Contradictions.

Chapter 2: The Logic of Compound Statements 2.1 Logical Forms and Equivalence 12.1 Logical Forms and Equivalences Logic is a science of the necessary laws.

Adapted from Discrete Math

Propositional Logic Review

MATERI II PROPOSISI. 2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology.

CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.

Copyright © Curt Hill Truth Tables A way to show Boolean Operations.

Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.

(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.

COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.

2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.

Chapter Three Truth Tables 1. Computing Truth-Values We can use truth tables to determine the truth-value of any compound sentence containing one of.

INTRODUCTION TO LOGIC Jennifer Wang Fall 2009 Midterm Review Quiz Game.

1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.

CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.

1 CA 208 Logic PQ PQPQPQPQPQPQPQPQ

Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.

Lecture 9 Conditional Statements CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.

Chapter 1: The Foundations: Logic and Proofs

Chapter 1: The Foundations: Logic and Proofs

Conditional Statements – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Conditional Statements Reading: Kolman, Section 2.2.

The Foundations: Logic and Proof, Sets, and Foundations PROPOSITIONS A proposition is a declarative sentence that is either True or False, but not the.

Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.

Outline Logic Propositional Logic Well formed formula Truth table

Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.

Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.

Introductory Logic PHI 120 Presentation: "Truth Tables – Sentences"

Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.

Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.

Module Code MA0003NI: Computing mathematics Lecture for Week Autumn.

 Conjunctive Normal Form: A logic form must satisfy one of the following conditions 1) It must be a single variable (A) 2) It must be the negation of.

Chapter 1 Propositional Logic

CA 208 Continuous Assessment 2006/7

Propositional Logic (a.k.a. Sentential Logic)

2. The Logic of Compound Statements Summary

DISCRETE MATHEMATICS CHAPTER I.

CSNB 143 Discrete Mathematical Structures

COMP 1380 Discrete Structures I Thompson Rivers University

Chapter 1 Logic and Proofs.

COT 3100, Spr Applications of Discrete Structures

(CSC 102) Discrete Structures Lecture 2.

Discrete Mathematics Lecture # 2.

Methods of Proof A mathematical theorem is usually of the form pq

1.2 Propositional Equivalences

Propositional Equivalences

Information Technology Department

Propositional Equivalence (§1.2)

CS 270 Math Foundations of CS

Applied Discrete Mathematics Week 1: Logic

Logical Truth To show a statement A is a logic truth (tautology) ...

1.2 Propositional Equivalences

Lecture 5 Binary Operation Boolean Logic. Binary Operations Addition Subtraction Multiplication Division.

COMP 1380 Discrete Structures I Thompson Rivers University

1.2 Propositional Equivalences

Truth Tables for the Conditional and Biconditional

Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.

SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.

Presentation transcript:

1 CA 208 Logic Ex1 In your own words, define the following 1. Logic: 2. Valid reasoning/inference (2 equivalent definitions): 3. Propositions/statements:  List the 1. 4 binary 2. 1 unary connectives (use the special symbols)  Translate the following into plain English 1. P |= C 2. {A,B} |= A  B 3. {A  B} |= A 4. {A, A → B} |= B

2 CA 208 Logic Ex1 Formalise the following arguments/inferences using proposional variables (P, Q, R,...) and the logical connectives. State the translation keys: 1. Kate is a student. If Kate is a student, then Kate is broke. |= Kate is broke. 2. Kate is a student. Kate is broke. |= Kate is a student and Kate is broke. 3. Kate is a student and Kate is broke. |= Kate is a student. 4. Kate is a student. |= Kate is a student. 5. Kate is taller than John. John is taller than Mike. If Kate is taller than John and John is taller than Mike, then Kate is taller than Mike. |= Kate is taller than Mike.  Intutively, are the inferences above logically valid (i.e. is the conclusion true in all situations where the premises are true)?  Is the following inference logically valid? 1. If Kate is a student, then Kate is broke. Kate is broke. (|= ??) Kate is a student.

3 CA 208 Logic Ex1 Complete the following truth tables: PQ PQPQPQPQPQPQPQPQ PQ PQPQ  P  Q  P   Q  (  P   Q) P PP 1 0 P PP   P 1 0

4 CA 208 Logic Ex2 What are  Tautologies  Contradictions  Contingencies Define logical equivalence  in terms of  Intuitively, what does it mean for two formulas to be logically equivalent?

5 CA 208 Logic Ex2 Use the truth table method to show whether the following are tautologies, contingencies or contradictions  (P  (  P  Q))  Q   (  P   Q)  (P  Q)   (Q  Q) Use the truth table method and the definition of logical equivalence in terms of the biconditional (iff) to show that   (  P   Q)  (P  Q)

6 CA 208 Logic Ex2 Use the Boolean equivalences to show (i.e.rewrite) that the following are logically equivalent:   (  Q   P)  (P  Q)  (P  (  Q   P))  (P   Q)