Intuitionistic logic

Computing Dictionary

intuitionistic logic definition

logic, mathematics
Brouwer's foundational theory of mathematics which says that you should not count a proof of (There exists x such that P(x)) valid unless the proof actually gives a method of constructing such an x. Similarly, a proof of (A or B) is valid only if it actually exhibits either a proof of A or a proof of B.
In intuitionism, you cannot in general assert the statement (A or not-A) (the principle of the excluded middle); (A or not-A) is not proven unless you have a proof of A or a proof of not-A. If A happens to be undecidable in your system (some things certainly will be), then there will be no proof of (A or not-A).
This is pretty annoying; some kinds of perfectly healthy-looking examples of proof by contradiction just stop working. Of course, excluded middle is a theorem of classical logic (i.e. non-intuitionistic logic).
History (,5716,118173+14+109826,00.html).
The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Previous Definition: intuitionist logic
More from
Synonyms and Antonyms for intuitionistic logic
More from
Search for articles containing intuitionistic logic Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature