- Mastery
- Sets
- Propositions
- Predicates
- Propositional logic inference rules
- Familiarity
- Quantified predicate forms
- Quantifier equivalences
- Finite state machines
- Regular expressions
- Relations
- Partial orderings
- Equivalence relations
- Countably infinite sets
- Strings on finite alphabets
- Exposure
- Graphs
- Uncountably infinite sets
- Turing machines
|
- Mastery
- Defining sets via set-builder notation based on properties
- Translating English statements into propositional and predicate forms
- Direct inference proofs
- Contrapositive proofs
- Proofs by contradiction
- Induction proofs
- Familiarity
- Creating rigorous definitions for relations
- Specifying transition functions
- Specifying grammars by regular expressions
- Word problems to graph problems
- Exposure
- Working From Requirements Specifications.
- Working With Large Systems
- Development Of Suitable Processes
|
