## intuitionistic logic

<*logic, mathematics*>

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).

Last updated: 2001-03-18

### Nearby terms:

intuitionism ♦ **intuitionistic logic** ♦ intuitionistic probability

Try this search on Wikipedia, OneLook, Google

## intuitionistic probability

<*logic*>

n_sup = sup(T) + sup(I) + sup(F) < 100Related to intuitionistic logic.

[Florentin Smarandache, "A Unifying Field in Logics. / Neutrosophy: Neutrosophic Probability, Set, and Logic", American Research Press, Rehoboth 1999].

Last updated: 2001-03-18

### Nearby terms:

intuitionistic logic ♦ **intuitionistic probability** ♦ intuitionist logic

Try this search on Wikipedia, OneLook, Google