Complete

Pronunciation: /kəmˈplit/ Explain

An axiomatic system is considered to be complete if all the theorems that are part of the system can be proved true. Note that all the theories do not have to actually be proved true, only be capable of being proved true.

References

  1. Simon Blackburn. Completeness. 2nd edition. pg 69. The Oxford Dictionary of Philosophy. Oxford University Press. October 2, 2008. Buy the book

More Information

  • McAdams, David E.. Axiom. allmathwords.org. All Math Words Encyclopedia. Life is a Story Problem LLC. 6/27/2018. http://www.allmathwords.org/en/a/axiom.html.

Cite this article as:

McAdams, David E. Complete. 6/25/2018. All Math Words Encyclopedia. Life is a Story Problem LLC. http://www.allmathwords.org/en/c/complete.html.

Revision History

6/25/2018: Removed broken links, updated license, implemented new markup, updated GeoGebra apps. (McAdams, David E.)
1/4/2010: Added "References". (McAdams, David E.)
4/25/2008: Initial version. (McAdams, David E.)

All Math Words Encyclopedia is a service of Life is a Story Problem LLC.
Copyright © 2018 Life is a Story Problem LLC. All rights reserved.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License