Skip to main content
Side panel
Home
My Courses
Course Catalog
Help
Getting Started
Help Center & FAQ
Search
Close
Search
Toggle search input
Log in or Sign up
Home
My Courses
Course Catalog
Help
Getting Started
Help Center & FAQ
CS202: Discrete Structures
Sections
Course Introduction
Course Syllabus
Unit 1: Sets, Set Relations, and Set Functions
Unit 2: Counting Theory
Unit 3: Mathematical Logic
Unit 4: Mathematical Induction and Proofs
Unit 5: Probability
Unit 6: Recursion
Unit 7: Graphs
Unit 8: Trees
Unit 9: Finite-State Automata
Study Guide
Course Feedback Survey
Certificate Final Exam
Resources
Activities
Quizzes
Home
My programs
My certificates
CS202: Discrete Structures
Home
Courses
Course Catalog
Computer Science
CS202: Discrete Structures
Sections
Unit 3: Mathematical Logic
3.2: Truth Tables and Propositions Generated by a Set
Try It Now
Print book
Print this chapter
Back to '3.2: Truth Tables and Propositions Generated by a Set\'
Try It Now
Mark as completed
Work these exercises to see how well you understand this material.
Solutions
Answer:
Answer:
¬(
p
∧
r
) ∨
s
(
p
∨
q
) ∧ (
r
∨
q
)
Answer: 2
4
= 16 rows
Mark as completed
Previous
Jump to...
Jump to...
Course Syllabus
Set Notation and Relations
Notation
Try It Now
Basic Set Operations
Types of Sets
Try It Now
Cartesian Products and Power Sets
Try It Now
Summation Notation and Generalizations
Try It Now
Unit 1 Assessment
Introduction to the Rule of Products
Try It Now
Ordering Elements of a Set
Try It Now
Partitions and Addition Laws
Try It Now
Combinations and the Binomial Theorem
Try It Now
Unit 2 Assessment
Propositional Logic
Propositions and Logical Operators
Try It Now
Summary of Logic Notation
Truth Tables and Propositions Generated by a Set
Equivalence and Implication
Try It Now
The Laws of Logic
Try It Now
Unit 3 Assessment
Mathematical Systems
Direct Proof
Indirect Proof
Try It Now
Propositions and Truth Sets
Try It Now
Discussion and Examples
Strong Mathematical Induction
Try It Now
Unit 4 Assessment
Introduction to Discrete Probability
Sample Spaces, Events, and Their Probabilities
Try It Now
Complements, Intersections, and Unions
Try It Now
Conditional Probability
Independent Events
Try It Now
Unit 5 Assessment
Recursion Demystified
Recursive Definitions
Collected Definitions of Recursion
Explanation and Examples
Illustrating Recursion
Sequences and Recursion
The Many Faces of Recursion
Try It Now
Sequences
Try It Now
Predicting Data Sample Values
Unit 6 Assessment
Basic Graph Theory
Introduction to Graphs
Try It Now
Data Structures for Graphs
Try It Now
Connectivity
Try It Now
Traversals: Eulerian and Hamiltonian Graphs
Try It Now
Graph Optimization
Try It Now
Planarity and Colorings
Try It Now
Unit 7 Assessment
Quick Introduction to Trees
Formal Introduction to Trees
Try It Now
Overview of Spanning Trees
Detailed Discussion of Spanning Trees
Try It Now
Rooted Trees
Try It Now
Binary Trees
Try It Now
Unit 8 Assessment
Finite-State Machine Overview
More on Finite State Machines
State Machines
State Transition Diagrams
FSM States
FSM Examples
Putting the Basics to Use
Unit 9 Assessment
CS202 Study Guide
Course Feedback Survey
CS202: Certificate Final Exam
Next
