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  }

applications of number representations {Learning outcome}

applying proof strategy {Learning outcome}

b

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

binary relations properties {Learning outcome}

bioinformatics {Application}

c

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: Propositional Logic and 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}

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: Propositional Logic and Logical Equivalence  }

e

evaluating compound propositions {Learning outcome}

evidence for quantified statements {Learning outcome}

f

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

graph representations of relations {Learning outcome}

h

i

identifying proof strategy in proof {Learning outcome}

important sets {Learning outcome}

induction flavors {Learning outcome}

l

linked lists {Learning outcome}

logic gates {Definition}{Week(s) included: Week3 Week 3 Wednesday: 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

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  }

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 recursive {Definition}{Week(s) included: Week1 Week 1 Friday: Defining functions  }

r

recommendation systems {Application}

recursive definitions {Learning outcome}

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

representing numbers {Learning outcome}

rna rnalen basecount {Definition}{Week(s) included: Week4 Week 4 Wednesday: Predicates and Quantifiers  }

s

special binary relations {Learning outcome}

strong induction proofs {Learning outcome}

structural induction proofs {Learning outcome}

t

tautologies and contradictions {Learning outcome}

trace algorithms {Learning outcome}

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}