ABSTRACT
The deducibility problem for a logic goes like this: we are presented with a consecution X f-A, and we wish to know whether it is valid or not. Is there an algorithm to determine its validity? A logic is said to be decidable if and only if there is an algorithm determining decidability, and it is undecidable if there is no such algorithm.
