Semidecidable axiomatization
= Semidecidable axiomatization
= Recursively axiomatisable theory
{synonym}
= Recursively axiomatisable
{synonym}
= Recursively axiomatizable
{synonym}
= Recursively axiomatizable theory
{synonym}
A semidecidable axiomatization is a computably enumerable set of axioms. Its set of formal theorems is also computably enumerable by dovetailing over finite proofs.