decidable (suomeksi)

Määritelmät:

capable of being decided.
(lb, en, computer science) describing a set for which there exists an algorithm that will determine whether any element is or is not within the set in a finite amount of time.
(lb, en, logic) in intuitionistic logic, a proposition ''P'' is decidable in a given theory if it can be proven from the theory that "either ''P'' or not ''P''", i.e. in symbols: $P \vee \neg P$ .http://plato.stanford.edu/entries/logic-intuitionistic/