ARCHIVED Discrete Math for CS

Overview Overview
S
Model systems Model systems
T
Translate Translate
L
Propositional and predicate logic Propositional and predicate logic
P
Proof strategies and valid arguments Proof strategies and valid arguments
I
Recursion and Induction Recursion and Induction
M
Modular Arithmetic Modular Arithmetic
U
Use language conventions to improve arguments Use language conventions to improve arguments
N
Mathematical definitions and notation Mathematical definitions and notation

ARCHIVED Discrete Math for CS × Overview Model systems Translate Propositional and predicate logic Proof strategies and valid arguments Recursion and Induction Modular Arithmetic Use language conventions to improve arguments Mathematical definitions and notation

Proof strategies and valid arguments

Learning Goal

Apply proof strategies, including direct proofs and proofs by contradiction, and determine whether a proposed argument is valid or not.

Subtopics