Axiomatic system

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics and logic, an axiomatic system or axiom system is a standard type of deductive logical structure, used also in theoretical computer science. It consists of a set of formal statements known as axioms that are used for the logical deduction of other statements. In mathematics these logical consequences of the axioms may be known as lemmas or theorems. A mathematical theory is an expression used to refer to an axiomatic system and all its derived theorems.

A proof within an axiomatic system is a sequence of deductive steps that establishes a new statement as a consequence of the axioms. By itself, the system of axioms is, intentionally, a syntactic construct: when axioms are expressed in natural language, which is normal in books and technical papers, the nouns are intended as placeholder words. The use of an axiomatic approach is a move away from informal reasoning, in which nouns may carry real-world semantic values, and towards formal proof.

In a fully formal setting, a logical system such as predicate calculus must be used in the proofs. The contemporary application of formal axiomatic reasoning differs from traditional methods both in the exclusion of semantic considerations, and in the specification of the system of logic in use.

In mathematics and logic, an axiomatic system or axiom system is a standard type of deductive logical structure, used also in theoretical computer science. It consists of a set of formal statements known as axioms that are used for the logical deduction of other statements. In mathematics these logical consequences of the axioms may be known as lemmas or theorems. A mathematical theory is an expression used to refer to an axiomatic system and all its derived theorems.

A proof within an axiomatic system is a sequence of deductive steps that establishes a new statement as a consequence of the axioms. By itself, the system of axioms is, intentionally, a syntactic construct: when axioms are expressed in natural language, which is normal in books and technical papers, the nouns are intended as placeholder words. The use of an axiomatic approach is a move away from informal reasoning, in which nouns may carry real-world semantic values, and towards formal proof.

In a fully formal setting, a logical system such as predicate calculus must be used in the proofs. The contemporary application of formal axiomatic reasoning differs from traditional methods both in the exclusion of semantic considerations, and in the specification of the system of logic in use.

Discussion of axiomatic systems

In mathematics, axiomatization is the process of taking a body of knowledge and working backwards towards its axioms. It 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. Axiomatization typically involves choices, and once a theory is axiomatic, it may be possible to change the set of axioms without affecting the mathematical results implied.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1370604942 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

38 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.