This article is a technical mathematical article in the area of predicate logic.
Rules are represented in the system by a notation called predicate logic.
The equality relation is often treated specially in first order logic and other predicate logics.
Languages with the full power of first-order predicate logic may be required for many tasks.
It is used to represent universal quantification in predicate logic.
This proof illustrates several properties of classical predicate logic that do not always agree with ordinary language.
The call returns a Prolog list, which can then be processed by the agent's own predicate logic.
For example, the English word "is" has three distinct meanings by predicate logic:
But dependent types can express arbitrary propositions in predicate logic.
These have expressive power equal to or exceeding standard first-order predicate logic.