Scribd
Upload
1K views10 pages

Chapter I - Symbolic Logic - Exercises

This document contains 9 exercises on symbolic logic from the Chapter 1 of a Mathematics I course. The exercises involve constructing truth tables, translating statements to symbolic logic, and expressing statements quantitatively. They cover topics like propositional logic, quantifiers, and set theory.

Uploaded by

Mai Thanh Tùng
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
1K views10 pages

Chapter I - Symbolic Logic - Exercises

This document contains 9 exercises on symbolic logic from the Chapter 1 of a Mathematics I course. The exercises involve constructing truth tables, translating statements to symbolic logic, and expressing statements quantitatively. They cover topics like propositional logic, quantifiers, and set theory.

Uploaded by

Mai Thanh Tùng
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Symbolic logics - Exercises

NGUYEN CANH Nam1


1 Faculty of Applied Mathematics Department of Applied Mathematics and Informatics Hanoi University of Technologies [email protected]

HUT - 2010

NGUYEN CANH Nam

Mathematics I - Chapter 1 - Exercises

Exercise 1

Determine the truth table of the following composite propositions and state whether they are tautologies, contradictions or indeterminates? a) (p q) (p q) b) (p q) (p q)

NGUYEN CANH Nam

Mathematics I - Chapter 1 - Exercises

Exercise 2

Construct a truth table for each of these compound proposition a) (p q) (p q) b) (p q) (p q) c) (p q) (p q) d) (p q) (p q)

NGUYEN CANH Nam

Mathematics I - Chapter 1 - Exercises

Exercise 3

Construct a truth table for each of these compound proposition a) p (q r ) b) p (q r ) c) (p q) (p r ) d) (p q) (p r ) e) (p q) (q r ) f) (p q) (q r )

NGUYEN CANH Nam

Mathematics I - Chapter 1 - Exercises

Exercise 4

Write a logically equivalent statement using NOT, AND and OR. a) (p q) b) (p q) r

NGUYEN CANH Nam

Mathematics I - Chapter 1 - Exercises

Exercise 5

Let P(x) be the statement "x spends more than ve hours every weekday in class", where the domain for x consists of all students. Express each of these quantications in English a) x, P(x) b) x, P(x) c) x, P(x) d) x, P(x)

NGUYEN CANH Nam

Mathematics I - Chapter 1 - Exercises

Exercise 6

Translate these statement into English, where C(x) is "x is a comedian" and F (x) is "x is funny" and the domain consists of all people a) x, C(x) F (x) b) x, C(x) F (x) c) x, C(x) F (x) d) x, C(x) F (x)

NGUYEN CANH Nam

Mathematics I - Chapter 1 - Exercises

Exercise 7
Let P(x) be the statement "x can speak French" and let Q(x) be the statement "x knows the computer language C++". Express each of these sentences in term of P(x), Q(x), quantiers and logical operators. The domain for quantiers consists of all students at your school. a) There is a student at your school who can speak French and who knows C++ b) There is a student at your school who can speak French but who doesnt know C++ c) Every student at your school either can speak French or knows C++ d) No student at your school can speak French or knows C++

NGUYEN CANH Nam

Mathematics I - Chapter 1 - Exercises

Exercise 8
Let L(x, y ) be the statement "x loves y ", where the domain for both x and y consists of all people in the world. Use quantiers to express each of these sentences a) Everybody loves Minh. b) Everybody loves somebody. c) There is somebody whom everybody loves. d) Nobody loves everybody. e) There is somebody whom Lan does not love. f) There is somebody whom no one loves. g) There is exactly one person whom everybody loves. h) There are exactly two people whom Hanh loves. i) Everyone loves himself or herself. j) There is someone who loves nobody besides himself or herself.
NGUYEN CANH Nam Mathematics I - Chapter 1 - Exercises

Exercise 9

To express the following proposition by symbolic logics: For subset A of IR , "m is called inmum of A, denoted by m = inf(A), if for all x in A, we have x isnt smaller as m and for all real number n, if x isnt smaller as n for all x in A then m isnt smaller as n".

NGUYEN CANH Nam

Mathematics I - Chapter 1 - Exercises

You might also like