Propositional Logic

Propositional logic is the mathematics of two boolean values TRUE and FALSE and the five operators whose names with common pronunciations is:

  1. conjunction (and)
  2. disjunction (or)
  3. negation (not)
  4. implication (implies)
  5. equivalence (is equivalent to)

The equivalence operator is equality for Booleans. Equivalence implies equality but not the other way, for example we can say that but we can’t say that . In general, it’s better to use to assert that boolean expressions are being compared.

Sets

The concept of set is so fundamental that we don’t define it. We take as undefined concepts the notion of a set and the relation .

The most common operations on sets are

  1. Union
  2. Intersection
  3. Set difference
  4. Subset

Predicate Logic

Predicate Logic extends Propositional Logic with two operators:

  1. universal quantification (for all)
  2. existential quantification (there exists)

The quantification in the formulas and is said to be bounded since they are making statements about quantification inside set . Their unbounded counterparts are and which make statements about all .

It’s better to use bounded quantifications in specifications since they’re easier to read for both humans and tools alike.

generalizes conjunction, generalizes disjunction