A formula is in its normal form when it has been simplified to a canonical representation according to a specific set of rules, and no further rewrite can be applied using those rules. Examples Propositional Logic negation normal form conjunctive normal form disjunctive normal form Predicate Logic Prenex normal form Related normal forms (database)