# Definition:Predicate Logic

(Redirected from Definition:First Order Logic)

Jump to navigation
Jump to search
## Definition

**Predicate logic** is a sub-branch of symbolic logic.

It is an extension of propositional logic in which the internal structure of simple statements is analyzed.

Thus in **predicate logic**, simple statements are no longer atomic.

The atoms of **predicate logic** are subjects and predicates of simple statements.

There are various formal systems allowing for rigid determination of the theorems of **predicate logic**:

Work In ProgressIn particular: yes, and they are...?You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by completing it.To discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{WIP}}` from the code. |

This article is complete as far as it goes, but it could do with expansion.In particular: Explain that "predicate logic" is in fact a family of languages, so more accurate to call it a predicate logic.You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding this information.To discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{Expand}}` from the code.If you would welcome a second opinion as to whether your work is correct, add a call to `{{Proofread}}` the page. |

## Also known as

**Predicate logic** is sometimes referred to as **first-order logic** or **first-order language**, sometimes unhyphenated as **first order**.

Similarly with propositional logic being referred to as **PropLog**, it is often abbreviated to **PredLog**.

## Also see

- Results about
**predicate logic**can be found**here**.

## Sources

- 1993: M. Ben-Ari:
*Mathematical Logic for Computer Science*... (previous) ... (next): Chapter $1$: Introduction: $\S 1.2$: Propositional and predicate calculus - 1996: H. Jerome Keisler and Joel Robbin:
*Mathematical Logic and Computability*... (previous) ... (next): Chapter $2$: Pure Predicate Logic