0.1
Three traditionally central areas of the theory of computation: automata, computability and complexity.
0.2
Equivalence relation: reflexive,symmetric,transitive
Boolean Logic: negation, conjunction, disjunction
0.3
Theorem: a mathematical statement that proved true.
Lemma: a statement that assists the proof of another, more significant statement.
Corollary: A statement that follows with little or no proof required from one already proven.
0.4
Proof by construction
Proof by contradiction
Proof by induction
本文地址：http://com.8s8s.com/it/it35938.htm