Pronunciation: /kənˈsɪs tənt/ Explain
  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 sytem 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]


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

Cite this article as:

McAdams, David E. Consistent. 6/25/2018. All Math Words Encyclopedia. Life is a Story Problem LLC.

Revision History

6/25/2018: Removed broken links, updated license, implemented new markup, updated GeoGebra apps. (McAdams, David E.)
1/20/2010: Added "References". (McAdams, David E.)
1/5/2010: Added "References". (McAdams, David E.)
4/29/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