Semidecidable axiomatization
ID: semidecidable-axiomatization
A semidecidable axiomatization is a computably enumerable set of axioms. Its set of formal theorems is also computably enumerable by dovetailing over finite proofs.
New to topics? Read the docs here!