 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.

Slides:

Advertisements

Similar presentations

Propositional Equivalences

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

Models and Propositional Logic In propositional logic, a model in general simply fixes the truth value – true or false – for every proposition symbol.

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

Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.

Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.

Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.

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

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

Adapted from Discrete Math

Propositions and Truth Tables

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.

Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.

Boolean Algebra. Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the late 1830s. It created a notation.

Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.

Solving Linear Inequalities `. Warm-up -4 < x ≤ 6 x ≤ -4 or x>

Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.

CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.

Sets and Sentences Open Sentences Foundations of Real Analysis.

Selected Exercises of Sec. 1.2~Sec.1.4 Sec. 1.2 Exercise 41 p, q, r 중에 두 개가 참이면 참이 되고, 그 외 의 경우에는 거짓이 되는 복합명제를 구하 시오. Find a compound proposition involving.

Thinking Mathematically

Section 1.2: Propositional Equivalences In the process of reasoning, we often replace a known statement with an equivalent statement that more closely.

Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.

Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.

Chapter 1: The Foundations: Logic and Proofs

CS2351 Artificial Intelligence Bhaskar.V Class Notes on Knowledge Representation - Logical Agents.

1 Section 6.2 Propositional Calculus Propositional calculus is the language of propositions (statements that are true or false). We represent propositions.

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

Chapter 1 Propositional Logic

Truth Tables for Negation, Conjunction, and Disjunction

Presented by: Tutorial Services The Math Center

2. The Logic of Compound Statements Summary

The Foundations: Logic and Proofs

1-4 Solving Inequalities

DISCRETE MATHEMATICS CHAPTER I.

CSNB 143 Discrete Mathematical Structures

Thinking Mathematically

Truth Tables and Equivalent Statements

CHAPTER 3 Logic.

Classwork/Homework Classwork – Page 90 (11 – 49 odd)

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Absolute Value Inequalities

Discrete Mathematics Lecture # 2.

Chapter 8 Logic Topics

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

1.2 Propositional Equivalences

Propositional Equivalences

Binary Decision Diagrams

Propositional Equivalences

Discrete Mathematics Lecture 2: Propositional Logic

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

Symbolic Logic 2/25/2019 rd.

1.2 Propositional Equivalences

Statements of Symbolic Logic

Section 3.7 Switching Circuits

Introductory Logic PHI 120

1.2 Propositional Equivalences

Section 3.3 Truth Tables for the Conditional and Biconditional

Truth Tables for the Conditional and Biconditional

2-2 Logic Vocab Statement: A sentence that is either true or false

CHAPTER 3 Logic.

Logical truths, contradictions and disjunctive normal form

Propositional Satisfiability

Presentation transcript:

 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 a single variable (~A) 3) It must be the disjunction of 2 or more terms. (~C  B  A) 4) It must be a conjunction of any of the 3 conditions above. (~A  B)  (C) Conjunction of Disjunctions

 Disjunctive 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 a single variable (~A) 3) It is a conjunction of 2 or more terms (~C  B  A) 4) It is a disjunction of two or more terms each of which is one of the 3 types above. (~C  B)  (D  A) disjunction of conjunctions

 A tautology is a logic form that always has truth value TRUE.  A contradiction is a logic form that always has truth value FALSE.  A contingency is a logic form that is sometimes true and sometimes false.

Ex 1: Z: a  (b  a)

 A logic form is a tautology if and only if it can be reduced to merely a variable symbol and the disjunction of its negation. (a  ~a)  Tautology A  B  D  ~B  Not a tautology A  B  ~D ; (~A  B)  (B  ~B)

 Z: a  (b  a)

 A disjunctive normal form is a contradiction if and only if it can be reduced to the conjunction of a variable and its negation. (D  ~D)  Contradiction: (~C  C  A)  Not a Contradiction: (~C  C)  (C  A)

 Ex 3: Y: ~[(~b  a)  a]  a