Metatheorem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In logic, a metatheorem is a statement about a formal system proven in a metalanguage. Unlike theorems proved within a given formal system, a metatheorem is proved within a metatheory, and may reference concepts that are present in the metatheory but not the object theory.[citation needed]

A formal system is determined by a formal language and a deductive system (axioms and rules of inference). The formal system can be used to prove particular sentences of the formal language with that system. Metatheorems, however, are proved externally to the system in question, in its metatheory. Common metatheories used in logic are set theory (especially in model theory) and primitive recursive arithmetic (especially in proof theory). Rather than demonstrating particular sentences to be provable, metatheorems may show that each of a broad class of sentences can be proved, or show that certain sentences cannot be proved.[citation needed]

Examples

Examples of metatheorems include:

See also

References

  • Geoffrey Hunter (1969), Metalogic.
  • Alasdair Urquhart (2002), "Metatheory", A companion to philosophical logic, Dale Jacquette (ed.), p. 307

External links

  • Meta-theorem at Encyclopaedia of Mathematics
  • Barile, Margherita. "Metatheorem". MathWorld.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Metatheorem&oldid=817094550"
This content was retrieved from Wikipedia : http://en.wikipedia.org/wiki/Metatheorem
This page is based on the copyrighted Wikipedia article "Metatheorem"; it is used under the Creative Commons Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may redistribute it, verbatim or modified, providing that you comply with the terms of the CC-BY-SA