# Definition:Minimal Arithmetic

Jump to navigation
Jump to search

## Definition

**Minimal arithmetic** is the set $Q$ of theorems of the recursive set of sentences in the language of arithmetic containing exactly:

\((\text M 1)\) | $:$ | \(\ds \forall x:\) | \(\ds \map s x \ne 0 \) | ||||||

\((\text M 2)\) | $:$ | \(\ds \forall x, y:\) | \(\ds \map s x = \map s y \implies x = y \) | ||||||

\((\text M 3)\) | $:$ | \(\ds \forall x:\) | \(\ds x + 0 = x \) | ||||||

\((\text M 4)\) | $:$ | \(\ds \forall x, y:\) | \(\ds x + \map s y = \map s {x + y} \) | ||||||

\((\text M 5)\) | $:$ | \(\ds \forall x:\) | \(\ds x \cdot 0 = 0 \) | ||||||

\((\text M 6)\) | $:$ | \(\ds \forall x, y:\) | \(\ds x \cdot \map s y = \paren {x \cdot y} + x \) | ||||||

\((\text M 7)\) | $:$ | \(\ds \forall x:\) | \(\ds \neg x < 0 \) | ||||||

\((\text M 8)\) | $:$ | \(\ds \forall x, y:\) | \(\ds x < \map s y \iff \paren {x < y \lor x = y} \) | ||||||

\((\text M 9)\) | $:$ | \(\ds \forall x:\) | \(\ds 0 < x \iff x \ne 0 \) | ||||||

\((\text M 10)\) | $:$ | \(\ds \forall x, y:\) | \(\ds \map s x < y \iff \paren {x < y \land y \ne \map s x} \) |

## Note

This page has been identified as a candidate for refactoring.In particular: See our house policy concerning notesUntil 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. |

These are just the usual axioms of arithmetic, except for the inductive axioms.

Note in particular that this is a finite list.

## 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. |