# Glossary

# a | b | c | d | e | f | g | h | i | l | m | n | p | q | r | s | t | u | v | w

# a

algorithm {Definition}{Week(s) included: Week2 Week 2 Wednesday: Representing numbers }

antisymmetric relation {Definition}{Week(s) included: Week9 Week 9 Wednesday: Binary relations }

applications of number representations {Learning outcome}

applying proof strategy {Learning outcome}

# b

base expansion {Definition}{Week(s) included: Week2 Week 2 Wednesday: Representing numbers }

bijection {Definition}{Week(s) included: Week8 Week 8 Monday: Cardinality of Sets }

binary relation {Definition}{Week(s) included: Week9 Week 9 Wednesday: Binary relations }

binary relations properties {Learning outcome}

bioinformatics {Application}

# c

cardinality {Definition}{Week(s) included: Week8 Week 8 Wednesday and Friday: Finite, countably infinite, and uncountable sets }

cardinality lower bound {Definition}{Week(s) included: Week8 Week 8 Monday: Cardinality of Sets }

cardinality upper bound {Definition}{Week(s) included: Week8 Week 8 Monday: Cardinality of Sets }

cartesian product {Definition}{Week(s) included: Week5 }

circuits {Learning outcome}

classify cardinality {Learning outcome}

cnf and dnf {Learning outcome}

codes and information {Application}

compound proposition {Definition}{Week(s) included: Week3 Week 3 Friday: Logical Equivalence }

compound propositions and truth tables {Learning outcome}

compound propositions recursive {Definition}{Week(s) included: Week4 Week 4 Monday: Conditionals and Logical Equivalence }

computers {Application}

congruence mod n {Learning outcome}

consistency {Learning outcome}

contradiction proofs {Learning outcome}

countably infinite {Definition}{Week(s) included: Week8 Week 8 Wednesday and Friday: Finite, countably infinite, and uncountable sets }

# d

data types {Learning outcome}

functions prereqs {Definition}{Week(s) included: Week1 Week 1 Friday: Defining functions }

set prereqs {Definition}{Week(s) included: Week1 Week 1 Wednesday: Defining sets }

div and mod {Learning outcome}

divisibility and primes {Learning outcome}

dnf cnf {Definition}{Week(s) included: Week3 Week 3 Friday: Logical Equivalence }

# e

equivalence class {Definition}{Week(s) included: Week10 Week 10 Monday: Equivalence Relations and Partial Orders }

equivalence relation {Definition}{Week(s) included: Week10 Week 10 Monday: Equivalence Relations and Partial Orders }

evaluating compound propositions {Learning outcome}

evidence for quantified statements {Learning outcome}

# f

factoring {Definition}{Week(s) included: Week6 Week 6 Monday: Proofs for properties of sets and numbers }

finite sets {Definition}{Week(s) included: Week8 Week 8 Monday: Cardinality of Sets }

fixed width {Definition}{Week(s) included: Week2 Week 2 Friday: Algorithms for numbers }

fixed width fractional {Definition}{Week(s) included: Week2 Week 2 Friday: Algorithms for numbers }

function and relation definitions {Learning outcome}

function properties {Learning outcome}

functions for cardinality {Learning outcome}

# g

gcd {Definition}{Week(s) included: Week7 Week 7 Friday: Proof by Contradiction }

graph representations of relations {Learning outcome}

# h

hasse diagram {Definition}{Week(s) included: Week10 Week 10 Monday: Equivalence Relations and Partial Orders }

# i

identifying proof strategy in proof {Learning outcome}

important sets {Learning outcome}

induction flavors {Learning outcome}

injective function {Definition}{Week(s) included: Week8 Week 8 Monday: Cardinality of Sets }

# l

linked list append {Definition}{Week(s) included: Week7 Week 7 Wednesday: Recursive Data Structures }

linked list length {Definition}{Week(s) included: Week7 Week 7 Wednesday: Recursive Data Structures }

linked lists {Definition}{Week(s) included: Week7 Week 7 Wednesday: Recursive Data Structures }

linked lists prepend {Definition}{Week(s) included: Week7 Week 7 Wednesday: Recursive Data Structures }

linked lists {Learning outcome}

logic gates {Definition}{Week(s) included: Week3 Week 3 Monday: Fixed-width Addition and Circuits }

logical equivalence via laws {Learning outcome}

logical equivalence via truth tables {Learning outcome}

logical structure to proof strategy {Learning outcome}

# m

mathematical induction proofs {Learning outcome}

modeling clusters {Learning outcome}

# n

numbers {Application}

# p

partial order {Definition}{Week(s) included: Week10 Week 10 Monday: Equivalence Relations and Partial Orders }

partition {Definition}{Week(s) included: Week10 Week 10 Monday: Equivalence Relations and Partial Orders }

predicate {Definition}{Week(s) included: Week4 Week 4 Wednesday: Predicates and Quantifiers }

predicate truth set {Definition}{Week(s) included: Week4 Week 4 Wednesday: Predicates and Quantifiers }

prime number {Definition}{Week(s) included: Week6 Week 6 Monday: Proofs for properties of sets and numbers }

proof signposts {Learning outcome}

# q

quantification {Definition}{Week(s) included: Week4 Week 4 Wednesday: Predicates and Quantifiers }

quantified statement proofs {Learning outcome}

quiz color rgb {Definition}{Week(s) included: Week1 Week 1 Friday: Defining functions }

quiz color rgb data types {Definition}{Week(s) included: Week1 Week 1 Friday: Defining functions }

quiz linked list {Definition}{Week(s) included: Week7 Week 7 Friday: Proof by Contradiction }

quiz prime formalizing {Definition}{Week(s) included: Week6 Week 6 Friday: Structural and Mathematical Induction }

quiz recursive {Definition}{Week(s) included: Week1 Week 1 Friday: Defining functions }

# r

rational numbers {Definition}{Week(s) included: Week7 Week 7 Friday: Proof by Contradiction }

recommendation systems {Application}

recursive definitions {Learning outcome}

recursive sets {Definition}{Week(s) included: Week1 Week 1 Wednesday: Defining sets }

reflexive relation {Definition}{Week(s) included: Week9 Week 9 Wednesday: Binary relations }

representing numbers {Learning outcome}

rna rnalen basecount {Definition}{Week(s) included: Week5 Week 5 Monday: Nested Quantifiers Week4 Week 4 Wednesday: Predicates and Quantifiers Week6 Week 6 Wednesday: Structural Induction }

# s

sets equality subset {Definition}{Week(s) included: Week5 Week 5 Wednesday: Proof Strategies and Sets }

special binary relations {Learning outcome}

strong induction proofs {Learning outcome}

structural induction proofs {Learning outcome}

surjective function {Definition}{Week(s) included: Week8 Week 8 Monday: Cardinality of Sets }

symmetric relation {Definition}{Week(s) included: Week9 Week 9 Wednesday: Binary relations }

# t

tautologies and contradictions {Learning outcome}

trace algorithms {Learning outcome}

transitive relation {Definition}{Week(s) included: Week9 Week 9 Wednesday: Binary relations }

translating {Learning outcome}

truth table definitions {Learning outcome}

# u

universal generalization {Learning outcome}

using proofs to evaluate {Learning outcome}

# v

variants of conditionals {Learning outcome}

# w

write set definition {Learning outcome}