Elementary definition
≈ 2 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 mathematical logic, an elementary definition is a definition that can be made using only finitary first-order logic, and in particular without reference to set theory or using extensions such as plural quantification. Elementary definitions are of particular interest because they admit a complete proof apparatus while still being expressive enough to support most everyday mathematics (via the addition of elementarily-expressible axioms such as Zermelo–Fraenkel set theory (ZFC)). Saying that a definition is elementary is a weaker condition than saying it is algebraic.
In mathematical logic, an elementary definition is a definition that can be made using only finitary first-order logic, and in particular without reference to set theory or using extensions such as plural quantification. Elementary definitions are of particular interest because they admit a complete proof apparatus while still being expressive enough to support most everyday mathematics (via the addition of elementarily-expressible axioms such as Zermelo–Fraenkel set theory (ZFC)). Saying that a definition is elementary is a weaker condition than saying it is algebraic.
Related
Elementary theory
References
Mac Lane and Moerdijk, Sheaves in Geometry and Logic: A First Introduction to Topos Theory, page 4.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1320567063 under CC BY-SA 4.0; modifications have been made.