enumerating every computably infinitary sentence

39 Views Asked by At

Given a computable $L$-structure $\mathscr{A}$, can you enumerate every computably infinitary sentence of $L \cup \{a\}_{a \in A}$ in an effective way?