152 views

Uploaded by the3rd

programming tutorial 2

- A Computationally-Discovered Simpliﬁcation of the Ontological Argument.pdf
- Problems and Solutions for Bitwise Operations
- accrued_exp
- Homework 1
- Discrete Maths
- cocch_rome2
- Kinds of Set
- Mathematical symbols
- Quantification Theory Logic 1st of the 2 Parts
- NST_LP
- On Discussive Set Theory - Lafayette
- Logic lecture notes
- Latihtubi1(Function)
- Power_set
- Constraints Logic
- Intro Analysis Ch2
- ADA LAB PROGRAMS.docx
- 2_chapter_1
- typeinst
- Neutrosophic Triplet G-Module

You are on page 1of 3

Subject: Session:

Tutorial 2

Part A

1. 2.

Proof Techniques II

Show that for any integer n, n2 2 is not divisible by 4. Show that for any real numbers x and y, max (x, y) min (x, y) = |x y|.

Part B

1. In the questions below suppose that Q(x) is x+1 = 2x, where x is a real number. Find the truth value of the statement. (i) Q(2) (ii) x Q(x) (iii) x Q(x) 2. In the questions below P(x,y) means x + 2y = xy, where x and y are integers. Determine the truth value of the statement. a) P(1,1). b) P(0,0). c) y P(3,y). d) xy P(x,y). e) xy P(x,y). f) yx P(x,y). g) yx P(x,y). h) xy P(x,y). 3. In the questions below suppose the variable x represents students and y represents courses, and: U(y): y is an upper-level course M(y): y is a math course F(x): x is a freshman B(x): x is a full-time student, T(x,y): student x is taking course y.

-1-

TDS1191, Tutorial 2

Write the statement using these predicates and any needed quantifiers. a) Eric is taking MTH 281. b) All students are freshmen. c) Every freshman is a full-time student. d) No math course is upper-level. 4. In the questions below suppose the variable x represents students and y represents courses, and: M(y): y is a math course F(x): x is a freshman B(x): x is a full-time student T(x,y): x is taking y. Write the following statement in good English without using variables in your answers. a). xy T(x,y). b) xy T(x,y). c) xy [(B(x) F(x)) (M(y) T(x,y))]. 5. In the questions below assume that the universe for x is all people and the universe for y is the set of all movies. Using the predicates S(x,y): x saw y, L(x,y): x liked y. write the following statements in good English without using variables in your answer. a) y S(Margaret,y). b) yx L(x,y) c) xy L(x,y). 6. In the questions below let F(A) be the predicate A is a finite set and S(A,B) be the predicate A is contained in B (which is the same as A is a subset of B). Suppose the universe of discourse consists of all sets. Translate the statement into logical expressions. a) Not all sets are finite. b) Every subset of a finite set is finite. c) No infinite set is contained in a finite set. d) The empty set is a subset of every finite set. 7. Using the predicates. P(x) = x is a clear explanation Q(x) = x is satisfactory R(x) = x is an excuse formalize the following statements. a) All clear explanations are satisfactory. b) Some excuses are unsatisfactory. c) Some excuses are not clear explanations. Show that the premises a) and b) imply the conclusion c).

-2-

TDS1191, Tutorial 2

8. Express the negation of the following statements so that no negation symbols appear outside a quantifier or an expression involving logical connectives. a) xy [F(x,y) (Q(x) S(y))] b) x y [(Q(x) F(x,y)) S(y)] c) xy [Q(x) S(y) F(x,y) P(x)] 9. Assuming p(x) means that x is a person, c(x) means that x is a chocolate bar and e(x,y) means that x eats y. Give English translations of the following formulas.

a) [(x (p(x) q(x))) ( x p(x))] x q(x) b) [(x (P(x) Q(x))) (x (Q(x) S(x))) (x (R(x) S(x))) (x P(x))] x R(x)

11. Prove by formal reasoning that the premises a) If a student works hard, he/she will pass all his/her subjects b) Terry did not pass Discrete Structures imply the conclusion c) Terry did not work hard. 12. Prove by formal reasoning that the premises a) All movies produced by James Stewart are wonderful. b) James Stewart produces a movie sharks. imply the conclusion c) there is a wonderful movie about sharks.

-3-

- A Computationally-Discovered Simpliﬁcation of the Ontological Argument.pdfUploaded byJuan Andrés Celis
- Problems and Solutions for Bitwise OperationsUploaded bycoolboy119
- accrued_expUploaded byapi-26344229
- Homework 1Uploaded bymst000
- Discrete MathsUploaded byMahreen Ilahi
- cocch_rome2Uploaded bytinman2009
- Kinds of SetUploaded byJenny Bolaños
- Mathematical symbolsUploaded byJohn Ting
- Quantification Theory Logic 1st of the 2 PartsUploaded byRandy Nier Garete Saladero
- NST_LPUploaded byconsequently
- On Discussive Set Theory - LafayetteUploaded byLuccaMantini
- Logic lecture notesUploaded bysophie1114
- Latihtubi1(Function)Uploaded byZaweyah Sulaiman
- Power_setUploaded bymars
- Constraints LogicUploaded byRidwan Bin Adrian Tanjung
- Intro Analysis Ch2Uploaded byBatman
- ADA LAB PROGRAMS.docxUploaded byTECH INDIA
- 2_chapter_1Uploaded by陳信宏
- typeinstUploaded byinteresaaat
- Neutrosophic Triplet G-ModuleUploaded byAnonymous 0U9j6BLllB
- ThesesUploaded bytheresa.painter
- Boolean Algebra Part 2 April 73Uploaded byFareed Madeeya
- béziau_what is a logicUploaded bycesarfredericosantos
- 3642059481_3540212027FiniteUploaded byAlvaro Garnica Trujillo
- 1977 - A Reassessment of Boole's Theory of LogicUploaded byAsim Raza
- Neutrosophic quadruple algebraic hyperstructuresUploaded byAnonymous 0U9j6BLllB
- EC304Uploaded byapi-3853441
- 05941004Uploaded byAyappan Thirumalai
- 10.1.1.129Uploaded bygaudeamus13
- Number TheoryUploaded bytribhav

- Semester2Sesi20182019-Uploaded bythe3rd
- Semester2Sesi20182019-Uploaded bythe3rd
- JADUAL (Azihanafi)Uploaded bythe3rd
- 35329Uploaded bythe3rd
- Terma Dan SyaratUploaded bythe3rd
- Template UserUploaded bythe3rd
- RUBIC SCHEMEUploaded bythe3rd
- Template ResumeUploaded bythe3rd
- Tutorial 4Uploaded bythe3rd
- Semester2Sesi20182019-UTM031218Uploaded bythe3rd
- StoryboardUploaded bythe3rd
- Panduan CopywritingUploaded bythe3rd
- Term and condition SSMUploaded bythe3rd
- CompanyUploaded bythe3rd
- 1 (1)Uploaded bythe3rd
- StudentUploaded bythe3rd
- StudentUploaded bythe3rd
- Assignment 02 - AnswerUploaded bythe3rd
- sqlUploaded bythe3rd
- Tutorial 3 2006Uploaded bythe3rd
- commandUploaded bythe3rd
- Tutorial 1 2006Uploaded bythe3rd
- Database SQLUploaded bythe3rd
- log1Uploaded bythe3rd
- Student RecordUploaded bythe3rd
- Student RecordUploaded bythe3rd

- Inferenc-First Order Logic.docUploaded byalbertspade
- Theory of Computation - Regular Expressions and Regular Languages - SanfoundryUploaded bycompiler&automata
- recursionUploaded bytheresa.painter
- Compiler Lab Viva Quetions and AnswersUploaded byVasu Devan
- Weakest Precondition1 (1)Uploaded byKavin Motlani
- From Paraconsistent Logic to Universal Logic Jean-Yves BéziauUploaded byrcarturo
- COMPLETE LIST OF CATEGORICAL SYLLOGISMUploaded byQueennie Lara
- MetalógicaUploaded byCarlos Eduardo Correa Roque
- Arabic 44Uploaded byAlif Imanuddin
- Isaabelletutorial.pdfUploaded byc.m.tripathi
- A Comprehensive Book List for Advanced Study in TheUploaded byleandroio
- math 170 - project - part 1 (1)Uploaded byapi-241908362
- Logical Foundations of Computer ScienceUploaded bymaespinozas
- TOC 2 marks.docxUploaded bykrishnareddy56
- CD Course FileUploaded byVasu Devan
- Ch 3 ExercisesUploaded byDane Gardow
- Theory of AutomataUploaded byaniqa_bhutto8767
- Discrete Math Lesson _quizUploaded byjive_gumela
- PCDUploaded byAkash Vishal
- L5Uploaded byHarshini Tata
- hwsoln06.pdfUploaded byAhmad Suliman
- Back NaurUploaded byLeo Vásquez
- Propositional LogicUploaded byKhoy Bayron
- DFAUploaded byPraveen Raj
- topic01-propLogic.pdfUploaded byJung Jeon
- 2018 Week 02Uploaded bysuitup100
- Automata Exam 09Uploaded byMohammed Fadhl Albadwi
- 16368_15840-UNIT IVUploaded bySidharth Sundaresan
- CYK AlgorithmUploaded byFrancisco Freire
- Operator Precedence ParsingUploaded byk_suganthivasu