Scribd
Upload
31 views1 page

Tut 1

This document contains a tutorial sheet with 6 problems covering propositional logic: 1. Determine if (¬q ∧ (p → q)) → ¬p is a tautology. 2. Show that ¬(p ↔ q) and ¬p ↔ q are logically equivalent. 3. Analyze statements about the number of false statements in a list with 100 or 99 statements. 4. Show that collections of logical operators including negation, conjunction, and disjunction are functionally complete. 5. Determine the number of possible truth tables for compound propositions with variables p and q. 6. For given sequences of propositions, determine the sequences of

Uploaded by

ankur.gupta
Copyright
© © All Rights Reserved
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
31 views1 page

Tut 1

This document contains a tutorial sheet with 6 problems covering propositional logic: 1. Determine if (¬q ∧ (p → q)) → ¬p is a tautology. 2. Show that ¬(p ↔ q) and ¬p ↔ q are logically equivalent. 3. Analyze statements about the number of false statements in a list with 100 or 99 statements. 4. Show that collections of logical operators including negation, conjunction, and disjunction are functionally complete. 5. Determine the number of possible truth tables for compound propositions with variables p and q. 6. For given sequences of propositions, determine the sequences of

Uploaded by

ankur.gupta
Copyright
© © All Rights Reserved
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/ 1

Tutorial Sheet 1

27, 29, 30 July

1. Determine whether (¬𝑞 ∧ (𝑝 → 𝑞)) → ¬𝑝) is a tautology.


2. Show that ¬(𝑝 ↔ 𝑞) and ¬𝑝 ↔ 𝑞 are logically equivalent.
3. The nth statement in a list of 100 statements is “Exactly n of the statements in this list are false.”
a. What conclusions can you draw from these statements?
b. Answer part (a) if the nth statement is “At least n of the statements in this list are false.”
c. Answer part (b) assuming that the list contains 99 statements.
4. A collection of logical operators is called functionally complete if every compound proposition is logically
equivalent to a compound proposition involving only these logical operators.
a. Show that ¬, ∧, and ∨ form a functionally complete collection of logical operators.
b. Show that ¬ and ∧ form a functionally complete collection of logical operators. [Hint: First use a De
Morgan law to show that p ∨ q is logically equivalent to ¬(¬p ∧¬q).]
c. Show that ¬ and ∨ form a functionally complete collection of logical operators.
5. How many different truth tables of compound propositions are there that involve the propositional variables p
and q?
6. Teachers in the Middle Ages supposedly tested the realtime propositional logic ability of a student via a
technique known as an obligato game. In an obligato game, a number of rounds is set and in each round the
teacher gives the student successive assertions that the student must either accept or reject as they are given.
When the student accepts an assertion, it is added as a commitment; when the student rejects an assertion its
negation is added as a commitment. The student passes the test if the consistency of all commitments is
maintained throughout the test.
a. Suppose that in a three-round obligato game, the teacher first gives the student the proposition 𝑝 → 𝑞,
then the proposition ¬(𝑝 ∨ 𝑟) ∨ 𝑞, and finally the proposition 𝑞. For which of the eight possible
sequences of three answers will the student pass the test?
b. Suppose that in a four-round obligato game, the teacher first gives the student the proposition
¬(𝑝 → (𝑞 ∧ 𝑟)), then the proposition 𝑝 ∨ ¬𝑞, then the proposition ¬𝑟, and finally, the proposition
(𝑝 ∧ 𝑟) ∨ (𝑞 → 𝑝). For which of the 16 possible sequences of four answers will the student pass the
test?
c. Explain why every obligato game has a winning strategy.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy