#jsDisabledContent { display:none; } My Account |  Register |  Help

# Axiom schema

Article Id: WHEBN0000764613
Reproduction Date:

 Title: Axiom schema Author: World Heritage Encyclopedia Language: English Subject: Collection: Publisher: World Heritage Encyclopedia Publication Date:

### Axiom schema

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

## Contents

• Formal definition 1
• Finite axiomatization 2
• Examples 3
• Finitely axiomatized theoreies 4
• In higher-order logic 5
• References 7

## Formal definition

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.

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

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.

## Finitely axiomatized theoreies

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.

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

## References

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

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.

Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.

By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.