- (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: .
- (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.
"It is easy to show that the set of even numbers is decidable by creating the relevant Turing machine."
- capable of being decided.