A logical system is semidecidable if there is an effective method for generating theorems (and only theorems) such that every theorem will eventually be generated.
A logical system may be constructed so that it uses either axioms, rules of inference, or both as transformation rules for logical expressions in the system.