Consistent

Pronunciation: /kənˈsɪs tənt/ ?
  1. A system of equations is consistent if the system has at least one common solution.[1] If a system of equations has no solutions, it is called inconsistent.
  2. An axiomatic system is consistent if all the propositions in the set are consistent; if there is no possible proof of both a proposition (P) and its negation (not P).[2]

References

  1. Kornegay, Chris. Systems of Linear Equations, pg 456-459. Math Dictionary With Solutions: A Math Review, 2nd edition. Sage Publications, Inc, March 6, 1999. (Accessed: 2010-01-20).
  2. Catherine Cavagnaro (Editor), William T. Haight II (Editor). consistent axioms, pg 27. Dictionary of Classical and Theoretical Mathematics. CRC Press, February 26, 2001. (Accessed: 2010-01-20).

Printed Resources

Cite this article as:


Consistent. 2010-01-20. All Math Words Encyclopedia. Life is a Story Problem LLC. http://www.allmathwords.org/en/c/consistent.html.

Translations

Image Credits

Revision History


2010-01-20: Added "References" (McAdams, David.)
2010-01-05: Added "References" (McAdams, David.)
2008-04-29: Initial version (McAdams, David.)

All Math Words Encyclopedia is a service of Life is a Story Problem LLC.
Copyright © 2005-2011 Life is a Story Problem LLC. All rights reserved.
Creative Commons License This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 License