
I'm aware that a semantically complete theory can be undecidable. (I believe it's because only logically valid sentences need be provable for a theory to be semantically complete.)
But is it possible for a syntactically/negation complete theory to be undecidable? And do "syntactically complete" and