Practice Example Of Representing Statements (9.3) - Rules of Inferences in Predicate Logic - part A

Practice: Example of Representing Statements

Lesson 9.3Rules of Inferences in Predicate Logic - part A

Practise this section

9 questions

Flashcard drill
4 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Translate 'Every bird in the park can fly' into predicate logic.
Show hintHide hint
Consider how 'every' indicates universal quantification.
Question 2.
What does the notation ∃x (C(x) ∧ S(x)) represent?
Show hintHide hint
Look for 'some' to guide you to existential quantification.
3Question 3.
What does the expression ∀x (S(x) → C(x)) signify?
- Some students have studied calculus.
- All students in CS201 have studied calculus.
- No students in CS201 have studied calculus.
Show hintHide hint
Recall the meaning of 'for all' in logic.
4Question 4.
True or False: The expression ∃x (S(x) ∧ C(x)) can be true even if no students have studied calculus.
- True
- False
Show hintHide hint
Consider how 'some' applies in logic contexts.
Question 5.
Determine the logical expression for 'All animals in the zoo can swim if they are mammals.'
Show hintHide hint
Focus on the logical relation indicated by the word 'if'.
Question 6.
If no cats can climb trees translates to 'No cat is a tree climber,' express it in logical notation.
Show hintHide hint
Identify the logical structure in the original statement.

5 more questions in this section. Enroll free to practise them all.