11 views

Uploaded by Raisha Alivia

- Transitions and Connective s
- 4 the Axioms of Peano Arithmetic
- 3965.pdf
- Douglas Hofstadter - Godel Escher Bach Chapter 00b Overview
- DeMorgan s Theorems
- cpro15.docx
- P-union and P-intersection of neutrosophic cubic sets
- little probability
- Contents
- slides8a MA103
- Educative Sheet Quarto English
- Quantification for the Logic of Presuppositions
- Writing Task 2
- MUX e Decoder
- Mathematical Induction
- Expository Essay - Leonardo David Sanchez Silva 21
- Anselm
- DM1 Assignment 1
- Ethos - A Comm3 Report
- Cogito Ergo Bite Me

You are on page 1of 2

Autumn 2004

Logic Problems

1.

2.

3.

Write the following statements in symbolic form using connectives. Make sure you dene appropriate

simple statements P; Q; R; : : :.

(i) Stocks are increasing but interest rates are steady.

(ii) Neither are stocks increasing nor are interest rates steady.

(iii) John is healthy and wealthy but not wise.

(iv) John is not wealthy but he is healthy and wise.

(v) John is neither healthy, wealthy nor wise.

(vi) John is healthy, wealthy and wise.

(vii) Either Olga will go out for tennis or she will go out for track but not both.

(viii) Freeze or I'll shoot.

(ix) I am on time for work if I catch the 8:05 bus.

(x) If it is after ve, then the meeting is over.

(xi) Either my watch is wrong or we are going to be late.

(xii) If Pat arrives early and Quinn stays late, then Robert is happy.

(xiii) If either Pat arrives early or Quinn does not stay late, then Robert is not happy.

(xiv) If Robert is not happy, then Pat does not arrive early.

(xv) Pat arrives early if and only if Quinn stays late, but it is not the case that if Quinn does not stay

late then Robert is happy.

Number each connective in order of importance in each of the following compound statements. State the

main connective

in each case.

(i) (P () Q) () ( R ^ S ) _ T

(ii) (R _ S ) ^ (P _ Q) =) (P =) Q)

(iii) (P =) Q) ^ (Q =) P ) () (P () Q)

(iv) (P =) Q) ^ (Q =) R) _ (R =) S )

(v)

P _ (R ^ S )

=) (Q _ T ) _ (P ^ S )

Let P , Q and R be statements. Construct truth tables for the following statement forms.

(i) P ^ Q

(ii) (P ^ Q) _ (P _ Q)

(iii) P ^ (Q ^ R)

(iv) P ^ ( Q _ R)

(v) P _ ( P _ Q) ^ (Q ^ R)

(vi) ( P _ Q) =) Q

(vii) (P _ Q) _ ( P ^ Q) =) Q

(viii) (P ^ Q) =) R

(ix) ( P _ Q) =) R

(x) (P ^ R) () (Q _ R)

(xi) (P =) R) () (Q =) R)

(xii) P =) (Q =) R) () (P ^ Q) =) R

4.

5.

6.

7.

8.

9.

10.

Let P , Q and R be statements. By nding truth tables, determine which of the following pairs of

statements are logically equivalent.

(i) P _ (P ^ Q) and P

(ii) (P ^ Q) and P ^ Q

(iii) (P ^ Q) _ R and P ^ (Q _ R)

(iv) ( P _ Q) ^ (P _ R) ^ ( P _ Q) and (P _ R)

(v) R _ P ) ^ ( R _ (P ^ Q) ^ (R _ Q) and P ^ Q

(vi) P =) (Q _ R) and (P ^ Q) =) R

(vii) P =) (Q =) R) and (P =) Q) =) R

Assume x is a real number. Use DeMorgan's laws to write negations for the following statements.

(i) 2 < x < 7

(ii) 10 < x < 2

(iii) 1 > x 3

(iv) 0 > x 7

Using Theorem 1.4.2, part 6, write negations for each of the following statements.

(i) If S is a square, then S is a triangle.

(ii) If today is New Year's Even, then tomorrow is January.

(iii) If the decimal expansion of x is terminating, then x is rational.

(iv) If n is prime, then n is odd or n is 2.

(v) If Tom is Ann's father, then Jim is her uncle and Sue is her aunt.

Let P , Q and R be statements. Determine whether the following statements are tautologies, contradictions

or contingent statements.

(i) (P ^ Q) _ P _ (P ^ Q)

(ii) (P ^ Q) ^ ( P _ Q)

(iii) ( P _ Q) ^ (Q ^ R) ^ Q

(iv) ( P _ Q) _ (P ^ Q)

Using Theorem 1.4.2 and the conclusions from Tutorial Sheet Week 2, prove the following logical equivalences.

(i) (P ^ Q) _ (P ^ Q) P

(ii) (P _ Q) ^ ( P _ Q) Q

(iii) (P _ Q) _ ( P ^ Q) P

Using Theorem 1.4.2, rewrite the following statements using only the connectives ^ and .

(i) (P ^ Q) =) R

(ii) (P _ Q) =) (R _ Q)

(iii) (P =) R) () (Q =) R)

(iv) P =) (Q =) R) () (P ^ Q) =) R

Use this exercise to practice the \quick method"; avoid using truth tables if you can.

Determine which of the following statements are tautologies.

(i) (P =) Q) =) (Q =) P )

(ii) (P ^ Q) =) (P () Q)

(iii) (P ^ Q) =) R _ ( P _ Q)

(iv) P =) ( Q ^ R) _ (P ^ R)

(v) (P ^ Q) =) R =) ( R =) P )

(vi) (P ^ Q) _ R =) (Q _ R)

- Transitions and Connective sUploaded bywillie chit
- 4 the Axioms of Peano ArithmeticUploaded bygodwsky
- 3965.pdfUploaded bysrinjoy chakravorty
- Douglas Hofstadter - Godel Escher Bach Chapter 00b OverviewUploaded byIgor Bojceski
- DeMorgan s TheoremsUploaded byMuhammad Al Imran
- cpro15.docxUploaded byRomel Leo Alojado
- P-union and P-intersection of neutrosophic cubic setsUploaded byAnonymous 0U9j6BLllB
- little probabilityUploaded bySeaton Harns
- ContentsUploaded bySusana
- slides8a MA103Uploaded byAnonymous RnapGaSIZJ
- Educative Sheet Quarto EnglishUploaded byIvan Djuric
- Quantification for the Logic of PresuppositionsUploaded byX.Y. Newberry
- Writing Task 2Uploaded byQuang Minh Nguyễn
- MUX e DecoderUploaded byAntonio Ferrara
- Mathematical InductionUploaded bySaurabh Jain
- Expository Essay - Leonardo David Sanchez Silva 21Uploaded byDavid
- AnselmUploaded byPierre Macalino
- DM1 Assignment 1Uploaded byKem Bán Cà Rem
- Ethos - A Comm3 ReportUploaded byTyrll Adolf Barcenas Itong
- Cogito Ergo Bite MeUploaded bymenexenosi
- CodesUploaded byEhtasham Ul Hassan
- A "Clean" Introduction to LogicUploaded byRock Brentwood
- ORM2GraphicalNotationUploaded byINTEGGRO
- Shivley2009 Craft of Political ResearchUploaded byV. L.
- Digital Logic CircuitsUploaded byrameshsophidarla
- Writing Support Structure for France taskUploaded by3alliumcourt
- philosophy statementUploaded byapi-253994777
- humanities-finalUploaded byapi-248270913
- Interesting BooksUploaded bycharlysu
- Generality ProblemUploaded byMikhail Lastrilla

- Bab 2 Kalkulus PreposisiUploaded byRaisha Alivia
- Pencil_Drawing_A_Beginner_s_Guide[1]Uploaded byyeskey2k
- 01 Logic ProbsUploaded byRaisha Alivia
- HowtoStudyKorean Unit 0 PDFUploaded byNguyenVinhPhuc
- Calculus I CompleteUploaded byxenocid3r
- Tata Cara Pembayaran Spc Telkom University BniUploaded byRaisha Alivia

- AENG412 Introduction to Topic & Assignment No. 1Uploaded byanon_520408329
- NIC Components NVS SeriesUploaded byNICComp
- Lab & Projectguide amieUploaded byRahul Sharma
- Online Stores RRLUploaded byJanelle Mendoza
- IC-7700 service manual.pdfUploaded byRobert/yd2wsq
- Control de Lectura 1- Inglés InstrumentalUploaded bypastormuscarforte
- 18 Mud CalculationsUploaded byRebar Kaka
- 80386.pptUploaded byjayaraju_2002
- Grade 11 Curriculum Guide PDFUploaded byChris
- nnsd698sUploaded byAnonymous 2GVabYh40W
- 20130009951Uploaded bysinytells
- Data Mining ApplicationsUploaded byMirjana Pejic Bach
- Price War Pushes Down Revenues at Dialog_ One-Off Costs Cause LKR7.7 Billion Loss Due to Upahara and Smart 5Uploaded byRantharu Attanayake
- Copeland Scroll ZR57KC-PFVUploaded byMegaHyperMax
- UCS INTROUploaded bysdcad
- t15u.pdfUploaded byjoseocsilva
- Template of IRECOSUploaded byc_h_v_k_r
- 1.1 Fundamentals of CAD(1)Uploaded bySandeepak
- Nita Istiasih 07211144015Uploaded byMuhammadHusseinAlbadry
- TM4-D2-chap3.pdfUploaded byKristopanus Patiung Lantemona
- EEE313 a New Method for Reducing Magnetic Radial Force in Switched Reluctance MotorUploaded bysathish
- integrity essay finalUploaded byapi-223624876
- NLS3000-Manual Version 0.4_ENGUploaded byJan Der Var
- Exp 1Uploaded bysainibhavya
- Annual Report 2010-11Uploaded byMd Irfan Ahmad
- Quick Troubleshooting Manual for Mitsubishi WS-55859Uploaded byJohn Smith
- Avtron PresentationUploaded byPaul Rasmussen
- Delphi Fundamentals of Database Development in Delphi.pdfUploaded bymicroserver
- Do You QuantumThink? Dianne Collins Enlightenment 123 by Liz SterlingUploaded byLiz Shoher Sterling
- nebosh questions with answersUploaded bytusharhse