Conjunctions, Disjunctions, and Negations Symbolic Logic 2/12/2001.

Slides:

Advertisements

Similar presentations

Geometry Logic.

Advertisements

TRUTH TABLES Section 1.3.

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.

Symbolic Logic: The Language of Modern Logic

1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton.

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.

2/17/2008Sultan Almuhammadi1 ICS Logic & Sets (An Overview) Week 1.

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.

1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.

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.

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

The semantics of SL   Defining logical notions (validity, logical equivalence, and so forth) in terms of truth-value assignments   A truth-value assignment:

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.

Satisfiability & Logical Truth PHIL /16/2001.

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.

Truth Tables for Negation, Conjunction, and Disjunction.

3.2 – Truth Tables and Equivalent Statements

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.

The Foundations: Logic and Proofs

Intro to Discrete Structures

Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.

CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.

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

Truth Functions Relationships A function is a relation that links members of sets. The set of all x which are in relation R with some y is called the.

MATH 102 Contemporary Math S. Rook

CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.

Math 240: Transition to Advanced Math Deductive reasoning: logic is used to draw conclusions based on statements accepted as true. Thus conclusions are.

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

Discrete Mathematics Lecture1 Miss.Amal Alshardy.

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

3.3: Truth Tables. Types of Statements Negation: ~p Conjunction: p ˄ q (p and q) Disjunction: p V q (p or q, or both) Conditional: p → q (if p, then q)

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.

MLS 570 Critical Thinking Reading Notes for Fogelin: Propositional Logic Fall Term 2006 North Central College.

Chapter 8 – Symbolic Logic Professor D’Ascoli. Symbolic Logic Because the appraisal of arguments is made difficult by the peculiarities of natural language,

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

How do I show that two compound propositions are logically equivalent?

Review Given p: Today is Thursday q: Tomorrow is Friday

Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.

Thinking Mathematically

6.1 Logic Logic is not only the foundation of mathematics, but also is important in numerous fields including law, medicine, and science. Although the.

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

Logical Form and Logical Equivalence M Logical Form Example 1 If the syntax is faulty or execution results in division by zero, then the program.

Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.

CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.

TRUTH TABLES. Introduction The truth value of a statement is the classification as true or false which denoted by T or F. A truth table is a listing of.

Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.

Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,

Chapter 7 Evaluating Deductive Arguments II: Truth Functional Logic Invitation to Critical Thinking First Canadian Edition.

Section 1.1 Propositions and Logical Operations. Introduction Remember that discrete is –the study of decision making in non-continuous systems. That.

Invitation to Critical Thinking Chapter 7 Lecture Notes Chapter 7.

Outline Logic Propositional Logic Well formed formula Truth table

Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.

TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.

Lesson 2-2.B Logic: Truth Tables. 5-Minute Check on Lesson 2-2.A Transparency 2-2 Make a conjecture about the next item in the sequence. 1. 1, 4, 9, 16,

 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.

Ms. Andrejko 2-2 Logic. Real World Legally Blonde.

 Statement - sentence that can be proven true or false  Truth value – true or false  Statements are often represented using letters such as p and q.

Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.

Section 3.2: Truth Tables for Negation, Conjunction, and Disjunction

© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.3, Truth Tables for Negation, Conjuction, and Disjunction.

Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.

Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.

Logical functors and connectives. Negation: ¬ The function of the negation is to reverse the truth value of a given propositions (sentence). If A is true,

Truth Tables and Equivalent Statements

Truth Tables for Negation, Conjunction, and Disjunction

The Boolean Connectives

Principles of Computing – UFCFA3-30-1

Chapter 1 The Foundations: Logic and Proof, Sets, and Functions

Algebra 1 Section 4.5.

Presentation transcript:

Conjunctions, Disjunctions, and Negations Symbolic Logic 2/12/2001

Outline Test Homework & Schedule Truth Tables Negation Conjunction Disjunction Ambiguity & Parentheses

Test Handed back Wednesday Solutions posted after all have taken it. See Sara if you have questions. Note on Caps & letters: Caps (A, B, C…) are reserved for Predicates. Letters like (a, b, c…) are usually for constants. Letters like (x, y, z…) are usually for variables.

Homeworks & Schedule New Procedures for homeworks. Homework will be Due in class every Monday. You will hand in a disk and/or paper. What is due is the problems for the sections on the schedule for the preceding week. An updated schedule with tests & assignments is online.

More on Homework Problems will be sampled. That is, not every problem of every assignment will be graded. You are expected to do all the assignments. You will need two disks for your homework so that you can keep working while the current assignment is being graded. Your second disk will also serve as a backup.

Truth Tables We use a truth table to define logical constants. A truth table lists all possible combinations of truth values for a particular constant. The left side of the table contains the truth values of the components of a sentence. The right side contains the truth value of the sentence.

Negation Here’s the truth table for negation (~) P~P TRUEFALSE FALSETRUE This table lists all possible combinations of truth values for the sentence P.

Negation Continued Negation simply reverses the truth value of whatever it is negating. For example, if we have the true sentence, Home(John) the negation of this sentence is ~Home(John) and its truth value will be false.

Truth table for Home(John) Home(John)~Home(John) TRUEFALSE FALSETRUE

Conjunction The ordinary language definition of conjunction is AND. Words like “but” and “moreover” also do much the same thing in English as “^” in FOL. ^ implies that a compound sentence will be truth IFF both sides are true, false otherwise.

Truth table for ^ PQP^Q TT T TF F FT F FF F

Example of ^ Happy(John)Sad(Mary) Happy(John)^Sad(Mary) T TT T FF F TF F FF

Disjunction Logical OR (v) The resulting sentence is true if either or both sentences are true. This differs from the ordinary English meaning of OR

Disjunction PQPvQ TT T TF T FT T FF F

v vs. XOR The ordinary English use of “or” ordinarily means XOR, which is true IFF only one of the sentences is true. PQP xor Q TTF TFT FTT FFF

Exercises