Study Questions for Quiz 6 The exam has three parts: 1. (40 pts) Translation in Predicate Logic 2. (50 pts) Using Proofs and Trees to test Concepts from.

Slides:

Advertisements

Similar presentations

1.3 Predicates and Quantifiers

Advertisements

The Logic of Quantified Statements

Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.

Logic Use mathematical deduction to derive new knowledge.

Exam #3 will be given on Monday Nongraded Homework: Now that we are familiar with the universal quantifier, try

Singular Terms In predicate logic translation the first thing you need to do is diagnose the difference between: Singular and General terms or statements.

March 5: more on quantifiers We have encountered formulas and sentences that include multiple quantifiers: Take, for example: UD: People in Michael’s office.

Statements The most important idea in logic: Validity of an argument.

Consistency In logic, ‘consistency’ has two meanings.

Quiz Th. March Propositional Logic Learning.

Prerequisite Skills VOCABULARY CHECK 1.

Jeopardy! One Step Equations. Grid Sheet 100 pts.200 pts. 300 pts. 400 pts.500 pts. Vocab Add Subtract

Chapter 3: Set Theory and Logic

The Civil War: Quiz Yourself

As come in, The Materials: Paper, pencil, calculator, periodic table for Cumulative Quiz Paper, pencil, calculator, and yesterday’s handout for Review.

Propositional Equivalences

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.

Slide Copyright © 2009 Pearson Education, Inc. 3.7 Switching Circuits.

CLASS OPENER: Is the given sequence arithmetic, if so what is the common difference? 1.1,4,9,16… 2.-21, -18, -15, -12… 3.97, 86, 75, 64… 4.0, 1, 3, 6,

Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.

Propositional Satisfiability A compound proposition is satisfiable if there is an assignment of truth values to its variables that make it true. When no.

1. 3. ANSWER 2. ANSWER Most Missed on Quiz Write the number in scientific notation. Write the number in standard Form. 4 ANSWER.

Predicates and Quantified Statements

CIS100 Test 1 Review REACH Computer Resource Center.

Use point-slope form to write an equation EXAMPLE 3 Write an equation in point-slope form of the line shown.

September 4, Application problem 1. A guitar has 6 strings. How many strings are there on 6 guitars? Write a multiplication sentence and solve.

Section 3.5 Solving Systems of Linear Equations in Two Variables by the Addition Method.

Study Questions for Quiz 5 The exam has four parts: 1. (32 points) Truth Tables 2. (48 points) Truth Trees 3. (10 points) Review of Highly Recommended.

1 Section 11.1 Regular Languages Problem: Suppose the input strings to a program must be strings over the alphabet {a, b} that contain exactly one substring.

1 Chapter Regular Languages. 2 Section 11.1 Regular Languages Problem: Suppose the input strings to a program must be strings over the alphabet.

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,

Introduction to Sentential Logic: Syntax and Semantics PHIL 121: Methods of Reasoning March 8, 2013 Instructor:Karin Howe Binghamton University.

Contingent A statement is contingent iff it is neither a logical truth nor a contradiction.

Forms of Government Quiz 2. Answer the following questions with well written complete sentences 1.In the United States a.Who has the power? Who is sovereign?

Study Questions for Quiz 7 The exam has three parts: 1. (45 pts) Argument Translation in Predicate Logic 2. (65 pts) Proofs and Trees in Predicate Logic.

Any General All A BNo A BSome A B Any A B #x(Ax&Bx) $x(Ax>Bx) -#x(Ax&Bx) $x(Ax>-Bx)

CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.

Warm-up List the logical expressions for… Statement Converse Inverse Contrapositive Which ones go together?

Lesson 2-2.A Logic: Venn Diagrams.

Chapter 1 – Logic and Proof

A statement is a contradiction

Propositional Logic Session 3

Methods for Evaluating Validity

Complete the missing numbers using the inverse.

Text Completion & Sentence Equivalence

Propositional Equivalences

Conditionals and Biconditionals

Find the surface area of:

Process Description Tools

Discrete Mathematics Lecture 2: Propositional Logic

The Logic of Declarative Statements

Binary Name: Class: .

The most important idea in logic: Validity of an argument.

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

Bell Work: The Number Game!

Section 3.7 Switching Circuits

Predicates and Quantifiers

Study Questions for Quiz 2

1. Find the length of AB for A(2, 7) and B(7, –5).

Truth Tables for the Conditional and Biconditional

Equivalence We have already introduced the idea of equivalence

1.3 Propositional Equivalences

CHAPTER 3 Logic.

Function Notation.

AP Statistics Warm-up: Problem 5.26.

Radicals and Inequalities

2-2 Logic Part 2 Truth Tables.

Sample Proofs 1. S>-M A 2. -S>-M A -M GOAL.

Propositional Satisfiability

Presentation transcript:

Study Questions for Quiz 6 The exam has three parts: 1. (40 pts) Translation in Predicate Logic 2. (50 pts) Using Proofs and Trees to test Concepts from Ch. 12, (30 pts) Explaining the tests

Study Questions for Quiz 6 1. (40 pts) Translation in Predicate Logic There will be about 10 sentences to translate. Sample: Translate using the notation provided. Add missing dictionary items in the blanks to the right. a. Al Gore lost the electionLx = x lost the election _______ Al Gore Solution: La a = Al Gore b. A whale is a mammal Mx = x is a mammal ______ whale Solution: $x(Wx>Mx) Wx = x is a whale You need to know these: all, some, no, each, every, only, none but, any, a, not all See p. 11 of Predicate Logic for information on dictionaries.

Study Questions for Quiz 6 2. (50 pts) Using Proofs and Trees to Check Concepts Sample: With both proofs and trees show the following of statements are equivalent: (S&T)>R, T>(-R>-S) You may omit dependency lists in your proofs. Solutions: (S&T)>R T -R S S&T R R&-R -S -R>-S T>(-R>-S) A PA 4,2 &I 1,5 >O 6,3 &I 4-7 –I 3-8 >I 2-9 >I T>(-R>-S) S&T S T -R>-S S>R R (S&T)>R A PA 2, &O 1,4 >O 5 CN 6,3 >O 2-7 –I (S&T)>R -(T>(-R>-S)) T -(-R>-S) -R --S -(S&T) R * -S -T * * T>(-R>-S) -[(S&T)>R] S&T -R S T -T -R>-S *. --R -S *

Study Questions for Quiz 6 3. (30 pts) Explaining the Tests There will be about 6 questions of the form: How do you show that ____ is ___ with a ___? Sample: Briefly answer each question. a.How do you show that A is a logical truth with a tree? Solution: the tree for –A closes. b.How do you show that A and B are consistent with a truth table? Solution: The table has a row where A and B are T together.