# Definition:Language of Arithmetic

Jump to navigation
Jump to search

This page has been identified as a candidate for refactoring of advanced complexity.In particular: complete review of structure, content and intent neededUntil this has been finished, please leave
`{{Refactor}}` in the code.
Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$.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 `{{Refactor}}` from the code. |

## Definition

A **language of arithmetic** is a signature for predicate logic consisting of:

- the binary operation symbols: $+$ and $\times$
- the unary function symbol: $s$
- the binary relation symbol: $<$
- the constant symbol: $0$

## Standard Interpretation

The standard interpretation for this language is the set of integers with:

- $+$: Integer addition
- $\times$: Integer multiplication
- $s$: the successor function
- $<$: the usual strict ordering on the integers
- $0$: interpreted as $0 \in \Z$

## Comment

This is just one of many different signatures that could claim to be the **language of arithmetic**.

## Sources

There are no source works cited for this page.Source citations are highly desirable, and mandatory for all definition pages.Definition pages whose content is wholly or partly unsourced are in danger of having such content deleted. To discuss this page in more detail, feel free to use the talk page. |