# Axiomatic system

This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. (March 2013) (Learn how and when to remove this template message) |

In mathematics, an **axiomatic system** is any set of axioms from which some or all axioms can be used in conjunction to logically derive theorems. A theory consists of an axiomatic system and all its derived theorems. An axiomatic system that is completely described is a special kind of formal system. A formal theory typically means an axiomatic system, for example formulated within model theory. A formal proof is a complete rendition of a mathematical proof within a formal system.

## Contents

## PropertiesEdit

An axiomatic system is said to be *consistent* if it lacks contradiction, i.e. the ability to derive both a statement and its denial from the system's axioms.

In an axiomatic system, an axiom is called *independent* if it is not a theorem that can be derived from other axioms in the system. A system will be called independent if each of its underlying axioms is independent. Although independence is not a necessary requirement for a system, consistency usually is, but see neutrosophic logic.

An axiomatic system will be called *complete* if for every statement, either itself or its negation is derivable.

## Relative consistencyEdit

Beyond consistency, relative consistency is also the mark of a worthwhile axiom system. This is when the undefined terms of a first axiom system are provided definitions from a second, such that the axioms of the first are theorems of the second.

A good example is the relative consistency of neutral geometry or absolute geometry with respect to the theory of the real number system. Lines and points are undefined terms in absolute geometry, but assigned meanings in the theory of real numbers in a way that is consistent with both axiom systems.

## ModelsEdit

A **model** for an axiomatic system is a well-defined set, which assigns meaning for the undefined terms presented in the system, in a manner that is correct with the relations defined in the system. The existence of a **concrete model** proves the consistency of a system. A model is called **concrete** if the meanings assigned are objects and relations from the real world^{[clarification needed]}}, as opposed to an **abstract model** which is based on other axiomatic systems.

Models can also be used to show the independence of an axiom in the system. By constructing a valid model for a subsystem without a specific axiom, we show that the omitted axiom is independent if its correctness does not necessarily follow from the subsystem.

Two models are said to be isomorphic if a one-to-one correspondence can be found between their elements, in a manner that preserves their relationship. An axiomatic system for which every model is isomorphic to another is called **categorial** (sometimes categorical), and the property of categoriality (categoricity) ensures the completeness of a system.

## Axiomatic methodEdit

Stating definitions and propositions in a way such that each new term can be formally eliminated by the priorly introduced terms requires primitive notions (axioms) to avoid infinite regress. This way of doing mathematics is called the **axiomatic method**.^{[1]}

A common attitude towards the axiomatic method is logicism. In their book *Principia Mathematica*, Alfred North Whitehead and Bertrand Russell attempted to show that all mathematical theory could be reduced to some collection of axioms. More generally, the reduction of a body of propositions to a particular collection of axioms underlies the mathematician's research program. This was very prominent in the mathematics of the twentieth century, in particular in subjects based around homological algebra.

The explication of the particular axioms used in a theory can help to clarify a suitable level of abstraction that the mathematician would like to work with. For example, mathematicians opted that rings need not be commutative, which differed from Emmy Noether's original formulation. Mathematicians decided to consider topological spaces more generally without the separation axiom which Felix Hausdorff originally formulated.

The Zermelo-Fraenkel axioms, the result of the axiomatic method applied to set theory, allowed the "proper" formulation of set-theory problems and helped to avoid the paradoxes of naïve set theory. One such problem was the Continuum hypothesis. Zermelo–Fraenkel set theory with the historically controversial axiom of choice included is commonly abbreviated ZFC, where C stands for choice. Many authors use ZF to refer to the axioms of Zermelo–Fraenkel set theory with the axiom of choice excluded. Today ZFC is the standard form of axiomatic set theory and as such is the most common foundation of mathematics.

### HistoryEdit

Mathematical methods developed to some degree of sophistication in ancient Egypt, Babylon, India, and China, apparently without employing the axiomatic method.

Euclid of Alexandria authored the earliest extant axiomatic presentation of Euclidean geometry and number theory. Many axiomatic systems were developed in the nineteenth century, including non-Euclidean geometry, the foundations of real analysis, Cantor's set theory, Frege's work on foundations, and Hilbert's 'new' use of axiomatic method as a research tool. For example, group theory was first put on an axiomatic basis towards the end of that century. Once the axioms were clarified (that inverse elements should be required, for example), the subject could proceed autonomously, without reference to the transformation group origins of those studies.

### IssuesEdit

Not every consistent body of propositions can be captured by a describable collection of axioms. Call a collection of axioms recursive if a computer program can recognize whether a given proposition in the language is an axiom. Gödel's First Incompleteness Theorem then tells us that there are certain consistent bodies of propositions with no recursive axiomatization. Typically, the computer can recognize the axioms and logical rules for deriving theorems, and the computer can recognize whether a proof is valid, but to determine whether a proof exists for a statement is only soluble by "waiting" for the proof or disproof to be generated. The result is that one will not know which propositions are theorems and the axiomatic method breaks down. An example of such a body of propositions is the theory of the natural numbers. The Peano Axioms (described below) thus only partially axiomatize this theory.

In practice, not every proof is traced back to the axioms. At times, it is not clear which collection of axioms a proof appeals to. For example, a number-theoretic statement might be expressible in the language of arithmetic (i.e. the language of the Peano Axioms) and a proof might be given that appeals to topology or complex analysis. It might not be immediately clear whether another proof can be found that derives itself solely from the Peano Axioms.

Any more-or-less arbitrarily chosen system of axioms is the basis of some mathematical theory, but such an arbitrary axiomatic system will not necessarily be free of contradictions, and even if it is, it is not likely to shed light on anything. Philosophers of mathematics sometimes assert that mathematicians choose axioms "arbitrarily", but it is possible that although they may appear arbitrary when viewed only from the point of view of the canons of deductive logic, that appearance is due to a limitation on the purposes that deductive logic serves.

### Example: The Peano axiomatization of natural numbersEdit

The mathematical system of natural numbers 0, 1, 2, 3, 4, ... is based on an axiomatic system first written down by the mathematician Peano in 1889. He chose the axioms, in the language of a single unary function symbol *S* (short for "successor"), for the set of natural numbers to be:

- There is a natural number 0.
- Every natural number
*a*has a successor, denoted by*Sa*. - There is no natural number whose successor is 0.
- Distinct natural numbers have distinct successors: if
*a*≠*b*, then*Sa*≠*Sb*. - If a property is possessed by 0 and also by the successor of every natural number it is possessed by, then it is possessed by all natural numbers ("
*Induction axiom*").

### AxiomatizationEdit

In mathematics, **axiomatization** is the formulation of a system of statements (i.e. axioms) that relate a number of primitive terms in order that a consistent body of propositions may be derived deductively from these statements. Thereafter, the proof of any proposition should be, in principle, traceable back to these axioms.

## See alsoEdit

- List of logic systems
- Axiom schema
- Gödel's incompleteness theorem
- Hilbert-style deduction system
- Logicism
- Zermelo–Fraenkel set theory, an axiomatic system for set theory and today's most common foundation for mathematics.

## ReferencesEdit

**^**"*Set Theory and its Philosophy, a Critical Introduction" S.6; Michael Potter, Oxford, 2004*

- Hazewinkel, Michiel, ed. (2001) [1994], "Axiomatic method",
*Encyclopedia of Mathematics*, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4 - Eric W. Weisstein,
*Axiomatic System*, From MathWorld—A Wolfram Web Resource. Mathworld.wolfram.com & Answers.com