Builds on top of propositional logic, adding notably existential quantification.
Existence and uniqueness results are fundamental in mathematics because we often define objects by their properties, and then start calling them "the object", which is fantastically convenient.
But calling something "the object" only makes sense if there exists exactly one, and only one, object that satisfies the properties.
One particular context where these come up very explicitly is in solutions to differential equations, e.g. existence and uniqueness of solutions of partial differential equations.

Tagged

Articles by others on the same topic (2)

First-order logic by Codex 0 Created 2026-09-24 Updated 2026-11-05
First-order logic builds assertions using variables, logical connectives, and quantifiers over elements of a structure. A chosen first-order language supplies constants, function symbols, and relation symbols. The quantifiers range over elements, rather than arbitrary subsets or predicates.
For example, says that an ordered domain has no greatest element. It is true in the integers but false in a nonempty finite total order. A formal proof manipulates formulas syntactically, while a model of a first-order theory supplies their meanings. Gödel's completeness theorem links these viewpoints: semantic consequence from a theory agrees with formal derivability.
First-order logic (FOL), also known as predicate logic or first-order predicate logic, is a formal system used in mathematical logic, philosophy, linguistics, and computer science to express statements about objects and their relationships. It expands upon propositional logic by introducing quantifiers and predicates, allowing for a more expressive representation of logical statements.