I struggle with understanding why the satisfiability in the first-order logic is undecidable. Could you explain it with some examples? I've also seen that satisfiability in some first-order formulas are decidable.Please explain it with as much as many examples. 
Satisfiability of first-order logic is undecidable?
computability;undecidability;satisfiability;first order logic