This is a short list of logical symbols that appear in Michael Sipser's book Introduction to the Theory of Computation.
Name | Symbol | Description |
---|---|---|
Alphabetical Set | Σ or Γ | Often used to designate a set containing an alphabet. |
Boolean Conjunction | ∧ | If both values surrounding ∧ are true, then the result is true (AND). |
Boolean Disjunction | ∨ | If both values surrounding ∨ are opposites, then the result is true (OR). |
Boolean Equality | ⇔ | If both values surrounding ⇔ have the same value, then the result is true. |