A modal logic is normal if it obeys (K) and (N). Important properties for all α, are that [α] distributes over the conjunction ∧, and the rule of monotony, which permits from A → B to infer [α]A → [α]B, can be proven. Finally, PDL is the least normal modal logic containing every instance of the following axiom schemas 