So I have this question from Logic for Applications by Nerode and Shore. The chapter on Predicate Logic.
Find a finite language $L$ and a finite set of sentences $S$ that has an infinite model but no finite ones.
Proposition 7.5 says that a tableau is finite if every path is contradictory. So am I just finding a sentence with at least one contradictory path? I'm a bit confused here.
I have no idea what the relevant background is supposed to be for this problem as presented in your textbook, but here's a complicated abstract algebra example. There are groups, such as the Higman group, which are finitely presented but have no nontrivial finite quotients. So you can consider $L$ the language of groups and the sentences given by the existence of elements satisfying the presentation of the Higman group together with the axiom that one of these elements is not the identity.