How can first-order logic be at the same time complete and only semi-decidable?

Printable View