Definition:Finitely Axiomatizable

Definition

Let $\LL$ be a logical language.

Let $\mathscr M$ be a formal semantics for $\LL$.

Let $\FF$ be an $\LL$-theory.

Then $\FF$ is called finitely axiomatizable if and only if there exists a finite axiomatization $\AA$ of $\FF$.

Sources

• 2012: M. Ben-Ari: Mathematical Logic for Computer Science (3rd ed.) ... (previous) ... (next): $\S 2.5.4$: Definition $2.56$