Axiom schema

In mathematical logic, an axiom schema (plural: axiom schemata or axiom schemas) generalizes the notion of axiom.

Formal definition

An axiom schema is a formula in the metalanguage 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.

Finite axiomatization

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.

Examples

Two very well known instances of axiom schemata are the:

Czesław Ryll-Nardzewski proved that Peano arithmetic cannot be finitely axiomatized and Richard Montague proved that ZFC cannot be finitely axiomatized.[1] Hence, the axiom schemata cannot be eliminated from these theories. This is also the case for quite a few other axiomatic theories in mathematics, philosophy, linguistics, etc.

Finitely axiomatized theories

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

In higher-order logic

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.

gollark: @nagoL2015#0000 hi
gollark: ⭐
gollark: 🌵
gollark: Not exactly to the base.
gollark: No, to @aaronhs_mine#0000.

See also

Notes
  1. Czesław Ryll-Nardzewski 1952; Richard Montague 1961.

References
  • Corcoran, John (2006), "Schemata: the Concept of Schema in the History of Logic", Bulletin of Symbolic Logic, 12: 219–240.
  • Corcoran, John (2016). "Schema". In Zalta, Edward N. (ed.). Stanford Encyclopedia of Philosophy.
  • Mendelson, Elliott (1997), An Introduction to Mathematical Logic (4th ed.), Chapman & Hall, ISBN 0-412-80830-7.
  • Montague, Richard (1961), "Semantic Closure and Non-Finite Axiomatizability I", in Samuel R. Buss (ed.), Infinitistic Methods: Proceedings of the Symposium on Foundations of Mathematics, Pergamon Press, pp. 45–69.
  • Potter, Michael (2004), Set Theory and Its Philosophy, Oxford University Press, ISBN 9780199269730.
  • Ryll-Nardzewski, Czesław (1952), "The role of the axiom of induction in elementary arithmetic" (PDF), Fundamenta Mathematicae, 39: 239–263.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.