Are there any specific problems known to be undecidable for reasons other than diagonalization, self-reference, or reducibility?
Yes, there are such proofs. They are based on the Low Basis Theorem.

See this answer to Are there any proofs the undecidability of the halting problem that does not depend on self-referencing or diagonalization? question on cstheory for more.