Suppose that $\Sigma$ is a consistent set of L-sentences such that there is an L-formula $\phi$ such that for all L-sentences $\psi$,

$\Sigma \vdash \psi \iff \phi(\ulcorner\psi\urcorner)$.

Is it possible to show that $\Sigma$ is decidable?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.