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.

Slides:



Advertisements
Similar presentations
Relations - review A binary relation on A is a subset of A×A (set of ordered pairs of elements from A) Example: A = {a,b,c,d,e} R = { (a,a),(a,b),(b,b),(b,c),
Advertisements

A Quick Look at Quantified Statements. Why are Quantified Statements Important? The logical structure of quantified statements provides a basis for the.
“A PROCEDURE FOR CHECKING EQUALITY OF REGULAR EXPRESSIONS” - A. GINZBURG Presented by Kenneth Burgess Ginzburg, A. "A Procedure for Checking Equality of.
Oh, a break! A logic puzzle   In a mythical (?) community, politicians always lie and non-politicians always tell the truth. A stranger meets 3 natives.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
Exponential and Logarithmic Functions. Objectives Students will be able to Calculate derivatives of exponential functions Calculate derivatives of logarithmic.
Proving the implications of the truth functional notions  How to prove claims that are the implications of the truth functional notions  Remember that.
Applications of matrices and determinants
Properties of Matrix Operations King Saud University.
Section 6.6 Orthogonal Matrices.
CHAPTER 1 Section 1.4 إعداد د. هيله العودان (وضعت باذن معدة العرض )
SD: Natural Deduction In S. Valid or Not? 1.If Carol drives, Ann will go to the fair 2.Carol will drive, if Bob goes and pays for gas 3.Bob will pay for.
Teach A Level Maths Vectors for Mechanics. Volume 4: Mechanics 1 Vectors for Mechanics.
Inverse and Identity Matrices Can only be used for square matrices. (2x2, 3x3, etc.)
Cryptography Inverses and GCD Piotr Faliszewski. GCD(a,b) gcd(a, 0) = a gcd(a, b) = gcd(b, a mod b) a = b*q + r Here: q =  a / b  r = a mod b (a –
1 The Halting Problem and Decidability How powerful is a TM? Any program in a high level language can be simulated by a TM. Any algorithmic procedure carried.
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.
Phrase-structure grammar A phrase-structure grammar is a quadruple G = (V, T, P, S) where V is a finite set of symbols called nonterminals, T is a set.
Introductory Logic PHI 120 Presentation: “Solving Proofs" Bring the Rules Handout to lecture.
Section 8.2 The Quadratic Formula  The Quadratic Formula  Solving Equations Using the QF  Solving an Equivalent Equation  Solving Functions and Rational.
Chapter 8 Recursion. 8.3 More Recurrence Second-Order Recurrence Definition – A second-order linear homogeneous recurrence relation with constant coefficients.
Relations & Their Properties: Selected Exercises.
4.2 – The Mean Value Theorem
Physical Science – Lecture 37 Electron Review. Review of Electrons The number of total electrons is equal to the atomic number. The number of valence.
5.3 – The Fundamental Theorem of Calculus
Properties of Inverse Matrices King Saud University.
We can also use the Distributive Property in reverse. This is called Factoring. When we factor an expression, we find all numbers or variables that divide.
How else can we find them? What are they? EMERGING Due: Friday 11 th December Circle the square numbers.
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.
§R1∪R2§R1∪R2 §R 1 ∩R 2 R1-R2R1-R2 2.4 Operations on Relations.
The Birthday Problem. The Problem In a group of 50 students, what is the probability that at least two students share the same birthday?
“Education is the most powerful weapon which you can use to change the world.” ― Nelson Mandela Do NowNelson Mandela  Take two sticky notes from the bookcase.
More Proofs. REVIEW The Rule of Assumption: A Assumption is the easiest rule to learn. It says at any stage in the derivation, we may write down any.
Theorems and Shortcuts Kareem Khalifa Department of Philosophy Middlebury College.
Properties of Matrix Operations 2010, 14, Sep. Ki-Seung Lee.
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.
2.3 The Long-Term Spot Rate. the long term spot rate. Empirical research (Cairns 1998) suggests that l(t) fluctuates substantially over long periods of.

Relations Chapter 9 Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Mean Value Theorem.
a valid argument with true premises.
Relations Chapter 9.
Applied Discrete Mathematics Week 10: Relations
Dr. Ameria Eldosoky Discrete mathematics
{P} ⊦ Q if and only if {P} ╞ Q
IMPORTANT!! As one member of our class recognized, there is a major mistake on page 180 of the text where the rule schemas for SD are laid out. It symbolizes.
CSC312 Automata Theory Grammatical Format Chapter # 13 by Cohen
Q Terminal Point Initial Point P Directed line segment.
Applied Discrete Mathematics Week 9: Equivalence Relations
Another Example -#x(Ax&Bx) 1) -#x(Ax&Bx) A $x(Ax>-Bx) The 2 ways to
Accounting Become Beautiful with QuickBooks24x
Indirect Argument: Contradiction and Contraposition
Methods for Evaluating Validity
تدريب ميداني 1.
מיחזור במערכת החינוך.
2.4 The Chain Rule Use the Chain Rule to find derivative of a composite function. Use the General Power Rule to find derivative of a function. Simplify.
More on DFA minimization and DFA equivalence
Question Suppose exists, find the limit: (1) (2) Sol. (1) (2)
Relations (sections 7.1 – 7.5)
Multiplicative Inverses of Matrices and Matrix Equations
THE REST The rest of the rules are not all that useful
Basic Proof of the Pythagorean Theorem:
I am learning my phonemes.
Properties of Relations
Clements MAΘ October 30th, 2014
Comparing Fractions Here are four strategies for comparing the size of fractions:
BETONLINEBETONLINE A·+A·+
7-2 Two Proof Oriented Triangle Theorems
A more complex example: (L&E)>P | L>P
Presentation transcript:

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

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 Q&E ~Q&E

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 Q & ~Q  E Q&E ~Q&E

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 ~B Q & ~Q  E Q&E ~Q&E

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 ~B  E Q & ~Q  E Q&E ~Q&E

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 A v ~C ~B  E Q & ~Q  E Q&E ~Q&E

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 A v ~CvI ~B  E Q & ~Q  E Q&E ~Q&E

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 4 A3 &E A v ~CvI ~B  E Q & ~Q  E Q&E ~Q&E

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 4 A3 &E 5 A v ~C4 vI 6 ~B 1, 5  E 7 Q & ~Q 6, 2  E 8 Q7 &E 9 ~Q7 &E

Show that [A  (B  C)]  [(A & B)  C] is a theorem in SD. [A  (B  C)]  [(A & B)  C]

Show that [A  (B  C)]  [(A & B)  C] is a theorem in SD. A  (B  C) A/  I (A & B)  C [A  (B  C)]  [(A & B)  C]  I

Show that [A  (B  C)]  [(A & B)  C] is a theorem in SD. A  (B  C) A/  I A & B A/  I C (A & B)  C  I [A  (B  C)]  [(A & B)  C]  I

Show that [A  (B  C)]  [(A & B)  C] is a theorem in SD. A  (B  C) A/  I A & B A/  I B  C C  E (A & B)  C  I [A  (B  C)]  [(A & B)  C]  I

Show that [A  (B  C)]  [(A & B)  C] is a theorem in SD. A  (B  C) A/  I A & B A/  I B  C  E C  E (A & B)  C  I [A  (B  C)]  [(A & B)  C]  I

Show that [A  (B  C)]  [(A & B)  C] is a theorem in SD. A  (B  C) A/  I A & B A/  I A &E B  C  E C  E (A & B)  C  I [A  (B  C)]  [(A & B)  C]  I

Show that [A  (B  C)]  [(A & B)  C] is a theorem in SD. A  (B  C) A/  I A & B A/  I A 2 &E B  C 1,3  E B 2 &E C  E (A & B)  C  I [A  (B  C)]  [(A & B)  C]  I

Show that [A  (B  C)]  [(A & B)  C] is a theorem in SD. 1 A  (B  C) A/  I 2 A & B A/  I 3 A 2 &E 4 B  C 1,3  E 5 B 2 &E 6 C 4,5  E 7 (A & B)  C 2-6  I 8 [A  (B  C)]  [(A & B)  C] 1-7  I

Show that A  ~B and B  ~A are equivalent in SD A  ~BA B  ~A

Show that A  ~B and B  ~A are equivalent in SD 1 A  ~BA 2 BA/  I ~A B  ~A  I

Show that A  ~B and B  ~A are equivalent in SD 1 A  ~BA 2 BA/  I 3 A A/~I ~A~I B  ~A  I

Show that A  ~B and B  ~A are equivalent in SD 1 A  ~BA 2 BA/  I 3 A A/~I 4 B2 R 5 ~B 1,3  E ~A~I B  ~A  I

Show that A  ~B and B  ~A are equivalent in SD 1 A  ~BA 2 BA/  I 3 A A/~I 4 B2 R 5 ~B 1,3  E 6 ~A3-5 ~I 7 B  ~A1-6  I

Show that A  ~B and B  ~A are equivalent in SD Here is the other derivation (you need both). 1 B  ~AA 2 AA/  I 3 B A/~I 4 A2 R 5 ~A 1,3  E 6 ~B3-5 ~I 7 A  ~B1-6  I

Show that (~A  B)  (A  ~B) is a theorem in SD. (~A  B)  (A  ~B)

Show that (~A  B)  (A  ~B) is a theorem in SD. 1 ~A  BA/  I A  ~B (~A  B)  (A  ~B)  I

Show that (~A  B)  (A  ~B) is a theorem in SD. 1 ~A  BA/  I A  ~B  I (~A  B)  (A  ~B)  I

Show that (~A  B)  (A  ~B) is a theorem in SD. 1 ~A  BA/  I 2 AA/  I ~ B ~BA/  I A A  ~B  I (~A  B)  (A  ~B)  I

Show that (~A  B)  (A  ~B) is a theorem in SD. 1 ~A  BA/  I 2 AA/  I ~ B ~I ~BA/  I A~E A  ~B  I (~A  B)  (A  ~B)  I

Show that (~A  B)  (A  ~B) is a theorem in SD. 1 ~A  BA/  I 2 AA/  I 3 BA/~I 4 A2R 5 ~A1, 3  E 6 ~B 3-5 ~I 7 ~BA/  I A8-10~E A  ~B2-6, 7-11  I (~A  B)  (A  ~B)1-12  I

Show that (~A  B)  (A  ~B) is a theorem in SD. 1 ~A  BA/  I 2 AA/  I 3 BA/~I 4 A2R 5 ~A1, 3  E 6 ~B 3-5 ~I 7 ~BA/  I 8 ~AA/~E 9. ~B7R 10. B1, 8  E 11 A8-10~E 12 A  ~B2-6, 7-11  I 13 (~A  B)  (A  ~B)1-12  I

Show that the following argument is valid in SD: (A v C) v B (A v B) v (B v C) 1 (A v B) v BA (A v B) v (B v C)

Show that the following argument is valid in SD: (A v C) v B (A v B) v (B v C) 1 (A v B) v BA (A v B) v (B v C)vE

Show that the following argument is valid in SD: (A v C) v B (A v B) v (B v C) 1 (A v C) v BA 2 A v CA/vE (A v B) v (B v C)1, BA/vE (A v B) v (B v C) (A v B) v (B v C)1, vE

Show that the following argument is valid in SD: (A v C) v B (A v B) v (B v C) 1 (A v C) v BA 2 A v CA/vE (A v B) v (B v C)1, BA/vE A v BvI (A v B) v (B v C)vI (A v B) v (B v C)1, vE

Show that the following argument is valid in SD: (A v C) v B (A v B) v (B v C) 1 (A v C) v BA 2 A v CA/vE 3 AA/vE 4 A v B3, vI 5 (A v B) v (B v C)4, vI 6 CA/vE 7 B v C 6 vI 8 (A v B) v (B v C)7 vI 9 (A v B) v (B v C)2, 3-5, 6-8 vE 10 BA/vE 11 A v B10 vI 12 (A v B) v (B v C)11 vI 13 (A v B) v (B v C)1, 2-9, vE