decidable

{{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: <math> P \vee \neg P </math>.