Q250, Homework 7: Natural Deduction
|
|
- Beatrix Eaton
- 7 years ago
- Views:
Transcription
1 : Natural Deduction 26 October 2011 Notes on the sequent calculus proofs One of the so-called structural rules we didn t discuss in class is the weakening rule. The weakening rule (WEAK) states that we can always add new assumptions to our context, provided the new variable does not occur free in the λ-term (aka, does not clash with a variable of the same name in the context). The idea is that if φ is true under a certain set of assumptions, then it is true under an even greater set of assumptions. This is our metatheoretic version of Strengthening the Antecedent. We ll assume that the premises (h 1,h 2,...) are given their proper types in Γ. We want our proofs to be parametric in in the context so that people using these proofs don t have to worry about weakening them before they can use them, so we ll pass around an arbitrary Γ instead of hard-coding Γ=. And finally, for sequent calculus I m just going to assume the definition φ def = φ, and so I ll be using I and instead of I and E. 1 Alternative rules 1.1 Modus Tollens (MT): P Q, Q P Natural deduction P Qtrue Q true P true u true P true Q true E I u 26 October of 18
2 Fitch-style 1 P Qtrue Premise 2 Q true Premise 3 P true Assumption 4 Q true 1, 3, 5 true 2, 4, E 6 P true 3 5, I Sequent calculus N.B., this is the same as the hypothetical syllogism with R=. Γ h 1 :P Q Γ, u:p h 1 :P Q WEAK Γ, u:p u:p VAR Γ, u:p h 1 u : Q Γ, u:p h 2 (h 1 u) : Γ λu. h 2 (h 1 u) : P Γ h 2 :Q Γ, u:p h 2 :Q WEAK I 1.2 Disjunctive Syllogism (DS): P Q, P Q Naturally, we ll also have a proof of P Q, Q P. Rather than using the commutativity of disjunction followed by DS, we could prove it directly using the same idea as we have here. Natural deduction, with the implicational E P Q true P true u P true E true Q true P Qtrue Q true E I u Q true v Q Qtrue Iv E Natural deduction with ATP s E and E P Q true P true u P true E Q true Q true Q true v E u,v 26 October of 18
3 Fitch-style 1 P Q true Premise 2 P true Premise 3 P true Assumption 4 true 2, 3, E 5 Q true 4, E 6 P Qtrue 3 5, I 7 Q true Assumption 8 Q true 7 9 Q Qtrue 7 8, I 10 Q true 1, 6, 9, E Sequent calculus, with the implicational E Γ h 1 :P Q Γ h 2 :P Γ, u:p u:p VAR Γ, u:p h 2 :P WEAK Γ, u:p h 2 u : E Γ, u:p abort(h 2 u) : Q I Γ λu. abort(h 2 u) : P Q Γ either(λu. abort(h 2 u))(λv. v) h 1 : Q Γ, v:q v:q VAR Γ λv. v : Q Q I E Sequent calculus, with ATP s E Γ h 1 :P Q Γ h 2 :P Γ, u:p u:p VAR Γ, u:p h 2 :P WEAK Γ, u:p h 2 u : E Γ, u:p abort(h 2 u) : Q Γ case h 1 of inl u abort(h 2 u) inr v v:q Γ, v:q v:q VAR E u,v 1.3 Hypothetical Syllogism (HS): P Q,Q R P R Natural deduction P true u P Qtrue Q true R true P Rtrue Q Rtrue I u 26 October of 18
4 Fitch-style 1 P Qtrue Premise 2 Q Rtrue Premise 3 P true Assumption 4 Q true 1, 3, 5 R true 2, 4, 6 P Rtrue 3 5, I Sequent calculus N.B., this is just function composition. Γ h 1 :P Q Γ, u:p u:p VAR Γ, u:p h 1 :P Q WEAK Γ, u:p h 1 u : Q Γ, u:p h 2 (h 1 u) : R Γ λu. h 2 (h 1 u) : P R Γ h 2 :Q R Γ, u:p h 2 :Q R WEAK I 1.4 Constructive Dilemma (CD): P Q,R S,P R Q S We could reuse WC (proof 1.7) for half of the work here, but we d need the commuted variation in order to do the other half of the work before putting things together. So, for the sake of uniformity, we re just proving everything directly rather than reusing WC. Natural deduction, with ATP s E P R true P Qtrue P true u Q true I L Q S true Q S true R Strue R true v S true Q S true I R E u,v 26 October of 18
5 Fitch-style 1 P Qtrue Premise 2 R Strue Premise 3 P R true Premise 4 P true Assumption 5 Q true 1, 4, 6 Q S true 5, I L 7 P Q S true 4 6, I 8 R true Assumption 9 S true 2, 8, 10 Q S true 9, I R 11 R Q S true 8 10, I 12 Q S true 3, 7, 11, E Sequent calculus, with ATP s E Let the following derivation be called D: Γ h 1 : P Q Γ, u:p h 1 : P Q WEAK Γ, u:p u:p VAR Γ, u:p h 1 u : Q Γ, u:p inl(h 1 u) : Q S I L And let the following derivation be called E : Γ h 2 : R S Γ, v:r h 2 : R S WEAK Γ, v:r v:r VAR Γ, v:p h 2 v : S Γ, v:p inr(h 2 v) : Q S I R And finally we put those together with ATP-style disjunction elimination. 26 October of 18
6 Γ h 3 : P R Γ h 1 : P Q D Γ, u:p inl(h 1 u) : Q S Γ h 2 : R S E Γ, v:p inr(h 2 v) : Q S Γ case h 3 of inl u inl(h 1 u) inr v inr(h 2 v) : Q S E u,v 1.5 Destructive Dilemma (DD): P Q,R S, Q S P R This is like the constructive dilemma, except replacing the use of modus ponens with modus tollens. Natural deduction, with ATP s E Q S true P Qtrue Q true u P true P R true proof 1.1 I L P R true R Strue S true v R true P R true proof 1.1 I R E u,v Fitch-style 1 P Qtrue Premise 2 R Strue Premise 3 Q S true Premise 4 Q true Assumption 5 P true 1, 4, MT (proof 1.1) 6 P R true 5, I L 7 Q P R true 4 6, I 8 S true Assumption 9 R true 2, 8, MT (proof 1.1) 10 P R true 9, I R 11 S P R true 8 10, I 12 P R true 3, 7, 11, E Sequent calculus, with ATP s E Let the following derivation be called D: 26 October of 18
7 Γ h 1 :P Q Γ, u:q h 1 :P Q WEAK Γ, u:q u:q VAR proof 1.1 Γ, u:q λx. u(h 1 x) : P Γ, u:q inl(λx. u(h 1 x)) :(P ) (R ) I L And let the following derivation be called E : Γ h 2 :R S Γ, v:s h 2 :R S WEAK Γ, v:s v:s VAR proof 1.1 Γ, v:s λy. v(h 2 y) : R Γ, v:s inr(λy. v(h 2 y)) :(P ) (R ) I R And by disjunction elimination we get the conclusion: Γ h 3 :(Q ) (S ) Γ h 1 :P Q D Γ, u:q... Γ h 2 :R S E Γ, v:s... Γ case h 3 of inl u inl(λx. u(h 1 x)) inr v inr(λy. v(h 2 y)) :(P ) (R ) Eu,v However, this last step is too big to write out in full and fit on the page. 1.6 Strengthening the Antecedent (SA): P Q P R Q Naturally, we ll also have a proof of P Q R P Q. Rather than using commutativity of conjunction followed by SA, we could prove it directly using the same idea as we have here. Natural deduction P Qtrue P R true u P true Q true P R Qtrue E L I u 26 October of 18
8 Fitch-style 1 P Qtrue Premise 2 P R true Assumption 3 P true 2, E L 4 Q true 1, 3, 5 P R Qtrue 2 4, I Sequent calculus N.B., this is just the hypothetical syllogism with fst for h 1 (and h 1 for h 2 ). VAR Γ h 1 :P Q Γ, u:p R u:p R Γ, u:p R h 1 :P Q WEAK Γ, u:p R fst u : P E L Γ, u:p R h 1 (fst u) : Q Γ λu. h 1 (fst u) : P R Q I 1.7 Weakening the Consequent (WC): P Q P Q R Naturally, we ll also have a proof of P Q P R Q. Rather than using WC followed by commutativity of disjunction, we could prove it directly using the same idea as we have here. Natural deduction P Qtrue P true u Q true Q R true P Q R true I L I u Fitch-style 1 P Qtrue Premise 2 P true Assumption 3 Q true 1, 2, 4 Q R true 3, I L 5 P Q R true 2 4, I 26 October of 18
9 Sequent calculus N.B., this is just the hypothetical syllogism with inl for h 2. Γ h 1 :P Q Γ, u:p h 1 :P Q WEAK Γ, u:p u:p VAR Γ, u:p h 1 u : Q Γ, u:p inl(h 1 u) : Q R Γ λu. inl(h 1 u) : P Q R I L I 2 Okay, by now it should be clear how to convert between the three styles of proof. From now on I ll only give one style. 2.1 A C B G,A (E D) A B 1 A C B G true Premise 2 A (E D) true Premise 3 A true 2, E L 4 A C true 3, I L 5 B G true 1, 4, 6 B true 5, E L 7 A B true 3, 6, I 2.2 (P R) M P,P M P R,P M R P 1 (P R) M P true Premise 2 P M P Rtrue Premise 3 P M true Premise 4 P Rtrue 2, 3, 5 M P true 1, 4, 6 R P true 3, 4, 5, CD (proof 1.4) 26 October of 18
10 2.3 F C B D, B A F, B E C, B D 1 F C B D true Premise 2 B A F true Premise 3 B E C true Premise 4 B true Premise 5 B A true 4, I L 6 F true 2, 5, 7 B E true 4, I L 8 C true 3, 7, 9 F C true 6, 8, I 10 B D true 1, 9, 11 D true 4, 10, DS (proof 1.2) 2.4 A B,A C D,D F F 1 A B true Premise 2 A C Dtrue Premise 3 D F true Premise 4 A true 1, E L 5 A C true 4, I L 6 D true 2, 5, 7 F true 3, 6, 26 October of 18
11 2.5 A B,C D,A C F E G 1 A B true Premise 2 C D true Premise 3 A C F true Premise 4 A true 1, E L 5 C true 2, E L 6 A C true 4, 5, I 7 E F true 3, 6, 8 E true 7, E L 9 E G true 8, I L 2.6 A B C D,C E, E,C D A 1 A B C D true Premise 2 C E true Premise 3 E true Premise 4 C Dtrue Premise 5 C true 2, 3, DS (proof 1.2) 6 D true 4, 5, 7 C D true 5, 6, I 8 (A B C D) (C D A B) true 1, Notation 9 C D A B true 8, E R 10 A B true 7, 9, 11 A true 10, E L 26 October of 18
12 2.7 A B, B,A C D,C E F, F E 1 A B true Premise 2 B true Premise 3 A C D true Premise 4 C E F true Premise 5 F true Premise 6 A true 1, 2, DS (proof 1.2) 7 C D true 3, 6, 8 C true 7, E L 9 (C F) (E F C) true 4, Notation 10 C F true 9, E L 11 E F true 8, 10, 12 E true 5, 11, DS (proof 1.2) 2.8 A C, C, A C D D 1 A C true Premise 2 C true Premise 3 A C D true Premise 4 A true 1, 2, MT (proof 1.1) 5 C D true 3, 4, 6 D true 2, 5, DS (proof 1.2) 26 October of 18
13 2.9 A B C,C, A B 1 A B C true Premise 2 C true Premise 3 A true Premise 4 A B true 3, I L 5 C true 1, 4, 6 true 2, 5, E 7 B true 6, E 2.10 A B,B, A D E F, F E While we don t have double negation elimination in intuitionistic logic, we do have double negation introduction. Lemma (Double Negation Introduction). For all φ we have that φ φ. Proof. 1 φ true Premise 2 φ true Assumption 3 true 1, 2, E 4 φ true 2 3, I Using double negation introduction we can prove a variation on modus tollens with the polarity reversed on the one premise and on the other premise s consequent. Lemma For all φ and ψ we have that φ ψ,ψ φ. Proof. 1 φ ψ true Premise 2 ψ true Premise 3 ψ true 2, Lemma φ true 1, 3, MT (proof 1.1) 26 October of 18
14 1 A B true Premise 2 B true Premise 3 A D E F true Premise 4 F true Premise 5 A true 1, 2, Lemma A D true 5, I L 7 ( A D F) (E F A D) true 3, Notation 8 A D F true 7, E L 9 E F true 6, 8, 10 E true 4, 9, DS (proof 1.2) 2.11 A B C, C D,A D A 1 A B C true Premise 2 C D true Premise 3 A D true Premise 4 C true Assumption 5 (A B) true 1, 4, MT (proof 1.1) 6 A B true 5, De Morgan s law (see handout) 7 A true 6, E L 8 C A true 4 7, I 9 D true Assumption 10 A true 3, 9, Lemma D A true 9 10, I 12 A true 2, 8, 11, E 2.12 B C,A C A B D This cannot be proven without using classical axioms. (Proving that to be the case is left as an exercise for the reader. Though you may want to check out package/djinn along the way.) 26 October of 18
15 1 B C true Premise 2 A C true Premise 3 A true Assumption 4 C true 2, 3, 5 B true 1, 4, Lemma B true 5, C 7 B D true 6, I L 8 A B D true 3 7, I An alternative proof is to use negation introduction instead of Lemma to derive B true. 1 B C true Premise 2 A C true Premise 3 A true Assumption 4 C true 2, 3, 5 B true Assumption 6 C true 1, 5, 7 true 4, 6, E 8 B true 5 7, I 9 B true 8, C 10 B D true 9, I L 11 A B D true 3 10, I 26 October of 18
16 2.13 B E D, E B D F 1 B E D true Premise 2 E true Premise 3 B true Assumption 4 (B D) (E D B) true 1, Notation 5 B D true 4, E L 6 E D true 3, 5, 7 D true 2, 6, DS (proof 1.2) 8 D F true 7, I L 9 B D F true 3 8, I 2.14 A B,A C,B D,D C E 1 A B true Premise 2 A C true Premise 3 B Dtrue Premise 4 D true Premise 5 (B D) (D B) true 3, Notation 6 B Dtrue 5, E L 7 B true 4, 6, HS (proof 1.3) 8 C E true 1, 2, 7, CD (proof 1.4) 26 October of 18
17 2.15 A B,C B,A C A 1 A Btrue Premise 2 C B true Premise 3 A C true Premise 4 A true Assumption 5 C true Assumption 6 C true 3, 4, 7 true 5, 6, E 8 C true 5 7, I 9 B true Assumption 10 A true 1, 9, MT (proof 1.1) 11 true 4, 10, E 12 B true 9 11, I 13 true 2, 8, 12, E 14 A true 4 13, I 3 Let, SE=Superman exists EE=evil exists / is not prevented SWPE=Superman is willing to prevent evil SAPE=Superman is able to prevent evil SI = Superman is impotent SM = Superman is malevolent 26 October of 18
18 Thus, with each sentence given in order as a premise, one argument is as follows. 1 SWPE SAPE EE true Premise 2 SAPE SI true Premise 3 SWPE SM true Premise 4 EE true Premise 5 SE SI SM true Premise 6 (SWPE SAPE) true 1, 4, Lemma SE true Assumption 8 SI SM true 5, 7, 9 SI true 8, E L 10 SAPE true 2, 9, MT (proof 1.1) 11 SAPE true 10, C 12 SM true 8, E R 13 SWPE true 3, 12, MT (proof 1.1) 14 SWPE true 13, C 15 SWPE SAPE true 11, 14, I 16 true 6, 15, E 17 SE true 7 16, I I don t think there s an intuitionistic proof of this, though I haven t proven there isn t. We could avoid the uses of C if we could prove either φ ψ, ψ φ (instead of using modus tollens and double-negation elimination) or (φ ψ) φ ψ (and then use the negations of both disjuncts to derive the contradiction); however, both of those theorems can only be proven in a classical setting. 26 October of 18
def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.
Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true
More informationLikewise, we have contradictions: formulas that can only be false, e.g. (p p).
CHAPTER 4. STATEMENT LOGIC 59 The rightmost column of this truth table contains instances of T and instances of F. Notice that there are no degrees of contingency. If both values are possible, the formula
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More information1.2 Forms and Validity
1.2 Forms and Validity Deductive Logic is the study of methods for determining whether or not an argument is valid. In this section we identify some famous valid argument forms. Argument Forms Consider
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationA DIVISION OF THE MENO. Meno proposes a question: whether virtue can be taught. Three conversations or discussions following question
A DIVISION OF THE MENO 70A 70B-100B Meno proposes a question: whether virtue can be taught Three conversations or discussions following question 70B-80D Conversation on a question before Meno's: what is
More informationHypothetical Syllogisms 1
Phil 2302 Intro to Logic Dr. Naugle Hypothetical Syllogisms 1 Compound syllogisms are composed of different kinds of sentences in their premises and conclusions (not just categorical propositions, statements
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationCOMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:
COMMUTATIVE RINGS Definition: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative
More informationCHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
More informationBeyond Propositional Logic Lukasiewicz s System
Beyond Propositional Logic Lukasiewicz s System Consider the following set of truth tables: 1 0 0 1 # # 1 0 # 1 1 0 # 0 0 0 0 # # 0 # 1 0 # 1 1 1 1 0 1 0 # # 1 # # 1 0 # 1 1 0 # 0 1 1 1 # 1 # 1 Brandon
More informationAutomata and Formal Languages
Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,
More informationCorrespondence analysis for strong three-valued logic
Correspondence analysis for strong three-valued logic A. Tamminga abstract. I apply Kooi and Tamminga s (2012) idea of correspondence analysis for many-valued logics to strong three-valued logic (K 3 ).
More informationSummary Last Lecture. Automated Reasoning. Outline of the Lecture. Definition sequent calculus. Theorem (Normalisation and Strong Normalisation)
Summary Summary Last Lecture sequent calculus Automated Reasoning Georg Moser Institute of Computer Science @ UIBK Winter 013 (Normalisation and Strong Normalisation) let Π be a proof in minimal logic
More informationNotes from February 11
Notes from February 11 Math 130 Course web site: www.courses.fas.harvard.edu/5811 Two lemmas Before proving the theorem which was stated at the end of class on February 8, we begin with two lemmas. The
More informationDISCRETE MATH: LECTURE 3
DISCRETE MATH: LECTURE 3 DR. DANIEL FREEMAN 1. Chapter 2.2 Conditional Statements If p and q are statement variables, the conditional of q by p is If p then q or p implies q and is denoted p q. It is false
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationLogic in general. Inference rules and theorem proving
Logical Agents Knowledge-based agents Logic in general Propositional logic Inference rules and theorem proving First order logic Knowledge-based agents Inference engine Knowledge base Domain-independent
More informationRules of Inference Friday, January 18, 2013 Chittu Tripathy Lecture 05
Rules of Inference Today s Menu Rules of Inference Quantifiers: Universal and Existential Nesting of Quantifiers Applications Old Example Re-Revisited Our Old Example: Suppose we have: All human beings
More informationCS510 Software Engineering
CS510 Software Engineering Propositional Logic Asst. Prof. Mathias Payer Department of Computer Science Purdue University TA: Scott A. Carr Slides inspired by Xiangyu Zhang http://nebelwelt.net/teaching/15-cs510-se
More informationSection 4.2: The Division Algorithm and Greatest Common Divisors
Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948
More informationA Few Basics of Probability
A Few Basics of Probability Philosophy 57 Spring, 2004 1 Introduction This handout distinguishes between inductive and deductive logic, and then introduces probability, a concept essential to the study
More informationPredicate logic Proofs Artificial intelligence. Predicate logic. SET07106 Mathematics for Software Engineering
Predicate logic SET07106 Mathematics for Software Engineering School of Computing Edinburgh Napier University Module Leader: Uta Priss 2010 Copyright Edinburgh Napier University Predicate logic Slide 1/24
More informationVisa Smart Debit/Credit Certificate Authority Public Keys
CHIP AND NEW TECHNOLOGIES Visa Smart Debit/Credit Certificate Authority Public Keys Overview The EMV standard calls for the use of Public Key technology for offline authentication, for aspects of online
More informationResearch Note. Bi-intuitionistic Boolean Bunched Logic
UCL DEPARTMENT OF COMPUTER SCIENCE Research Note RN/14/06 Bi-intuitionistic Boolean Bunched Logic June, 2014 James Brotherston Dept. of Computer Science University College London Jules Villard Dept. of
More information6.080/6.089 GITCS Feb 12, 2008. Lecture 3
6.8/6.89 GITCS Feb 2, 28 Lecturer: Scott Aaronson Lecture 3 Scribe: Adam Rogal Administrivia. Scribe notes The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my
More informationDeveloping Critical Thinking Skills with The Colbert Report
Developing Critical Thinking Skills with The Colbert Report Why Teach Critical Thinking with The Colbert Report? A. Young people receive the majority of their information through popular culture. B. Using
More informationSynthetic Projective Treatment of Cevian Nests and Graves Triangles
Synthetic Projective Treatment of Cevian Nests and Graves Triangles Igor Minevich 1 Introduction Several proofs of the cevian nest theorem (given below) are known, including one using ratios along sides
More informationThe common ratio in (ii) is called the scaled-factor. An example of two similar triangles is shown in Figure 47.1. Figure 47.1
47 Similar Triangles An overhead projector forms an image on the screen which has the same shape as the image on the transparency but with the size altered. Two figures that have the same shape but not
More informationalternate interior angles
alternate interior angles two non-adjacent angles that lie on the opposite sides of a transversal between two lines that the transversal intersects (a description of the location of the angles); alternate
More informationPredicate Logic. Example: All men are mortal. Socrates is a man. Socrates is mortal.
Predicate Logic Example: All men are mortal. Socrates is a man. Socrates is mortal. Note: We need logic laws that work for statements involving quantities like some and all. In English, the predicate is
More informationMath 3000 Section 003 Intro to Abstract Math Homework 2
Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationStructuring and Analyzing Arguments: The Classical, Rogerian, and Toulmin Models. Junior AP English
Structuring and Analyzing Arguments: The Classical, Rogerian, and Toulmin Models Junior AP English Key Terms: Deductive vs. Inductive Reasoning Deductive Reasoning = in traditional Aristotelian logic,
More informationNP-Completeness and Cook s Theorem
NP-Completeness and Cook s Theorem Lecture notes for COM3412 Logic and Computation 15th January 2002 1 NP decision problems The decision problem D L for a formal language L Σ is the computational task:
More informationWhy Product of Probabilities (Masses) for Independent Events? A Remark
Why Product of Probabilities (Masses) for Independent Events? A Remark Vladik Kreinovich 1 and Scott Ferson 2 1 Department of Computer Science University of Texas at El Paso El Paso, TX 79968, USA, vladik@cs.utep.edu
More informationP1. All of the students will understand validity P2. You are one of the students -------------------- C. You will understand validity
Validity Philosophy 130 O Rourke I. The Data A. Here are examples of arguments that are valid: P1. If I am in my office, my lights are on P2. I am in my office C. My lights are on P1. He is either in class
More informationPHILOSOPHY 101: CRITICAL THINKING
PHILOSOPHY 101: CRITICAL THINKING [days and times] [classroom] [semester] 20YY, [campus] [instructor s name] [office hours: days and times] [instructor s e-mail] COURSE OBJECTIVES AND OUTCOMES 1. Identify
More informationComputer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there
- 1 - THREE TREE-PATHS Avram Zehavi Alon Itai Computer Science Department Technion - IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there
More informationWOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology
First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Mid-Session Test Summer Session 008-00
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering
More informationFoundational Proof Certificates
An application of proof theory to computer science INRIA-Saclay & LIX, École Polytechnique CUSO Winter School, Proof and Computation 30 January 2013 Can we standardize, communicate, and trust formal proofs?
More informationClassical theorems on hyperbolic triangles from a projective point of view
tmcs-szilasi 2012/3/1 0:14 page 175 #1 10/1 (2012), 175 181 Classical theorems on hyperbolic triangles from a projective point of view Zoltán Szilasi Abstract. Using the Cayley-Klein model of hyperbolic
More informationMathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationCommunity College of Philadelphia Calling Code 218 Employer Scan Client Approved: November 17, 2005 Region (CIRCLE) City MSA
Community College of Philadelphia Calling Code 218 Employer Scan Client Approved: November 17, 2005 Region (CIRCLE) City MSA Zip V0 V1 V2 Month/ Day/ Year of Contact: Business Name: Address: V3 City: V4
More informationThe Mathematics of GIS. Wolfgang Kainz
The Mathematics of GIS Wolfgang Kainz Wolfgang Kainz Department of Geography and Regional Research University of Vienna Universitätsstraße 7, A-00 Vienna, Austria E-Mail: wolfgang.kainz@univie.ac.at Version.
More informationCHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.
CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:
More informationfacultad de informática universidad politécnica de madrid
facultad de informática universidad politécnica de madrid On the Confluence of CHR Analytical Semantics Rémy Haemmerlé Universidad olitécnica de Madrid & IMDEA Software Institute, Spain TR Number CLI2/2014.0
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationVictims Compensation Claim Status of All Pending Claims and Claims Decided Within the Last Three Years
Claim#:021914-174 Initials: J.T. Last4SSN: 6996 DOB: 5/3/1970 Crime Date: 4/30/2013 Status: Claim is currently under review. Decision expected within 7 days Claim#:041715-334 Initials: M.S. Last4SSN: 2957
More informationSchedule. Logic (master program) Literature & Online Material. gic. Time and Place. Literature. Exercises & Exam. Online Material
OLC mputational gic Schedule Time and Place Thursday, 8:15 9:45, HS E Logic (master program) Georg Moser Institute of Computer Science @ UIBK week 1 October 2 week 8 November 20 week 2 October 9 week 9
More informationLecture Notes in Discrete Mathematics. Marcel B. Finan Arkansas Tech University c All Rights Reserved
Lecture Notes in Discrete Mathematics Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 Preface This book is designed for a one semester course in discrete mathematics for sophomore or junior
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More information5.1 Midsegment Theorem and Coordinate Proof
5.1 Midsegment Theorem and Coordinate Proof Obj.: Use properties of midsegments and write coordinate proofs. Key Vocabulary Midsegment of a triangle - A midsegment of a triangle is a segment that connects
More information6 Commutators and the derived series. [x,y] = xyx 1 y 1.
6 Commutators and the derived series Definition. Let G be a group, and let x,y G. The commutator of x and y is [x,y] = xyx 1 y 1. Note that [x,y] = e if and only if xy = yx (since x 1 y 1 = (yx) 1 ). Proposition
More informationCosmological Arguments for the Existence of God S. Clarke
Cosmological Arguments for the Existence of God S. Clarke [Modified Fall 2009] 1. Large class of arguments. Sometimes they get very complex, as in Clarke s argument, but the basic idea is simple. Lets
More informationTuition Reimbursement Program. Handbook
EMPLOY EE Tuition Reimbursement Program Handbook For Employees... Ed u c a t i o n m a d e a f f o r d a b l e! A t t h e E r n e s t O r l a n d o L a w r e n c e B e r k e l e y N a t i o n a l L a b
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationLinear Types for Continuations
1/28 Linear Types for Continuations Alex Simpson LFCS, School of Informatics University of Edinburgh, UK Joint work with: Jeff Egger (LFCS, Edinburgh) Rasmus Møgelberg (ITU, Copenhagen) Linear Types for
More informationSolutions Q1, Q3, Q4.(a), Q5, Q6 to INTLOGS16 Test 1
Solutions Q1, Q3, Q4.(a), Q5, Q6 to INTLOGS16 Test 1 Prof S Bringsjord 0317161200NY Contents I Problems 1 II Solutions 3 Solution to Q1 3 Solutions to Q3 4 Solutions to Q4.(a) (i) 4 Solution to Q4.(a)........................................
More informationC H A P T E R Regular Expressions regular expression
7 CHAPTER Regular Expressions Most programmers and other power-users of computer systems have used tools that match text patterns. You may have used a Web search engine with a pattern like travel cancun
More informationCH3 Boolean Algebra (cont d)
CH3 Boolean Algebra (cont d) Lecturer: 吳 安 宇 Date:2005/10/7 ACCESS IC LAB v Today, you ll know: Introduction 1. Guidelines for multiplying out/factoring expressions 2. Exclusive-OR and Equivalence operations
More informationLights and Darks of the Star-Free Star
Lights and Darks of the Star-Free Star Edward Ochmański & Krystyna Stawikowska Nicolaus Copernicus University, Toruń, Poland Introduction: star may destroy recognizability In (finitely generated) trace
More informationAn Innocent Investigation
An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number
More informationTwo Applications of Desargues Theorem
Two pplications of Desargues Theorem Prof. Florentin Smarandache, University of New Mexico, U.S.. Prof. Ion Pătraşcu, The National College Fraţii Buzeşti, Craiova, Romania In this article we will use the
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationINTRODUCTION TO LOGIC
INTRODUCTION TO LOGIC A. Basic Concepts 1. Logic is the science of the correctness or incorrectness of reasoning, or the study of the evaluation of arguments. 2. A statement is a declarative sentence,
More informationCSE140: Midterm 1 Solution and Rubric
CSE140: Midterm 1 Solution and Rubric April 23, 2014 1 Short Answers 1.1 True or (6pts) 1. A maxterm must include all input variables (1pt) True 2. A canonical product of sums is a product of minterms
More informationPattern Co. Monkey Trouble Wall Quilt. Size: 48" x 58"
.............................................................................................................................................. Pattern Co..........................................................................................
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationUniversity of Ostrava. Reasoning in Description Logic with Semantic Tableau Binary Trees
University of Ostrava Institute for Research and Applications of Fuzzy Modeling Reasoning in Description Logic with Semantic Tableau Binary Trees Alena Lukasová Research report No. 63 2005 Submitted/to
More informationON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationFirst-Order Logics and Truth Degrees
First-Order Logics and Truth Degrees George Metcalfe Mathematics Institute University of Bern LATD 2014, Vienna Summer of Logic, 15-19 July 2014 George Metcalfe (University of Bern) First-Order Logics
More informationFull details of the course syllabus, support and examination arrangements are provided below.
A Level Studies in conjunction with Oxford College Study House is pleased to be able to offer students the opportunity to study A levels through our partner Oxford College who will provide study materials
More informationLecture 2. What is the Normative Role of Logic?
Lecture 2. What is the Normative Role of Logic? What is the connection between (deductive) logic and rationality? One extreme: Frege. A law of logic is a law of rational thought. Seems problematic, if
More informationPage 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.
Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b. 4200 = 2 3 3 5 2 7. c. 10 10 = 2 10 5 10. d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a
More informationProjective Geometry - Part 2
Projective Geometry - Part 2 Alexander Remorov alexanderrem@gmail.com Review Four collinear points A, B, C, D form a harmonic bundle (A, C; B, D) when CA : DA CB DB = 1. A pencil P (A, B, C, D) is the
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationS on n elements. A good way to think about permutations is the following. Consider the A = 1,2,3, 4 whose elements we permute with the P =
Section 6. 1 Section 6. Groups of Permutations: : The Symmetric Group Purpose of Section: To introduce the idea of a permutation and show how the set of all permutations of a set of n elements, equipped
More informationURL encoding uses hex code prefixed by %. Quoted Printable encoding uses hex code prefixed by =.
ASCII = American National Standard Code for Information Interchange ANSI X3.4 1986 (R1997) (PDF), ANSI INCITS 4 1986 (R1997) (Printed Edition) Coded Character Set 7 Bit American National Standard Code
More informationRegular Expressions with Nested Levels of Back Referencing Form a Hierarchy
Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy Kim S. Larsen Odense University Abstract For many years, regular expressions with back referencing have been used in a variety
More informationDEDUCTIVE & INDUCTIVE REASONING
DEDUCTIVE & INDUCTIVE REASONING Expectations 1. Take notes on inductive and deductive reasoning. 2. This is an information based presentation -- I simply want you to be able to apply this information to
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More information15 Prime and Composite Numbers
15 Prime and Composite Numbers Divides, Divisors, Factors, Multiples In section 13, we considered the division algorithm: If a and b are whole numbers with b 0 then there exist unique numbers q and r such
More informationExamination paper for MA0301 Elementær diskret matematikk
Department of Mathematical Sciences Examination paper for MA0301 Elementær diskret matematikk Academic contact during examination: Iris Marjan Smit a, Sverre Olaf Smalø b Phone: a 9285 0781, b 7359 1750
More informationCHAPTER 8 QUADRILATERALS. 8.1 Introduction
CHAPTER 8 QUADRILATERALS 8.1 Introduction You have studied many properties of a triangle in Chapters 6 and 7 and you know that on joining three non-collinear points in pairs, the figure so obtained is
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationNon-deterministic Semantics and the Undecidability of Boolean BI
1 Non-deterministic Semantics and the Undecidability of Boolean BI DOMINIQUE LARCHEY-WENDLING, LORIA CNRS, Nancy, France DIDIER GALMICHE, LORIA Université Henri Poincaré, Nancy, France We solve the open
More informationOSTROWSKI FOR NUMBER FIELDS
OSTROWSKI FOR NUMBER FIELDS KEITH CONRAD Ostrowski classified the nontrivial absolute values on Q: up to equivalence, they are the usual (archimedean) absolute value and the p-adic absolute values for
More informationLeft-Handed Completeness
Left-Handed Completeness Dexter Kozen Computer Science Department Cornell University RAMiCS, September 19, 2012 Joint work with Alexandra Silva Radboud University Nijmegen and CWI Amsterdam Result A new
More informationInvalidity in Predicate Logic
Invalidity in Predicate Logic So far we ve got a method for establishing that a predicate logic argument is valid: do a derivation. But we ve got no method for establishing invalidity. In propositional
More information0242-1. HSR TRAINING COURSE REQUIREMENTS HSR Training Course Guidance Booklet 2
0242-1 HSR TRAINING COURSE REQUIREMENTS HSR Training Course Guidance Booklet 2 SafeWork SA 2 Contents Introduction... 4 Learning resources... 4 PART 1 UNDERPINNING PRINCIPLES FOR THE DEVELOPMENT OF A SAFEWORK
More informationArkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
More informationLecture 5 - CPA security, Pseudorandom functions
Lecture 5 - CPA security, Pseudorandom functions Boaz Barak October 2, 2007 Reading Pages 82 93 and 221 225 of KL (sections 3.5, 3.6.1, 3.6.2 and 6.5). See also Goldreich (Vol I) for proof of PRF construction.
More informationIt all depends on independence
Working Papers Institute of Mathematical Economics 412 January 2009 It all depends on independence Daniel Eckert and Frederik Herzberg IMW Bielefeld University Postfach 100131 33501 Bielefeld Germany email:
More informationInteger roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
More informationIntroduction to Automata Theory. Reading: Chapter 1
Introduction to Automata Theory Reading: Chapter 1 1 What is Automata Theory? Study of abstract computing devices, or machines Automaton = an abstract computing device Note: A device need not even be a
More information