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.

Slides:

Advertisements

Similar presentations

Quiz Methods of Proof..

Advertisements

AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.

Equivalence, Order, and Inductive Proof

1.  We have studied groups, which is an algebraic structure equipped with one binary operation. Now we shall study rings which is an algebraic structure.

>In We need a rule that will let us prove a conditional. What should the rule be?

1 2 Day 1Intro Day 2Chapter 1 Day 3Chapter 2 Day 4Chapter 3 Day 5Chapter 4 Day 6Chapter 4 Day 7Chapter 4 Day 8EXAM #1 40% of Exam 60% of Exam 10 arguments.

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.

Unit 4 Review Solutions a 5 – 32a 2 4a 2 (3a 3 – 8) 2. a 2 b 2 + ab ab(ab + 1) 3. x(x – 2) + y(2 – x) x(x – 2) – y(x – 2) (x – 2)(x – y)

Consistency In logic, ‘consistency’ has two meanings.

Chapter 12: Context-Free Languages and Pushdown Automata

CS1502 Formal Methods in Computer Science Lecture Notes 10 Resolution and Horn Sentences.

Vectors (5) Scaler Product Scaler Product Angle between lines Angle between lines.

Exam 2 Help Session Prepared by Stephen M. Thebaut, Ph.D. University of Florida Software Testing and Verification.

Logic Review. FORMAT Format Part I 30 questions 2.5 marks each Total 30 x 2.5 = 75 marks Part II 10 questions Answer only 5 of them! Total 5 x 5 marks.

Derivative – Power Rule, Product Rule, Chain Rule, Quotient Rule Unit 4.

Type your question here. Type Answer Type your question here. Type Answer.

Section 12.4 Context-Free Language Topics

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

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.

Factoring – Grouping Method Sometimes there is not a common factor other than 1 for the expression. But when the terms are put into groups, there may be.

CSE 321 Discrete Structures Winter 2008 Lecture 5 Rules of Inference.

Algebraic Proof Addition:If a = b, then a + c = b + c. Subtraction:If a = b, then a - c = b - c. Multiplication: If a = b, then ca = cb. Division: If a.

1 Section 4.3 Order Relations A binary relation is an partial order if it transitive and antisymmetric. If R is a partial order over the set S, we also.

SATMathVideos.Net A set S consists of all multiples of 4. Which of the following sets are contained within set S? A) S2 only B) S4 only C) S2 and S4 D)

P(B) = Triangle Area P(A) = Oval Area P(A or B) = r + w + g P(A and B) = w So, P(A) + P(B) = r + w + g + w The Addition Rule for 2 events A and B P(A or.

Quiz 5 1.5, 3.1 Methods of Proof.. Quiz 5: Th. May pm 1) Give 2 rules of inference and the tautologies on which they are based. 2) Explain.

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.

Pythagoras Theorem Proof of the Pythagorean Theorem using Algebra.

Completeness and Consistency So far we have 11 rules. PA, and an In and an Out rule for each of 5 connectives. Call this system of 11 rules: P.

3-5 Higher Derivatives Tues Oct 20 Do Now Find the velocity at t = 2 for each position function 1) 2)

EXAMPLE 1 Draw Conclusions In the diagram, AB BC. What can you conclude about 1 and 2 ? SOLUTION AB and BC are perpendicular, so by Theorem 3.9, they form.

Multiplying Polynomials “Two Special Cases”. Special Products: Square of a binomial (a+b) 2 = a 2 +ab+ab+b 2 = a 2 +2ab+b 2 (a-b) 2 =a 2 -ab-ab+b 2 =a.

Translating Or A unless B The simplest translation: AvB.

Quiz Title Your name goes here. Question 1 Click here for answer Click here for answer Go to question 2 Go to question 2.

CS 344 Artificial Intelligence By Prof: Pushpak Bhattacharya Class on 12/Feb/2007.

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.

Write a two-column proof

Click here for the answer. Click here for the answer.

Click here for the answer. Click here for the answer.

4-1: Congruent Figures.

Make Your Own Quiz.

Click here for the answer. Click here for the answer.

Translating Iff ‘Iff’ abbreviates ‘if and only if’ A iff B

Symbolization Review.

Methods for Evaluating Validity

RELATIVE-MOTION ANALYSIS OF TWO PARTICLES USING TRANSLATING AXES

Translating Negation Not A -A Some Synonyms in English:

Regular Grammars.

RELATIVE-MOTION ANALYSIS OF TWO PARTICLES USING TRANSLATING AXES

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

Translating Expressions

Review To check an argument with a tree:.

L.O. place the learning objective here

Let us build the tree for the argument Q>-P | P>Q.

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

Study Questions for Quiz 2

Open Branches Sometimes trees have more than one open branch.

Equivalence We have already introduced the idea of equivalence

Quiz Nov Logic.

G1 Point, Line, Plane Point, Line, Plane.

A very difficult problem There is nothing to do, so try -Out.

BETONLINEBETONLINE A·+A·+

Successful Proof Plans

Lecture 23: Computability CS200: Computer Science

Introduction to Proofs

Summary of the Rules A>B -A B -(A>B) A -B --A A AvB A B

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

(Type Answer Here) (Type Answer Here) (Type Answer Here)

Presentation transcript:

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 are Derived 4. (32 points) Proofs Using any Rules 1. Consistency and Completeness There will be 4 questions such as the following: What is a consistent system? Answer: A system where every provable argument is valid. If I remove a rule form a complete system is the result complete? Answer: It may or may not be complete depending on the rule removed.

Study Questions for Quiz 4 2. Translation There will be 2 translation problems such as the following: Having WATER is neither necessary nor sufficient for LIFE since you can have water and no life. Answer: W&-L | -(L>W)&-(W>L)

Study Questions for Quiz 4 3. Proving Rules are Derived. There will be two proofs to show that a rule is derived. You may NOT use any derived rules. Here is a sample. -(A>B) | -B Answer: 11) -(A>B)A 22) BPA 33) APA 2,34) A&B3,2 &I 2,35) B4 &O 26) A>B3-5 >I 1,27) (A>B)&-(A>B)6,1 &I 18) -B2-7 -I

Study Questions for Quiz 4 4. Proofs Using Any Rules Here is a sample: (C&-B)>A | C>(AvB) Answer: 11) (C&-B)>A A 22) CPA 33) -APA 44) -BPA 2,45) C&-B2,4 &I 1,2,46) A1,5 >O 1,2,3,47) A&-A6,3 &I 1,2,38) B4-7 -O 1,29) -A>B3-8 >I 1,210) AvB9 AR 111) C>(AvB)2-10 >I