In propositional logic, sentences do not involve quantifiers; for example, De Morgan’s Laws are laws of propositional logic. Also known as predicate logic, first-order logic is an extension of propositional logic which permits quantifiers over elements; for example, (∀x∈ℝ)(∃y∈ℝ)(x + y = 0) states that every real number has an additive inverse. But the completeness axiom for ℝ, that every non-empty, bounded-above subset of ℝ has a supremum, necessarily involves quantification over subsets of ℝ, and so is a second-order sentence.