Glossary (in beta)

Compiled defintions file download

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: Week0and1 Friday October 1 (Zoom)  }

antisymmetric relation {Definition}{Week(s) included: Week9 Monday November 22  }

applications of number representations {Learning outcome}

applying proof strategy {Learning outcome}

b

base expansion {Definition}{Week(s) included: Week0and1 Friday October 1 (Zoom)  }

bijection {Definition}{Week(s) included: Week8 Monday November 15  }

binary relation {Definition}{Week(s) included: Week9 Monday November 22  }

binary relations properties {Learning outcome}

bioinformatics {Application}

c

cardinality {Definition}{Week(s) included: Week8 Monday November 15  }

cardinality lower bound {Definition}{Week(s) included: Week8 Monday November 15  }

cardinality upper bound {Definition}{Week(s) included: Week8 Monday November 15  }

cartesian product {Definition}{Week(s) included: Week4 Monday October 18  }

circuits {Learning outcome}

classify cardinality {Learning outcome}

cnf and dnf {Learning outcome}

codes and information {Application}

compound proposition {Definition}{Week(s) included: Week3 Wednesday October 13  }

compound propositions and truth tables {Learning outcome}

compound propositions recursive {Definition}{Week(s) included: Week3 Wednesday October 13  }

computers {Application}

congruence mod n {Learning outcome}

consistency {Learning outcome}

contradiction proofs {Learning outcome}

countably infinite {Definition}{Week(s) included: Week8 Wednesday November 17  }

d

data types {Learning outcome}

definitions {Definition}{Week(s) included: Week0and1 Monday September 27  }

div and mod {Learning outcome}

divisibility and primes {Learning outcome}

dnf cnf {Definition}{Week(s) included: Week3 Monday October 11  }

e

equivalence class {Definition}{Week(s) included: Week9 Wednesday November 24  }

equivalence relation {Definition}{Week(s) included: Week9 Monday November 22  }

evaluating compound propositions {Learning outcome}

evidence for quantified statements {Learning outcome}

f

factoring {Definition}{Week(s) included: Week5 Friday October 29  }

finite sets {Definition}{Week(s) included: Week8 Monday November 15  }

fixed width {Definition}{Week(s) included: Week2 Monday October 4  }

fixed width fractional {Definition}{Week(s) included: Week2 Monday October 4  }

function and relation definitions {Learning outcome}

function properties {Learning outcome}

functions for cardinality {Learning outcome}

g

gcd {Definition}{Week(s) included: Week7 Friday November 12  }

graph representations of relations {Learning outcome}

h

hasse diagram {Definition}{Week(s) included: Week9 Monday November 22  }

i

identifying proof strategy in proof {Learning outcome}

important sets {Learning outcome}

induction flavors {Learning outcome}

injective function {Definition}{Week(s) included: Week8 Monday November 15  }

l

linked list append {Definition}{Week(s) included: Week6 Friday November 5  }

linked list length {Definition}{Week(s) included: Week6 Friday November 5  }

linked lists {Definition}{Week(s) included: Week6 Friday November 5  }

linked lists prepend {Definition}{Week(s) included: Week6 Friday November 5  }

linked lists {Learning outcome}

logic gates {Definition}{Week(s) included: Week2 Friday October 8  }

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: Week9 Monday November 22  }

partition {Definition}{Week(s) included: Week9 Wednesday November 24  }

predicate {Definition}{Week(s) included: Week4 Wednesday October 20  }

predicate truth set {Definition}{Week(s) included: Week4 Wednesday October 20  }

prime number {Definition}{Week(s) included: Week5 Friday October 29  }

proof signposts {Learning outcome}

q

quantification {Definition}{Week(s) included: Week4 Wednesday October 20  }

quantified statement proofs {Learning outcome}

quiz color rgb {Definition}{Week(s) included: Week0and1 Monday September 27  }

quiz linked list {Definition}{Week(s) included: Week6 Friday November 5  }

quiz prime formalizing {Definition}{Week(s) included: Week5 Friday October 29  }

quiz recursive {Definition}{Week(s) included: Week0and1 Monday September 27  }

r

rational numbers {Definition}{Week(s) included: Week7 Friday November 12  }

recommendation systems {Application}

recursive definitions {Learning outcome}

recursive sets {Definition}{Week(s) included: Week0and1 Monday September 27  }

reflexive relation {Definition}{Week(s) included: Week9 Monday November 22  }

representing numbers {Learning outcome}

rna rnalen basecount {Definition}{Week(s) included: Week4 Friday October 22  Week6 Monday November 1  }

s

sets equality subset {Definition}{Week(s) included: Week5 Monday October 25  }

special binary relations {Learning outcome}

strong induction proofs {Learning outcome}

structural induction proofs {Learning outcome}

surjective function {Definition}{Week(s) included: Week8 Monday November 15  }

symmetric relation {Definition}{Week(s) included: Week9 Monday November 22  }

t

tautologies and contradictions {Learning outcome}

trace algorithms {Learning outcome}

transitive relation {Definition}{Week(s) included: Week9 Monday November 22  }

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}