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.

Slides:

Advertisements

Similar presentations

Copyright 2008, Scott Gray1 Propositional Logic 9) Or.

Advertisements

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

Proofs in Predicate Logic A rule of inference applies only if the main operator of the line is the right main operator. So if the line is a simple statement,

22C:19 Discrete Structures Logic and Proof Spring 2014 Sukumar Ghosh.

1 From Last Time… Magnitude of the electric force Direction of the electric force + +

Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.

Happy Birthday, Darwin!. Show that {(A v ~C)  ~B, [~B  (Q &~Q)], ~C & A} ⊦ is inconsistent in SD 1 (A v ~C)  ~BA 2 ~B  (Q & ~Q)A 3 ~C & AA.

Decision Tree Pruning. Problem Statement We like to output small decision tree  Model Selection The building is done until zero training error Option.

Consistency In logic, ‘consistency’ has two meanings.

Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.

Chapter 3: Set Theory and Logic

Antiderivatives Definition A function F(x) is called an antiderivative of f(x) if F ′(x) = f (x). Examples: What’s the antiderivative of f(x) = 1/x ?

Proofs in Predicate Logic A rule of inference applies only if the main operator of the line is the right main operator. So if the line is a simple statement,

Example Solution For a) ( f + g)(4)b) ( f – g)(x) c) ( f /g)(x)d) find the following. a) Since f (4) = 2(4) – (4) 2 = 8  16 =  8 and g(4) = 3(4)

(CSC 102) Lecture 7 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.

Existential Out The Existential Out rule is DANGEROUS.

 Find the indicated values for the following functions if: 

The Product Rule for Differentiation. If you had to differentiate f(x) = (3x + 2)(x – 1), how would you start?

(CSC 102) Lecture 8 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.

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.

Study Questions for Quiz 1 1. The Concept of Validity (20 points) a. You will be asked to give the two different definitions of validity given in the lecture.

1 Example 2 (a) Find the range of f(x) = x 2 +1 with domain [0,2]. Solution The function f is increasing on the interval [0,2] from its smallest value.

Chapter Thirteen Identity and Philosophical Problems of Symbolic Logic.

1 Section 9.1 Automatic Reasoning Recall that a wff W is valid iff ¬ W is unsatisfiable. Resolution is an inference rule used to prove unsatisfiability.

Chapter 9: Syntax and Semantics II : Logic & Proofs July 23, 2009 Karin Howe.

FUNCTION TRANSLATIONS ADV151 TRANSLATION: a slide to a new horizontal or vertical position (or both) on a graph. f(x) = x f(x) = (x – h) Parent function.

1 Section 8.3 Higher-Order Logic A logic is higher-order if it allows predicate names or function names to be quantified or to be arguments of a predicate.

Predicate Logic Although Propositional Logic is complete... It is still inadequate.

Study Questions for Quiz 4 The exam has four parts: 1. (16 points) Consistency and Completeness 2. (18 points) Translation 3. (34 points) Proving Rules.

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.

Query Optimization Problem Pick the best plan from the space of physical plans.

CS/APMA 202 Spring 2005 Aaron Bloomfield. Sequences in Nature

Uniqueness Quantifier ROI for Quantified Statement.

Chapter 6 More about Polynomials

Title of Essay Introductory context: Thesis statement:

Chapter 1 – Logic and Proof

A statement is a contradiction

Chapter 1 Logic and Proofs.

Make Your Own Quiz.

Another Example -#x(Ax&Bx) 1) -#x(Ax&Bx) A $x(Ax>-Bx) The 2 ways to

Set up the vOut Strategy

Methods for Evaluating Validity

A road map for predicate logic translation.

Mathematics for Computer Science MIT 6.042J/18.062J

Function notation & evaluating functions

THE REST The rest of the rules are not all that useful

SAS Libname Quiz (You have 5 mins to complete, fill in the blanks)

!'!!. = pt >pt > \ ___,..___,..

More Complex Proofs 1. TvP A 2. -P A T GOAL.

Function Notation and Evaluating Functions

Process Description Tools

CSE 321 Discrete Structures

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

Trees Trees for predicate logic can be

Proofs in Predicate Logic

Function Notation. Function Notation What is function notation? Function notation is another way to write “y=“ The notation looks like this: f(x) f(x)

Study Questions for Quiz 2

Equivalence We have already introduced the idea of equivalence

C.2.10 Sample Questions.

1. Evaluating Expressions and Functions

C.2.8 Sample Questions.

Function Notation.

Function Notation. Function Notation What is function notation? Function notation is another way to write “y=“ The notation looks like this: f(x) f(x)

Function Notation. Function Notation What is function notation? Function notation is another way to write “y=“ The notation looks like this: f(x) f(x)

C.2.8 Sample Questions.

The Foundations: Logic and Proofs

WHAT IN THE WORLD HAPPENED SINCE SUNDAY?

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

Philosopher’s Views on Religious Experience – Freud & Marx.

Presentation transcript:

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 3. (20 pts) Proof in Propositional Logic

Study Questions for Quiz 7 1. (45 pts) Argument Translation in Predicate Logic There will be about 3 or 4 arguments to translate. Sample: Translate using the notation provided. Add missing dictionary items in the blanks to the right. Only the gods can take power from me. So no human can take power from me, since No human is a god. _________ god _________ can take power from me _________ human Solution: $x(Cx>Gx) Gx = x is a god -#x(Hx&Gx) Cx = x can take power from me -#x(Hx&Cx) Hx = x is a human

Study Questions for Quiz 7 2. (65 pts) Using Proofs and Trees in Predicate Logic Sample: Show valid with a tree and a proof: $x(Mx>-Gx), #x(Bx&Gx) | #x(Bx&-Mx) Tree Solution : Proof Solution: $x(Mx>-Gx) #x(Bx&Gx) -#x(Bx&-Mx) $x-(Bx&-Mx) Ba&Ga Ma>-Ga -(Ba&-Ma) Ba Ga -Ma -Ga -Ba --Ma * * $x(Mx>-Gx) #x(Bx&Gx) -#x(Bx&-Mx) $x-(Bx&-Mx) Ba&Ga Ma>-Ga -(Ba&-Ma) Ba Ga Ba>Ma Ma -Ga Ga&-Ga #x(Bx&-Mx) 1) 2) 3) 4) 5) 6) 7) 8) 9) 10) 11) 12) 13) 14) A PA 3 QE 2 #O 1 $O 4 $O 5 &O 7 AR 10,8 >O 6,11 >O 9,12 &I O

Study Questions for Quiz 7 3. (20 pts) Propositional Logic Proof Sample: PvQ, -T>-P, T>R, -(Q&-S) | RvS Solution: PvQ -T>-P T>R -(Q&-S) P P>T T R RvS P>(RvS) Q Q>S S RvS Q>(RvS) RvS 1) 2) 3) 4) 5) 6) 7) 8) 9) 10) 11) 12) 13) 14) 15) 16) A PA 2 CN 6,5 >O 3,7 >O 8 vI 5-9 >I PA 4 AR 12,11 >O 13 vI >I 1,10,15 vO