I am asked to show that if T is a finite L-theory (L finite) then there exists an algorithm that generates the set $\{ \varphi \in Sent(L) : T \vdash \varphi \}$.
From this I understand that I am supposed to show that the set is decidable hence I should show that the characteristic function of the set is recursive. However I have no idea how to do this.