CITS2211 Discrete Structures Proofs
|
|
- Kristina Logan
- 6 years ago
- Views:
Transcription
1 CITS2211 Discrete Structures Proofs Unit coordinator: Rachel Cardell-Oliver August 13, 2017
2 Highlights 1 Arguments vs Proofs. 2 Proof strategies 3 Famous proofs
3 Reading Chapter 1: What is a proof? Mathematics for Computer Science by Lehman, Leighton and Meyer
4 Why 1 Theoretical Computer Science based on Mathematics. 2 Most famous problem about proofs: P=NP? 3 Automatic proofs = AI? 4 Critical Thinking.
5 Notes and examples selected by Profs Reynolds and Cardell-Oliver from Introductory Logic and Sets for Computer Scientists, N. Nissanke, Addison Wesley
6 Proofs in logic and maths A proof is a really good argument that something is true. In this unit we will see two different main sorts of proofs. In today s lecture we will see (formal) proofs by logical deduction. Then we will see rigorous (but informal) mathematical proofs. There are similarities and differences.
7 Direct Proof by Logical Deduction Definition: An axiom is a proposition that is simply accepted as true. Definition: A proof is a sequence of logical deductions from axioms and previously-proved statements that concludes with the proposition in question. Definition: Logical deductions or inference rules are used to prove new propositions using previously proved ones.
8 Inference Rules Inference rules are sometimes written using this notation: P, P Q Q When the statements above the line, called the antecedents, are proved, then we can consider the statement below the line, called the conclusion or consequent, to also be proved. Definition: The turnstile symbol,, means infer that. We write p, p q q instead of the fraction notation above.
9 Soundness and Completeness A key requirement of an inference rule is that it must be sound: any assignment of truth values that makes all the antecedents true must also make the consequent true. Definition: Soundness: Any statement you get by following the rules is true. Definition: Completeness: Any statement that is true, you can get by following the rules.
10 Arguments in Propositional Logic Definition: An argument is a collection of propositions, one of which, referred to as the conclusion is justified by the others, referred to as the premises. Definition: A valid argument is a set of propositions, the last of which follows from or is implied by the rest. Definition: All other arguments are invalid
11 Arguments in Propositional Logic Example: 1 If the patient has a pulse then the patient s heart is pumping. 2 The patient has a pulse. 3 Therefore, the patient s heart is pumping. The conclusion (3) is true whenever the premises are true. The argument is therefore valid.
12 Arguments in Propositional Logic Example: 1 If I win the lottery then I am lucky. 2 I do not win the lottery. 3 Therefore, I am unlucky. This argument is invalid. Can you see why?
13 Arguments in Propositional Logic Example: 1 If I win the lottery then I am lucky. 2 I do not win the lottery. 3 Therefore, I am unlucky. This argument is invalid. Can you see why? Because the conclusion (3) does not follow whenever the premises (1,2) are true. Suppose W is false and L is true. Then W L is true and W is true. So both premises are true. But the conclusion, L, is false. It is possible that I am lucky, but I did not win the lottery.
14 Inference Rules Definition: An inference rule is a primitive valid argument form. Each inference rule enables the elimination or introduction of a logical connective.
15 Some example rules Modus ponens {p q, p} q Modus tollens {p q, q} p Double negation p p Contradiction p, p q Conjunction introduction {p, q} (p q) Conjunction elimination (p q) p, (p q) q Disjunction introduction p (p q), q (p q) Disjunction elimination {p q, p r, q r} r Biconditional introduction {p q, q p} (p q) Biconditional elimination (p q) (p q), (p q) (q p)
16 Proof Example Example: From the premise (p q) r, derive p r 1 (p q) r premise 2 r (p q) from 1, commutativity 3 (r p) (r q) from 2, distributivity 4 (r p) from 3, conjunction elimination 5 p r from 4, commutativity 6 p r from 5, double negation 7 p r from 6, implication law QED
17 Proof Example Example: From the premises H C, (L Y ) and Y C, derive H L. Fill in the missing propositions and justifications from the following proof. 1. H C premise 2. (L Y ) premise C Y 3, contrapositive 5. L Y 6. 5, commutativity 7. Y L 6, implication law 8. 1,4, transitivity of implication 9. H L QED.
18 the complete proof 1. H C premise 2. (L Y ) premise 3. Y C premise 4. C Y 3, contrapositive 5. L Y 2, De Morgan 6. Y L 5, commutativity 7. Y L 6, implication law 8. H Y 1,4, transitivity of implication 9. H L 8,7, transitivity of implication QED.
19 Proofs with Predicates - elim and intro laws RTP x.(p(x) Q(x)) y.(q(y) R(y)) x.p(x) x.r(x) goal is to derive x.r(x) from the premises. 1. x.(p(x) Q(x)) premise 2. y.(q(y) R(y)) premise 3. x.p(x) premise 4. P(a) Q(a) 1, exist elimination 5. Q(a) R(a) 2, forall elimination 6. P(a) 3, forall elimination 7. Q(a) 6,4 modus ponens 8. R(a) 5,7, modus ponens 9. x.r(x) 8, exist introduction QED
20 Proof Templates In principle, a proof can be any sequence of logical deductions from axioms and previously proved statements that concludes with the proposition in question. Fortunately, many proofs follow one of a handful of standard templates such as proof by contradiction, proof by cases, reductio ad absurdum and proving the contrapositive. We will meet some of these when we study mathematical proofs. Note on abbreviations used above: write RTP at the beginning of proofs for required to prove and QED at the end for quod erat demonstrandum meaning which was to be demonstrated, or end of proof.
21 Proofs A proof is a logical argument that demonstrates the truth of some proposition. Ultimately, mathematics rests on a set of axioms, which are very simple propositions that are simply accepted as being true. Then a proof is a sequence of logical deductions using agreed-upon inference rules that leads from the axioms to the proposition in question. In practice, a proof will lead from previously-proved statements to the new proposition.
22 Axioms The axioms that are most broadly used (ZFC) are very low-level statements that encapsulate what we would normally consider to be obvious statements about sets. For example, what does say? x y [ z(z x z y) x = y]
23 Axioms The axioms that are most broadly used (ZFC) are very low-level statements that encapsulate what we would normally consider to be obvious statements about sets. For example, what does say? x y [ z(z x z y) x = y] It simply says that two sets x and y are equal if they have the same elements!
24 Inference Rules Inference rules are sometimes written using this notation: P, P Q Q When the statements above the line, called the antecedents, are proved, then we can consider the statement below the line, called the conclusion or consequent, to also be proved. Recall this inference rule is called modus ponens.
25 Modus tollens Another frequently used inference rule is modus tollens P Q, Q P For example, if P is It has rained recently and Q is The ground is wet, then if you observe that the ground is dry, then you can conclude that it has not rained recently.
26 Logical fallacies An incorrect rule of inference is P Q, P Q This is often called modus morons for obvious reasons. It has not rained recently and therefore the ground is not wet.
27 Logical Proof Hilbert asked whether it was possible to devise a (finite) set of axioms and inference rules such that Everything that can be formally logically proved is a true statement (Soundness) Every true statement (in number theory) can be formally logically proved from the axioms (Completeness) In essence, he wondered whether mathematics could be completely automated as a complicated string manipulation exercise. Gödel proved that any logical system that is complicated enough to formalise addition and multiplication cannot be proved to be consistent within the system itself. Or to put it another way, no such system can prove its own consistency.
28 Real world proofs Despite Gödel s result, the quest for formal proofs is not entirely dead Mathematicians and computer scientists are building systems such as HOL (hol-theorem-prover.org) and Coq (coq.inria.fr) to automate and validate proofs of important results. Computer scientists are working on systems to automatically reason about and prove program correctness. However proofs are still mostly expressed at a higher level with larger steps between each assertion.
29 The following sections describe some different proof strategies
30 Proving implications Many assertions are of the form P Q, though usually stated If P, then Q. For example, consider these simple statements If n is even, then n 2 is even If r is irrational, then r 1/5 is irrational
31 Direct Proof To prove that P Q, you should Start the proof with Assume P holds, Make logical deductions for a few steps, End the proof with and hence Q follows
32 Proof: If n is even, then n 2 is even. We use the definition of the word even: an integer multiple of 2, and then the proof proceeds: Let n be an even integer (Assumption)
33 Proof: If n is even, then n 2 is even. We use the definition of the word even: an integer multiple of 2, and then the proof proceeds: Let n be an even integer Then n = 2k for some integer k (Assumption) (Defn. of even)
34 Proof: If n is even, then n 2 is even. We use the definition of the word even: an integer multiple of 2, and then the proof proceeds: Let n be an even integer Then n = 2k for some integer k Then n 2 = 4k 2 (Assumption) (Defn. of even)
35 Proof: If n is even, then n 2 is even. We use the definition of the word even: an integer multiple of 2, and then the proof proceeds: Let n be an even integer Then n = 2k for some integer k Then n 2 = 4k 2 Then n 2 = 2(2k 2 ) (Assumption) (Defn. of even)
36 Proof: If n is even, then n 2 is even. We use the definition of the word even: an integer multiple of 2, and then the proof proceeds: Let n be an even integer Then n = 2k for some integer k Then n 2 = 4k 2 Then n 2 = 2(2k 2 ) Then n 2 = 2k where k = 2k 2 is an integer (Assumption) (Defn. of even) (Arithmetic - twice)
37 Proof: If n is even, then n 2 is even. We use the definition of the word even: an integer multiple of 2, and then the proof proceeds: Let n be an even integer Then n = 2k for some integer k Then n 2 = 4k 2 Then n 2 = 2(2k 2 ) Then n 2 = 2k where k = 2k 2 is an integer Therefore n 2 is even (Assumption) (Defn. of even) (Arithmetic - twice) (Defn. of even)
38 Contrapositive: If r is irrational, then r 1/5 is irrational To prove the second statement, the direct proof technique doesn t work as well the reason is that the statement Let r be irrational is really a negative statement. However, recall from propositional logic that the contrapositive of P Q, that is, the statement is logically equivalent to P Q. Q P
39 Working the contrapositive So the contrapositive statement is If r 1/5 is rational, then r is rational. We use the definition of the word rational: a number of the form p/q where p and q are integers and q 0. The proof proceeds: Assume that r 1/5 is rational (Assumption)
40 Working the contrapositive So the contrapositive statement is If r 1/5 is rational, then r is rational. We use the definition of the word rational: a number of the form p/q where p and q are integers and q 0. The proof proceeds: Assume that r 1/5 is rational Then r 1/5 = p/q for integers p, q 0 (Assumption) (Defn. of rational)
41 Working the contrapositive So the contrapositive statement is If r 1/5 is rational, then r is rational. We use the definition of the word rational: a number of the form p/q where p and q are integers and q 0. The proof proceeds: Assume that r 1/5 is rational Then r 1/5 = p/q for integers p, q 0 Then r = p 5 /q 5 (Assumption) (Defn. of rational)
42 Working the contrapositive So the contrapositive statement is If r 1/5 is rational, then r is rational. We use the definition of the word rational: a number of the form p/q where p and q are integers and q 0. The proof proceeds: Assume that r 1/5 is rational (Assumption) Then r 1/5 = p/q for integers p, q 0 (Defn. of rational) Then r = p 5 /q 5 Then r = p /q where p = p 5, q = q 5 0 are integers (Arithm.)
43 Working the contrapositive So the contrapositive statement is If r 1/5 is rational, then r is rational. We use the definition of the word rational: a number of the form p/q where p and q are integers and q 0. The proof proceeds: Assume that r 1/5 is rational (Assumption) Then r 1/5 = p/q for integers p, q 0 (Defn. of rational) Then r = p 5 /q 5 Then r = p /q where p = p 5, q = q 5 0 are integers (Arithm.) Therefore r is rational (Defn. of rational)
44 If and only if Mathematicians are particularly fond of if-and-only-if statements An integer is even if and only if its square is even. A matrix is invertible if and only if its determinant is non-zero. It is common to use the abbreviation iff instead of if and only if. However P if and only if Q just means that both the implications P Q, Q P hold, and so you can simply provide proofs for each separately.
45 If and only if Lemma. An integer is even if and only if its square is even. Proof. ( ) The forward implication is n even implies that n 2 is even, and was proved earlier. ( ) The reverse implication is n 2 even implies that n is even, but for this we choose to prove the contrapositive, namely that n odd implies that n 2 is odd. Let n be an odd integer (Assumption)
46 If and only if Lemma. An integer is even if and only if its square is even. Proof. ( ) The forward implication is n even implies that n 2 is even, and was proved earlier. ( ) The reverse implication is n 2 even implies that n is even, but for this we choose to prove the contrapositive, namely that n odd implies that n 2 is odd. Let n be an odd integer Then n = 2k + 1 for some integer k (Assumption) (Defn. of odd)
47 If and only if Lemma. An integer is even if and only if its square is even. Proof. ( ) The forward implication is n even implies that n 2 is even, and was proved earlier. ( ) The reverse implication is n 2 even implies that n is even, but for this we choose to prove the contrapositive, namely that n odd implies that n 2 is odd. Let n be an odd integer Then n = 2k + 1 for some integer k Then n 2 = 4k 2 + 4k + 1 (Assumption) (Defn. of odd)
48 If and only if Lemma. An integer is even if and only if its square is even. Proof. ( ) The forward implication is n even implies that n 2 is even, and was proved earlier. ( ) The reverse implication is n 2 even implies that n is even, but for this we choose to prove the contrapositive, namely that n odd implies that n 2 is odd. Let n be an odd integer Then n = 2k + 1 for some integer k Then n 2 = 4k 2 + 4k + 1 Then n 2 = 2(2k 2 + 2k) + 1 (Assumption) (Defn. of odd)
49 If and only if Lemma. An integer is even if and only if its square is even. Proof. ( ) The forward implication is n even implies that n 2 is even, and was proved earlier. ( ) The reverse implication is n 2 even implies that n is even, but for this we choose to prove the contrapositive, namely that n odd implies that n 2 is odd. Let n be an odd integer Then n = 2k + 1 for some integer k Then n 2 = 4k 2 + 4k + 1 Then n 2 = 2(2k 2 + 2k) + 1 Then n 2 = 2k + 1 where k = 2k 2 + 2k is an integer (Assumption) (Defn. of odd)
50 If and only if Lemma. An integer is even if and only if its square is even. Proof. ( ) The forward implication is n even implies that n 2 is even, and was proved earlier. ( ) The reverse implication is n 2 even implies that n is even, but for this we choose to prove the contrapositive, namely that n odd implies that n 2 is odd. Let n be an odd integer Then n = 2k + 1 for some integer k Then n 2 = 4k 2 + 4k + 1 Then n 2 = 2(2k 2 + 2k) + 1 Then n 2 = 2k + 1 where k = 2k 2 + 2k is an integer Therefore n 2 is odd (Assumption) (Defn. of odd) (Defn. of odd)
51 Proof by cases A common technique in proving is to divide the proof into separate cases and resolve each case separately. Theorem If the 15 edges of the graph shown below are coloured red or blue then there will either be a red triangle or a blue triangle.
52 Proof Consider an arbitrary vertex, and call it v. Now look at the five edges leading from v and notice that by the Pigeonhole Principle, either Case 1: At least three of the edges are red, or Case 2: At least three of the edges are blue. Now consider each case separately.
53 Case 1 Consider any three vertices at the other end of red edges from v, and consider the three edges joining them. v Then either : Case 1.1 One of these three edges is red, in which case it forms a red triangle using v, or Case 1.2 All of these three edges are blue, in which case they form a blue triangle.
54 Case 2 Consider any three vertices at the other end of blue edges from v, and consider the three edges joining them. v Then either : Case 2.1 One of these three edges is blue, in which case it forms a blue triangle using v, or Case 2.2 All of these three edges are red, in which case they form a red triangle.
55 Proof by Contradiction This is a type of indirect proof where you show that a proposition is true by demonstrating that its negation leads to something known to be false. Prove P by first assuming P and then deriving false. Prove P Q by first assuming P Q and then deriving false. For example, to prove proposition P you start by saying Write Assume, for a contradiction, that P holds Deduce something known to be false (which will take several steps) Conclude with This is a contradiction, and so P is false and P is true.
56 The most famous example Let P be the statement 2 is irrational and see how we can prove this by contradiction.
57 The most famous example Let P be the statement 2 is irrational and see how we can prove this by contradiction. Proof Assume, for a contradiction, that 2 is rational (Pf. by contradiction)
58 The most famous example Let P be the statement 2 is irrational and see how we can prove this by contradiction. Proof Assume, for a contradiction, that 2 is rational (Pf. by contradiction) Express 2 = p/q in lowest terms (Defn. of rational)
59 The most famous example Let P be the statement 2 is irrational and see how we can prove this by contradiction. Proof Assume, for a contradiction, that 2 is rational (Pf. by contradiction) Express 2 = p/q in lowest terms (Defn. of rational) Then p and q have no common factors (Defn of lowest terms)
60 The most famous example Let P be the statement 2 is irrational and see how we can prove this by contradiction. Proof Assume, for a contradiction, that 2 is rational (Pf. by contradiction) Express 2 = p/q in lowest terms (Defn. of rational) Then p and q have no common factors (Defn of lowest terms) Then p 2 /q 2 = 2
61 The most famous example Let P be the statement 2 is irrational and see how we can prove this by contradiction. Proof Assume, for a contradiction, that 2 is rational (Pf. by contradiction) Express 2 = p/q in lowest terms (Defn. of rational) Then p and q have no common factors (Defn of lowest terms) Then p 2 /q 2 = 2 Then p 2 = 2q 2
62 The most famous example Let P be the statement 2 is irrational and see how we can prove this by contradiction. Proof Assume, for a contradiction, that 2 is rational (Pf. by contradiction) Express 2 = p/q in lowest terms (Defn. of rational) Then p and q have no common factors (Defn of lowest terms) Then p 2 /q 2 = 2 Then p 2 = 2q 2 Then p is even (Earlier proof)
63 The most famous example Let P be the statement 2 is irrational and see how we can prove this by contradiction. Proof Assume, for a contradiction, that 2 is rational (Pf. by contradiction) Express 2 = p/q in lowest terms (Defn. of rational) Then p and q have no common factors (Defn of lowest terms) Then p 2 /q 2 = 2 Then p 2 = 2q 2 Then p is even (Earlier proof) Then p 2 is a multiple of 4
64 The most famous example Let P be the statement 2 is irrational and see how we can prove this by contradiction. Proof Assume, for a contradiction, that 2 is rational (Pf. by contradiction) Express 2 = p/q in lowest terms (Defn. of rational) Then p and q have no common factors (Defn of lowest terms) Then p 2 /q 2 = 2 Then p 2 = 2q 2 Then p is even (Earlier proof) Then p 2 is a multiple of 4 Then q 2 is even, so q is even (Earlier proof)
65 The most famous example Let P be the statement 2 is irrational and see how we can prove this by contradiction. Proof Assume, for a contradiction, that 2 is rational (Pf. by contradiction) Express 2 = p/q in lowest terms (Defn. of rational) Then p and q have no common factors (Defn of lowest terms) Then p 2 /q 2 = 2 Then p 2 = 2q 2 Then p is even (Earlier proof) Then p 2 is a multiple of 4 Then q 2 is even, so q is even (Earlier proof) Then p and q do have a common factor
66 The most famous example Let P be the statement 2 is irrational and see how we can prove this by contradiction. Proof Assume, for a contradiction, that 2 is rational (Pf. by contradiction) Express 2 = p/q in lowest terms (Defn. of rational) Then p and q have no common factors (Defn of lowest terms) Then p 2 /q 2 = 2 Then p 2 = 2q 2 Then p is even (Earlier proof) Then p 2 is a multiple of 4 Then q 2 is even, so q is even (Earlier proof) Then p and q do have a common factor This is a contradiction, and so P is false and P is true
67 Another famous example Let P be the statement There are infinitely many prime numbers and see how we can prove this by contradiction. Proof Assume, for a contradiction, that P holds (Pf. by contradiction)
68 Another famous example Let P be the statement There are infinitely many prime numbers and see how we can prove this by contradiction. Proof Assume, for a contradiction, that P holds (Pf. by contradiction) Then there are finitely many, say k, primes (Meaning of finite)
69 Another famous example Let P be the statement There are infinitely many prime numbers and see how we can prove this by contradiction. Proof Assume, for a contradiction, that P holds (Pf. by contradiction) Then there are finitely many, say k, primes (Meaning of finite) Let L = {p 1, p 2,..., p k } contain all primes (Using assumption)
70 Another famous example Let P be the statement There are infinitely many prime numbers and see how we can prove this by contradiction. Proof Assume, for a contradiction, that P holds (Pf. by contradiction) Then there are finitely many, say k, primes (Meaning of finite) Let L = {p 1, p 2,..., p k } contain all primes (Using assumption) Set n = p 1 p 2... p k + 1 (Using assumption)
71 Another famous example Let P be the statement There are infinitely many prime numbers and see how we can prove this by contradiction. Proof Assume, for a contradiction, that P holds (Pf. by contradiction) Then there are finitely many, say k, primes (Meaning of finite) Let L = {p 1, p 2,..., p k } contain all primes (Using assumption) Set n = p 1 p 2... p k + 1 (Using assumption) Then n = p 1 K 1 + 1, so p 1 does not divide n
72 Another famous example Let P be the statement There are infinitely many prime numbers and see how we can prove this by contradiction. Proof Assume, for a contradiction, that P holds (Pf. by contradiction) Then there are finitely many, say k, primes (Meaning of finite) Let L = {p 1, p 2,..., p k } contain all primes (Using assumption) Set n = p 1 p 2... p k + 1 (Using assumption) Then n = p 1 K 1 + 1, so p 1 does not divide n Then n = p 2 K 2 + 1, so p 2 does not divide n
73 Another famous example Let P be the statement There are infinitely many prime numbers and see how we can prove this by contradiction. Proof Assume, for a contradiction, that P holds (Pf. by contradiction) Then there are finitely many, say k, primes (Meaning of finite) Let L = {p 1, p 2,..., p k } contain all primes (Using assumption) Set n = p 1 p 2... p k + 1 (Using assumption) Then n = p 1 K 1 + 1, so p 1 does not divide n Then n = p 2 K 2 + 1, so p 2 does not divide n None of the primes in L divide n (Simple generalisation)
74 Another famous example Let P be the statement There are infinitely many prime numbers and see how we can prove this by contradiction. Proof Assume, for a contradiction, that P holds (Pf. by contradiction) Then there are finitely many, say k, primes (Meaning of finite) Let L = {p 1, p 2,..., p k } contain all primes (Using assumption) Set n = p 1 p 2... p k + 1 (Using assumption) Then n = p 1 K 1 + 1, so p 1 does not divide n Then n = p 2 K 2 + 1, so p 2 does not divide n None of the primes in L divide n (Simple generalisation) Therefore n has a prime factor not in L (Property of integers)
75 Another famous example Let P be the statement There are infinitely many prime numbers and see how we can prove this by contradiction. Proof Assume, for a contradiction, that P holds (Pf. by contradiction) Then there are finitely many, say k, primes (Meaning of finite) Let L = {p 1, p 2,..., p k } contain all primes (Using assumption) Set n = p 1 p 2... p k + 1 (Using assumption) Then n = p 1 K 1 + 1, so p 1 does not divide n Then n = p 2 K 2 + 1, so p 2 does not divide n None of the primes in L divide n (Simple generalisation) Therefore n has a prime factor not in L (Property of integers) This is a contradiction, so P is false and P is true
76 Strategies Choosing what proof strategy to use is not always obvious. Try writing down what you do know: assumptions and relevant properties. Then consider which proof strategies could be used.
77 Advice Advice from the text Mathematics for Computer Science by Lehman, Leighton and Meyer. 1 State your game plan 2 Keep a linear flow 3 A proof is an essay, not a calculation 4 Avoid excessive symbolism 5 Revise and simplify 6 Introduce notation thoughtfully 7 Structure long proofs 8 Be wary of the obvious 9 Finish
78 Exercise If a, b are irrational numbers, then is it ever possible for a b to be rational? Surprisingly, the answer is YES! Try to prove the statement There exist irrational numbers a and b such that a b is rational. Hint: consider c = d = 2 and start a proof-by-cases based on whether c d is rational or not.
2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
More informationCOMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
More informationLecture 5 : Proofs DRAFT
CS/Math 240: Introduction to Discrete Mathematics 2/3/2011 Lecture 5 : Proofs Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Up until now, we have been introducing mathematical notation
More informationHandout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte
Handout on Logic, Axiomatic Methods, and Proofs MATH 3181 001 Spring 1999 David C. Royster UNC Charlotte January 18, 1999 Chapter 1 Logic and the Axiomatic Method 1.1 Introduction Mathematicians use a
More informationManual of Logical Style (fresh version 2018)
Manual of Logical Style (fresh version 2018) Randall Holmes 9/5/2018 1 Introduction This is a fresh version of a document I have been working on with my classes at various levels for years. The idea that
More informationSection 1.2: Propositional Logic
Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationProofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction
Introduction I Proofs Computer Science & Engineering 235 Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu A proof is a proof. What kind of a proof? It s a proof. A proof is a proof. And when
More informationSec$on Summary. Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs
Section 1.7 Sec$on Summary Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction 2 Proofs of Mathema$cal Statements
More informationManual of Logical Style
Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication
More informationPropositional Logic. Fall () Propositional Logic Fall / 30
Propositional Logic Fall 2013 () Propositional Logic Fall 2013 1 / 30 1 Introduction Learning Outcomes for this Presentation 2 Definitions Statements Logical connectives Interpretations, contexts,... Logically
More informationChapter 1: The Logic of Compound Statements. January 7, 2008
Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive
More information1.1 Statements and Compound Statements
Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something
More informationPropositional Logic. Spring Propositional Logic Spring / 32
Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements
More informationLogic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.
Math 0413 Appendix A.0 Logic Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. This type of logic is called propositional.
More informationSupplementary Logic Notes CSE 321 Winter 2009
1 Propositional Logic Supplementary Logic Notes CSE 321 Winter 2009 1.1 More efficient truth table methods The method of using truth tables to prove facts about propositional formulas can be a very tedious
More informationMath 300 Introduction to Mathematical Reasoning Autumn 2017 Proof Templates 1
Math 300 Introduction to Mathematical Reasoning Autumn 2017 Proof Templates 1 In its most basic form, a mathematical proof is just a sequence of mathematical statements, connected to each other by strict
More informationBoolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012
March 5, 2012 Webwork Homework. The handout on Logic is Chapter 4 from Mary Attenborough s book Mathematics for Electrical Engineering and Computing. Proving Propositions We combine basic propositions
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationProofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007
Proofs Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.5, 1.6, and 1.7 of Rosen cse235@cse.unl.edu
More information1.1 Language and Logic
c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,
More informationPropositional natural deduction
Propositional natural deduction COMP2600 / COMP6260 Dirk Pattinson Australian National University Semester 2, 2016 Major proof techniques 1 / 25 Three major styles of proof in logic and mathematics Model
More informationWarm-Up Problem. Write a Resolution Proof for. Res 1/32
Warm-Up Problem Write a Resolution Proof for Res 1/32 A second Rule Sometimes throughout we need to also make simplifications: You can do this in line without explicitly mentioning it (just pretend you
More informationMathematics 114L Spring 2018 D.A. Martin. Mathematical Logic
Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)
More informationMCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof
MCS-36: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, 010 Methods of Proof Consider a set of mathematical objects having a certain number of operations and relations
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More information4 Derivations in the Propositional Calculus
4 Derivations in the Propositional Calculus 1. Arguments Expressed in the Propositional Calculus We have seen that we can symbolize a wide variety of statement forms using formulas of the propositional
More informationConjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.
Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is
More informationPredicate Logic. Andreas Klappenecker
Predicate Logic Andreas Klappenecker Predicates A function P from a set D to the set Prop of propositions is called a predicate. The set D is called the domain of P. Example Let D=Z be the set of integers.
More informationCHAPTER 1 - LOGIC OF COMPOUND STATEMENTS
CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents
More informationReadings: Conjecture. Theorem. Rosen Section 1.5
Readings: Conjecture Theorem Lemma Lemma Step 1 Step 2 Step 3 : Step n-1 Step n a rule of inference an axiom a rule of inference Rosen Section 1.5 Provide justification of the steps used to show that a
More informationWhy Learning Logic? Logic. Propositional Logic. Compound Propositions
Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional
More informationNatural deduction for truth-functional logic
Natural deduction for truth-functional logic Phil 160 - Boston University Why natural deduction? After all, we just found this nice method of truth-tables, which can be used to determine the validity or
More informationProof. Theorems. Theorems. Example. Example. Example. Part 4. The Big Bang Theory
Proof Theorems Part 4 The Big Bang Theory Theorems A theorem is a statement we intend to prove using existing known facts (called axioms or lemmas) Used extensively in all mathematical proofs which should
More informationAdam Blank Spring 2017 CSE 311. Foundations of Computing I
Adam Blank Spring 2017 CSE 311 Foundations of Computing I Pre-Lecture Problem Suppose that p, and p (q r) are true. Is q true? Can you prove it with equivalences? CSE 311: Foundations of Computing Lecture
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationLogic Overview, I. and T T T T F F F T F F F F
Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical
More informationcse 311: foundations of computing Fall 2015 Lecture 6: Predicate Logic, Logical Inference
cse 311: foundations of computing Fall 2015 Lecture 6: Predicate Logic, Logical Inference quantifiers x P(x) P(x) is true for every x in the domain read as for all x, P of x x P x There is an x in the
More informationArgument. whenever all the assumptions are true, then the conclusion is true. If today is Wednesday, then yesterday is Tuesday. Today is Wednesday.
Logic and Proof Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement is called the conclusion. An argument is valid
More informationTools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications:
Tools for reasoning: Logic Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications: 1 Why study propositional logic? A formal mathematical language for precise
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationProofs of Mathema-cal Statements. A proof is a valid argument that establishes the truth of a statement.
Section 1.7 Proofs of Mathema-cal Statements A proof is a valid argument that establishes the truth of a statement. Terminology A theorem is a statement that can be shown to be true using: definitions
More informationcis32-ai lecture # 18 mon-3-apr-2006
cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem
More informationChapter 1, Logic and Proofs (3) 1.6. Rules of Inference
CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement
More informationLecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)
Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or
More information3. The Logic of Quantified Statements Summary. Aaron Tan August 2017
3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,
More information15414/614 Optional Lecture 1: Propositional Logic
15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,
More informationThe Foundations: Logic and Proofs. Chapter 1, Part III: Proofs
The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Summary Valid Arguments and Rules of Inference Proof Methods Proof Strategies Rules of Inference Section 1.6 Section Summary Valid Arguments
More informationUnit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9
Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Typeset September 23, 2005 1 Statements or propositions Defn: A statement is an assertion
More information3 The Semantics of the Propositional Calculus
3 The Semantics of the Propositional Calculus 1. Interpretations Formulas of the propositional calculus express statement forms. In chapter two, we gave informal descriptions of the meanings of the logical
More informationDiscrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University
Discrete Mathematics Logics and Proofs Liangfeng Zhang School of Information Science and Technology ShanghaiTech University Resolution Theorem: p q p r (q r) p q p r q r p q r p q p p r q r T T T T F T
More informationThe statement calculus and logic
Chapter 2 Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. Lewis Carroll You will have encountered several languages
More informationPropositional Logic: Part II - Syntax & Proofs 0-0
Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems
More informationChapter 2. Mathematical Reasoning. 2.1 Mathematical Models
Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................
More informationToday s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)
Today s Lecture 2/25/10 Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Announcements Homework: -- Ex 7.3 pg. 320 Part B (2-20 Even). --Read chapter 8.1 pgs. 345-361.
More informationCSE Discrete Structures
CSE 2315 - Discrete Structures Homework 2- Fall 2010 Due Date: Oct. 7 2010, 3:30 pm Proofs using Predicate Logic For all your predicate logic proofs you can use only the rules given in the following tables.
More informationNatural Deduction for Propositional Logic
Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationExamples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:
Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationThe Process of Mathematical Proof
1 The Process of Mathematical Proof Introduction. Mathematical proofs use the rules of logical deduction that grew out of the work of Aristotle around 350 BC. In previous courses, there was probably an
More informationFormal (natural) deduction in propositional logic
Formal (natural) deduction in propositional logic Lila Kari University of Waterloo Formal (natural) deduction in propositional logic CS245, Logic and Computation 1 / 67 I know what you re thinking about,
More informationLECTURE 1. Logic and Proofs
LECTURE 1 Logic and Proofs The primary purpose of this course is to introduce you, most of whom are mathematics majors, to the most fundamental skills of a mathematician; the ability to read, write, and
More informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More informationIntro to Logic and Proofs
Intro to Logic and Proofs Propositions A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both. Examples: It is raining today. Washington
More informationProof strategies, or, a manual of logical style
Proof strategies, or, a manual of logical style Dr Holmes September 27, 2017 This is yet another version of the manual of logical style I have been working on for many years This semester, instead of posting
More informationReview. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions
Review Propositions, propositional operators, truth tables Logical Equivalences. Tautologies & contradictions Some common logical equivalences Predicates & quantifiers Some logical equivalences involving
More informationFirst order Logic ( Predicate Logic) and Methods of Proof
First order Logic ( Predicate Logic) and Methods of Proof 1 Outline Introduction Terminology: Propositional functions; arguments; arity; universe of discourse Quantifiers Definition; using, mixing, negating
More informationProving Things. Why prove things? Proof by Substitution, within Logic. Rules of Inference: applying Logic. Using Assumptions.
1 Proving Things Why prove things? Proof by Substitution, within Logic Rules of Inference: applying Logic Using Assumptions Proof Strategies 2 Why Proofs? Knowledge is power. Where do we get it? direct
More informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
More informationMathematical Reasoning Rules of Inference & Mathematical Induction. 1. Assign propositional variables to the component propositional argument.
Mathematical Reasoning Rules of Inference & Mathematical Induction Example. If I take the day off it either rains or snows 2. When It rains, my basement floods 3. When the basement floods or it snows,
More information3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
More informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
More informationMath 3336: Discrete Mathematics Practice Problems for Exam I
Math 3336: Discrete Mathematics Practice Problems for Exam I The upcoming exam on Tuesday, February 26, will cover the material in Chapter 1 and Chapter 2*. You will be provided with a sheet containing
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More informationSection 3.1: Direct Proof and Counterexample 1
Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion
More informationSection 1.1 Propositions
Set Theory & Logic Section 1.1 Propositions Fall, 2009 Section 1.1 Propositions In Chapter 1, our main goals are to prove sentences about numbers, equations or functions and to write the proofs. Definition.
More informationExample ( x.(p(x) Q(x))) ( x.p(x) x.q(x)) premise. 2. ( x.(p(x) Q(x))) -elim, 1 3. ( x.p(x) x.q(x)) -elim, x. P(x) x.
Announcements CS311H: Discrete Mathematics More Logic Intro to Proof Techniques Homework due next lecture Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mathematics More Logic Intro
More informationCompound Propositions
Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth
More informationSteinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)
Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning Terminology, Notations, Definitions, & Principles: Mathematical Proof and Proving (MPP) 1. A statement
More informationDeductive Systems. Lecture - 3
Deductive Systems Lecture - 3 Axiomatic System Axiomatic System (AS) for PL AS is based on the set of only three axioms and one rule of deduction. It is minimal in structure but as powerful as the truth
More informationTheorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)
Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +
More informationThe Logic of Compound Statements cont.
The Logic of Compound Statements cont. CSE 215, Computer Science 1, Fall 2011 Stony Brook University http://www.cs.stonybrook.edu/~cse215 Refresh from last time: Logical Equivalences Commutativity of :
More informationMath 10850, fall 2017, University of Notre Dame
Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need
More informationCMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013
CMPSCI 250: Introduction to Computation Lecture 11: Proof Techniques David Mix Barrington 5 March 2013 Proof Techniques Review: The General Setting for Proofs Types of Proof: Direct, Contraposition, Contradiction
More informationSTUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES. n (n +1)(2n +1), 6. j 2 = 1(1+1)(2 1+1) 6. k (k +1)(2k +1) 6
STUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES DR. LOMONACO 1. Use the principle of mathematical induction to prove that P (n) : n (n +1)(2n +1), for all integers n 1. Answer: Proof (by weak induction):
More informationTopic 1: Propositional logic
Topic 1: Propositional logic Guy McCusker 1 1 University of Bath Logic! This lecture is about the simplest kind of mathematical logic: propositional calculus. We discuss propositions, which are statements
More informationLanguage of Propositional Logic
Logic A logic has: 1. An alphabet that contains all the symbols of the language of the logic. 2. A syntax giving the rules that define the well formed expressions of the language of the logic (often called
More informationCPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements
CPSC 121: Models of Computation Pre-class quiz #7 is due Wednesday October 16th at 17:00. Assigned reading for the quiz: Epp, 4th edition: 4.1, 4.6, Theorem 4.4.1 Epp, 3rd edition: 3.1, 3.6, Theorem 3.4.1.
More informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationDiscrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques
Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques Colin Stirling Informatics Some slides based on ones by Myrto Arapinis Colin Stirling (Informatics) Discrete Mathematics
More informationPROPOSITIONAL CALCULUS
PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and
More informationLogic. Propositional Logic: Syntax. Wffs
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationProof Techniques (Review of Math 271)
Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil
More information