Topic DPL: Answers. Exercise 1.1a Explain why the rule &E for MPL is a sound rule.

Similar documents
Denote John by j and Smith by s, is a bachelor by predicate letter B. The statements (1) and (2) may be written as B(j) and B(s).

2. Use quantifiers to express the associative law for multiplication of real numbers.

Discrete Mathematics

Philosophy 240 Symbolic Logic Russell Marcus Hamilton College Fall 2014

2-4: The Use of Quantifiers

Formal Logic: Quantifiers, Predicates, and Validity. CS 130 Discrete Structures

DERIVATIONS IN SYMBOLIC LOGIC I

Transparencies to accompany Rosen, Discrete Mathematics and Its Applications Section 1.3. Section 1.3 Predicates and Quantifiers

Homework. Turn in Homework #4. The fifth homework assignment has been posted on the course website. It is due on Monday, March 2.

Formal (Natural) Deduction for Predicate Calculus

First-Order Natural Deduction. Part 1: Universal Introduction and Elimination

Bertie3 Exercises. 1 Problem Set #3, PD Exercises

SYMBOLIC LOGIC UNIT 10: SINGULAR SENTENCES

Interpretations of PL (Model Theory)

Quantifiers Here is a (true) statement about real numbers: Every real number is either rational or irrational.

13. APPENDIX 1: THE SYNTAX OF PREDICATE LOGIC

Semantics I, Rutgers University Week 3-1 Yimei Xiang September 17, Predicate logic

Automated Reasoning Lecture 5: First-Order Logic

06 From Propositional to Predicate Logic

All psychiatrists are doctors All doctors are college graduates All psychiatrists are college graduates

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

MATH 1090 Problem Set #3 Solutions March York University

Lecture 10 CS 1813 Discrete Mathematics. Quantify What? Reasoning with Predicates

First-Order Logic. Natural Deduction, Part 2

Announcements & Overview

Predicate Logic. Andreas Klappenecker

Predicate Logic. 1 Predicate Logic Symbolization

Foundations of Mathematics Worksheet 2


8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)

Logic and Modelling. Introduction to Predicate Logic. Jörg Endrullis. VU University Amsterdam

Introduction to Predicate Logic Part 1. Professor Anita Wasilewska Lecture Notes (1)

Exercises for the Logic Course

Handout #7 Predicate Logic Trees

ICS141: Discrete Mathematics for Computer Science I

Predicate Logic: Semantics

University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. March 1, :00 pm Duration: 1:15 hs

CHAPTER 2. FIRST ORDER LOGIC

CSE Discrete Structures

Mathematical Logic. Reasoning in First Order Logic. Chiara Ghidini. FBK-IRST, Trento, Italy

INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW PREDICATE LOGIC

Phil 2B03 (McMaster University Final Examination) Page 1 of 4

Introduction to Sets and Logic (MATH 1190)

Math Fundamentals of Higher Math

1 Introduction to Predicate Resolution

AAA615: Formal Methods. Lecture 2 First-Order Logic

DO NOT FORGET!!! WRITE YOUR NAME HERE. Philosophy 109 Final Exam, Spring 2007 (80 points total) ~ ( x)


Predicate Calculus. Formal Methods in Verification of Computer Systems Jeremy Johnson

CITS2211: Test One. Student Number: 1. Use a truth table to prove or disprove the following statement.

INTRODUCTION TO LOGIC

Predicate Calculus - Syntax

Predicate Logic: Sematics Part 1

MAT 243 Test 1 SOLUTIONS, FORM A

Mathematical Logic. Reasoning in First Order Logic. Chiara Ghidini FBK-IRST, Trento, Italy. May 2, 2013

Name: MAT 444 Test 4 Instructor: Helene Barcelo April 19, 2004

Class 29 - November 3 Semantics for Predicate Logic

Predicate Logic combines the distinctive features of syllogistic and propositional logic.

. ^e Traveler in taesnok. i the IHilty.-^ifStiiart. BbUaaoa aad WalL.""ras 'crossing a mountain»h ch w e are A«ply inteiwted. Add

Mathematical Logics. 12. Soundness and Completeness of tableaux reasoning in first order logic. Luciano Serafini

University of Aberdeen, Computing Science CS2013 Predicate Logic 4 Kees van Deemter

If you can figure out this derivation, better yet if you can reproduce it yourself, then you have truly mastered the universal-out rule!

Answers to the Exercises -- Chapter 3

Generator Matrix. Theorem 6: If the generator polynomial g(x) of C has degree n-k then C is an [n,k]-cyclic code. If g(x) = a 0. a 1 a n k 1.

First-Order Predicate Logic. Basics

Today we will probably finish Course Notes 2.3: Predicates and Quantifiers.

Proseminar on Semantic Theory Fall 2013 Ling 720 First Order (Predicate) Logic: Syntax and Natural Deduction 1

Logic: First Order Logic

Predicate Logic. Example. Statements in Predicate Logic. Some statements cannot be expressed in propositional logic, such as: Predicate Logic

COMP4418: Knowledge Representation and Reasoning First-Order Logic

CSCE 222 Discrete Structures for Computing. Predicate Logic. Dr. Hyunyoung Lee. !!!!! Based on slides by Andreas Klappenecker

Part I: Propositional Calculus

Predicate Calculus. Lila Kari. University of Waterloo. Predicate Calculus CS245, Logic and Computation 1 / 59

Proposi'onal Logic Not Enough

Errata for Symbolic Logic: Syntax, Semantics and Proof (2013) by David W. Agler. Last Updated: 4/30/2014

1A Logic 2015 Model Answers

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

INTRODUCTION TO LOGIC 8 Identity and Definite Descriptions

Introduction to Logic in Computer Science: Autumn 2006

INTRODUCTION TO LOGIC

Relational Predicates and Overlapping Quantifiers, 8.6. I. Introducing Relational Predicates

Full file at Chapter 1

Predicate Logic: Syntax

1.1 : (The Slope of a straight Line)

G52DOA - Derivation of Algorithms Predicate Logic

Lloyd-Topor Completion and General Stable Models

INTRODUCTION TO LOGIC 8 Identity and Definite Descriptions

Logic (3A) Young W. Lim 12/5/13

2 (17) Find non-trivial left and right ideals of the ring of 22 matrices over R. Show that there are no nontrivial two sided ideals. (18) State and pr

Functions. If x 2 D, then g(x) 2 T is the object that g assigns to x. Writing the symbols. g : D! T

First order logic. Example The deduction of statements: This reasoning is intuitively correct. Every man is mortal. Since Ade is a man, he is mortal.

Predicate Calculus lecture 1

PREDICATE LOGIC. Schaum's outline chapter 4 Rosen chapter 1. September 11, ioc.pdf

II. The Calculus of The Derivative

Lecture 10: Predicate Logic and Its Language

ADDITIONAL SOLUTIONS for exercises in Introductory Symbolic Logic Without Formal Proofs

Peano Arithmetic. by replacing the schematic letter R with a formula, then prefixing universal quantifiers to bind

Problem With Natural Deduction

Homework 7 Solutions to Selected Problems

HOW TO CREATE A PROOF. Writing proofs is typically not a straightforward, algorithmic process such as calculating

Transcription:

Topic DPL: Answers Exercise 1.1a Explain why the rule &E for MPL is a sound rule. In MPL, if (φ&ψ) is true under some interpretation then φ and ψ are true under that interpretation too. Thus, if (φ&ψ) is entailed by some formula or formulas, then φ and ψ are both entailed by those formulas too. So if in a derivation (φ&ψ) is entailed by its dependencies, and you write down φ or ψ with those dependencies, then the formula you write down will be entailed by its dependencies. Hence &E for MPL is a sound rule. Exercise 1.2a Explain why for any interpretation under which "Sa" is true, " xsx" is true too. Consider all interpretations under which "Sa" is true. For all such interpretations, the predicate S applies to the element a. That means for all such interpretations, there exists some element in the domain to which the predicate S applies. So for all interpretations under which "Sa" is true, " xsx" is true too. Exercise 1.2b Show (Fa & Ga) ( xfx & Ga) 1 1. (Fa & Ga) A 1 2. Fa 1 &E 1 3. xfx 2 I 1 4. Ga 1 &E 1 5. ( xfx & Ga) 3, 4 &I Exercise 1.2c Explain why x( xsx & Rx) is not a well-formed formula of MPL. x( xsx & Rx) is not a WFF because it cannot be formed by applying the MPL formation rules as stated in [MPL03.1]. Rule 4 there stipulates that only a variable that has not occurred before can be used to generate a quantified WFF. Hence from the expression ( xsx & Ra), y( xsx & Ry) can be formed but not x( xsx & Rx) because x already occurs in ( xsx & Ra). Exercise 1.2d State Rule I without the shorthand symbolism. If you have derived φ, and φ contains at least one occurrence of some constant c, then for any variable v which does not occur in φ, you can write down " ", followed by v, followed by an expression formed by replacing one or more occurrences of c within φ by v, depending on everything φ depends on. Exercise 1.3a Explain why Rule E is a sound rule. In MPL, if vφ is true under some interpretation, then φv/c is true under that interpretation too. Thus if vφ is entailed by some formula or formulas, then φv/c is entailed by those formulas too. So if, in a derivation, vφ is entailed by its dependencies, and you write down φv/c with those dependencies, then φv/c will be entailed by its dependencies. Hence E is a sound rule. Exercise 2.1b Explain why "Fa" does not entail " xfx". Consider an interpretation under which "Fa" is true but "Fb" is false. Under this interpretation, " xfx" is false (because there exists an element in the domain to which the predicate F does not apply). Since there is an interpretation under which "Fa" is true and " xfx" is false, "Fa" does not entail " xfx". Exercise 2.1c Explain why line 3 in the last example violates Rule I. Rule I says that for any variable v and constant c, if you have derived φv/c, and c does not occur in φ, and c does not occur in anything φv/c depends on, and vφ is a well-formed formula of MPL, then you can write down vφ, depending on everything φv/c depends on. In the example, φ is "(Fa Fx)", v is "x", c is "a", and φv/c is "(Fa Fa)". The formula on line 3 is " x(fa Fx)" which violates the restriction that c does not occur in φ, because clearly, "a" does occur in "(Fa Fx)".

Exercise 2.1d Show that it is not the case that = x(fa Fx). If = x(fa Fx), then " x(fa Fx)" is true under all interpretations. Consider an interpretation in which "Fa" is true but "Fb" is false. Under this interpretation, "(Fa Fb)" is false. So " x(fa Fx)" is false under this interpretation as well. So " x(fa Fx)" is not true under all interpretations, and hence it is not the case that = x(fa Fx). Exercise 2.2a What restriction of the rule is violated on line 3 of the last example? The rule says that for any variable v and constant c, if you have derived vφ, assumed φv/c, and derived ψ, and c does not occur in ψ, φ, or anything ψ depends on (except φv/c), then you can write down ψ a second time, depending on everything vφ and the first ψ depend on, except the assumption φv/c. In this example, φ is "Fx", v is "x", c is "a", φv/c is "Fa", and ψ is "Fa". Line 3 violates the restriction that c does not occur in ψ because "a" does occur in "Fa". Exercise 2.3a Show that " x(fx Fx)" is valid in two different ways. " x(fx Fx)" is true under every interpretation. So " x(fx Fx)" is valid. " x(fx Fx)" is derivable using MPL natural deduction: 1 1. Fa A 2. (Fa Fa) 1, I 3. x(fx Fx) 2, I Since " x(fx Fx)" is derivable with no dependencies, and the system is sound, " x(fx Fx)" is valid. Exercise 2.3b Suppose you try to find a derivation of a certain MPL formula, but you do not succeed in finding a derivation. Does it follow that that formula is not valid? No. If there is no derivation, the formula is not valid. But not succeeding in finding a derivation does not mean that there isn't a derivation. Exercise 2.4a xhx Ha 1 1) xhx A 1 2) Ha 1 E xhx, (Hc xgx) xgx 1 1) xhx A 2 2) (Hc xgx) A 1 3) Hc 1 E 1, 2 4) xgx 2, 3 E x(hx Mx), xhx xmx 1 1) x(hx Mx) A 2 2) xhx A 1 3) (Ha Ma) 1 E 2 4) Ha 2 E 1, 2 5) Ma 3, 4 E 1, 2 6) xmx 5 I Ha yhy 1 1) Ha A 2 2) yhy 1 I (Ab Dc) (Ab xdx)

1 1) (Ab Dc) A 2 2) Ab A 1, 2 3) Dc 1, 2 E 1, 2 4) xdx 3 I 1 5) (Ab xdx) 2, 4 I x(fx & Gx) xfx 1 1) x(fx&gx) A 2 2) (Fa&Ga) A 2 3) Fa 2 &E 2 4) xfx 3 I 1 5) xfx 1, 2, 4 E x(fx ygy) x y(fx Gy) 1 1) x(fx ygy) A 1 2) (Fa ygy) 1 E 3 3) Fa A 1, 3 4) ygy 2, 3 E 1, 3 5) Gb 4 E 1 6) (Fa Gb) 3, 5 I 1 7) y(fa Gy) 6 I 1 8) x y(fx Gy) 7 I x(px Qx), x(qx Px) x(px Qx) 1 1) x(px Qx) A 2 2) x(qx Px) A 1 3) (Pa Qa) 1 E 2 4) (Qa Pa) 2 E 1, 2 5) ((Pa Qa)&(Qa Pa)) 3, 4 &I 1, 2 6) (Pa Qa) 5 I 1, 2 7) x(px Qx) 6 I x~px ~ xpx 1 1) x~px A 2 2) xpx A 3 3) ~Pa A 2 4) Pa 2 E 5 5) ~(Qb&~Qb) A 2, 3 6) (Pa&~Pa) 3, 4 &I 2, 3 7) (Qb&~Qb) 5, 6 ~E 1, 2 8) (Qb&~Qb) 1, 3, 7 E 1 9) ~ xpx 2, 8 ~I ( xpx x(qx Rx)), (Pa&Qa) Ra 1 1) ( xpx x(qx Rx)) A 2 2) (Pa&Qa) A 2 3) Pa 2 &E 2 4) xpx 3 I 1, 2 5) x(qx Rx) 1, 4 E 2 6) Qa 2 &E 1, 2 7) (Qa Ra) 5 E 1, 2 8) Ra 6, 7 E ( x(px Qx) x(rx&sx)), ( x(px Sx)& x(sx Qx)) xsx 1 1) ( x(px Qx) x(rx&sx)) A 2 2) ( x(px Sx)& x(sx Qx)) A 2 3) x(px Sx) 2 &E 2 4) x(sx Qx) 2 &E 5 5) Pa A 2 6) (Pa Sa) 3 E 2, 5 7) Sa 5, 6 E 2 8) (Sa Qa) 4 E 2, 5 9) Qa 7, 8 E 2 10) (Pa Qa) 5, 9 I 2 11) x(px Qx) 10 I 1, 2 12) x(rx&sx) 1, 11 E

13 13) (Rb&Sb) A 13 14) Sb 13 &E 13 15) xsx 14 I 1, 2 16) xsx 12, 13, 15 E ( x(px&~qx) xrx), ~ x(qx Rx) ~ xpx 1 1) ( x(px&~qx) xrx) A 2 2) ~ x(qxvrx) A 3 3) xpx A 4 4) Qa A 4 5) (QavRa) 4 vi 4 6) x(qxvrx) 5 I 2, 4 7)( x(qxvrx)&~ x(qxvrx)) 2, 6 &I 2 8) ~Qa 4, 7 ~I 3 9) Pa 3 E 2, 3 10) (Pa&~Qa) 8, 9 &I 2, 3 11) x(px&~qx) 10 I 1, 2, 3 12) xrx 1, 11 E 13 13) Rb A 13 14) (QbvRb) 13 vi 13 15) x(qxvrx) 14 I 1, 2, 3 16) x(qxvrx) 12, 13, 15 E 1, 2, 3 17) ( x(qxvrx)&~ x(qxvrx)) 2, 16 &I 1, 2 18) ~ xpx 3, 17 ~I ( x~px x~qx), ( x~px xqx), x(px Rx) xrx 1 1) ( x~px x~qx) A 2 2) ( x~px xqx) A 3 3) x(px Rx) A 4 4) ~Pa A 4 5) x~px 4 I 1, 4 6) x~qx 1, 5 E 2, 4 7) xqx 2, 5 E 8 8) Qa A 9 9) ~(Sb&~Sb) A 1, 4 10) ~Qa 6 E 1, 4, 8 11) (Qa&~Qa) 8, 10 &I 1, 4, 8 12) (Sb&~Sb) 9, 11 ~E 1, 2, 4 13) (Sb&~Sb) 7, 8, 12 E 1, 2 14) Pa 4, 13 ~E 3 15) (Pa Ra) 3 E 1, 2, 3 16) Ra 14, 15 E 1, 2, 3 17) xrx 16 E ~ x(px Qx), ( xrx xpx), ( xsx xqx) ~ x(rx Sx) 1 1) ~ x(pxvqx) A 2 2) ( xrx xpx) A 3 3) ( xsx xqx) A 4 4) x(rxvsx) A 5 5) Ra A 5 6) xrx 5 I 2, 5 7) xpx 2, 6 E 8 8) Pb A 8 9) (PbvQb) 8 vi 8 10) x(pxvqx) 9 I 2, 5 11) x(pxvqx) 7,8,10 E 1, 2, 5 12) ( x(pxvqx)&~ x(pxvqx)) 1, 11 &I 1, 2 13) ~Ra 5, 12 ~I 14 14) Sa A 14 15) xsx 14 I 3, 14 16) xqx 3, 15 E 17 17) Qa A 17 18) (PavQa) 17 vi 17 19) x(pxvqx) 18 I 3, 14 20) x(pxvqx) 16, 17, 19 E 1, 3, 14 21) ( x(pxvqx)&~ x(pxvqx)) 1, 20 &I

1, 3 22) ~Sa 14, 21 ~I 23 23) (RavSa) A 24 24) ~(Tb&~Tb) A 1, 2, 23 25) Sa 13, 23 ve 1,2, 3, 23 26) (Sa&~Sa) 22, 25 &I 1, 2, 3, 23 27) (Tb&~Tb) 24, 26 ~E 1, 2, 3, 4 28) (Tb&~Tb) 4, 23, 27 E 1, 2, 3 29) ~ x(rxvsx) 4, 28 ~I