Axiom schema

In mathematical logic, an axiom schema generalizes the notion of axiom.

An axiom schema is a formula in the language of an axiomatic system, in which one or more schematic variables appear. These variables, which are metalinguistic constructs, stand for any term or subformula of the system, which may or may not be required to satisfy certain conditions. Often, such conditions require that certain variables be free, or that certain variables not appear in the subformula or term.

Given that the number of possible subformulas or terms that can be inserted in place of a schematic variable is countably infinite, an axiom schema stands for a countably infinite set of axioms. This set can usually be defined recursively. A theory that can be axiomatized without schemata is said to be "finitely axiomatized". Theories that can be finitely axiomatized are seen as a bit more metamathematically elegant, even if they are less practical for deductive work.

Two very well known instances of axiom schemas are the:
* Induction schema that is part of Peano's axioms for the arithmetic of the natural numbers;
* Axiom schema of replacement that is part of the standard ZFC axiomatization of set theory.It has been proved (first by Richard Montague) that these schemata cannot be eliminated. Hence Peano arithmetic and ZFC cannot be finitely axiomatized. This is also the case for quite a few other axiomatic theories in mathematics, philosophy, linguistics, etc.

All theorems of ZFC are also theorems of von Neumann-Bernays-Gödel set theory, but the latter is, quite surprisingly, finitely axiomatized. The set theory New Foundations can be finitely axiomatized, but only with some loss of elegance.

Schematic variables in first-order logic are usually trivially eliminable in second-order logic, because a schematic variable is often a placeholder for any property or relation over the individuals of the theory. This is the case with the schemata of "Induction" and "Replacement" mentioned above. Higher-order logic allows quantified variables to range over all possible properties or relations.

References

*http://plato.stanford.edu/entries/schema/
*Corcoran, J. 2006. Schemata: the Concept of Schema in the History of Logic. "Bulletin of Symbolic Logic" 12: 219-40.
*Mendelson, Elliot, 1997. "Introduction to Mathematical Logic", 4th ed. Chapman & Hall.
*Potter, Michael, 2004. "Set Theory and its Philosophy". Oxford Univ. Press.


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • axiom schema — noun A formula in the language of an axiomatic system, in which one or more schematic variables appear, which stand for any term or subformula of the system, which may or may not be required to satisfy certain conditions. Syn: axiom scheme …   Wiktionary

  • Axiom schema of replacement — In set theory, the axiom schema of replacement is a schema of axioms in Zermelo Fraenkel set theory (ZFC) that asserts that the image of any set under any definable mapping is also a set. It is necessary for the construction of certain infinite… …   Wikipedia

  • Axiom schema of specification — For the separation axioms in topology, see separation axiom. In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom schema of specification, axiom schema of separation, subset axiom scheme or… …   Wikipedia

  • Axiom schema of predicative separation — In axiomatic set theory, the axiom schema of predicative separation, or of restricted, or Delta;0 separation, is a schema of axioms which is a restriction of the usual axiom schema of separation in Zermelo Fraenkel set theory. It only asserts the …   Wikipedia

  • Axiom of empty set — In set theory, the axiom of empty set is one of the axioms of Zermelo–Fraenkel set theory and one of the axioms of Kripke–Platek set theory. Formal statement In the formal language of the Zermelo–Fraenkel axioms, the axiom reads::exist x, forall… …   Wikipedia

  • Axiom of pairing — In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of pairing is one of the axioms of Zermelo Fraenkel set theory. Formal statement In the formal language of the Zermelo Frankel axioms, the …   Wikipedia

  • Axiom of limitation of size — In class theories, the axiom of limitation of size says that for any class C , C is a proper class (a class which is not a set (an element of other classes)) if and only if V (the class of all sets) can be mapped one to one into C .:forall C… …   Wikipedia

  • Axiom — This article is about logical propositions. For other uses, see Axiom (disambiguation). In traditional logic, an axiom or postulate is a proposition that is not proven or demonstrated but considered either to be self evident or to define and… …   Wikipedia

  • Axiom of regularity — In mathematics, the axiom of regularity (also known as the axiom of foundation) is one of the axioms of Zermelo Fraenkel set theory and was introduced by harvtxt|von Neumann|1925. In first order logic the axiom reads::forall A (exists B (B in A)… …   Wikipedia

  • Axiom of infinity — In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of infinity is one of the axioms of Zermelo Fraenkel set theory. Formal statement In the formal language of the Zermelo Fraenkel axioms,… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.