Problem Set 1: Logic & Sets
Work each problem on your own paper or in a markdown file. Show your reasoning: full credit requires a justified argument, not just a final answer.
Notation reminder: (and), (or), (not), (implies), (iff), (for all), (there exists).
Problem 1: Truth Table
Construct a truth table for the following expression and determine whether it is a tautology, contradiction, or contingency:
Problem 2: Logical Equivalence
Use the laws of logical equivalence (not a truth table) to show that:
Label each step with the name of the law used (e.g. De Morgan's, distribution, double negation).
Problem 3: Quantifier Negation
Rewrite the negation of each statement so that the symbol appears only immediately before a predicate.
(a) $\forall x \in \mathbb{Z},; (x > 0 \Rightarrow x^2 > 0)$
(b) $\exists n \in \mathbb{N},; \forall m \in \mathbb{N},; n < m$
(c) $\forall \epsilon > 0,; \exists \delta > 0,; \forall x \in \mathbb{R},; (|x - a| < \delta \Rightarrow |f(x) - L| < \epsilon)$
Problem 4: Set Identities
Let be subsets of a universal set . Prove each identity. You may use a set-builder / element-chasing argument or the algebra of sets.
(a)
(b)
Problem 5: Power Set & Cardinality
Let and .
(a) List the elements of . How many are there? State the general formula for when .
(b) List the elements of . Confirm that .
(c) True or false, with justification: .
Problem 6: Inclusion-Exclusion
In a class of students:
- are enrolled in Discrete Math
- are enrolled in Linear Algebra
- are enrolled in both
Let be the set of Discrete Math students and the set of Linear Algebra students.
(a) Compute using the identity .
(b) How many students are enrolled in neither course?
(c) Draw a labeled Venn diagram that reflects your answer.
Submission
- Place your solutions in
problem-set-1.md(or.pdfif you prefer to write by hand and scan). - Cite any theorem or identity you invoke by name.
- Acceptable use of LLM assistance: see the course syllabus. In short, you may use LLMs to explore ideas but every submitted step must be one you can reconstruct and defend on paper.