I was studying for a test and got stuck on this problem for a few days now, I just don't get it.
So given the following sentence for the language $L= < P,R >$, where P and R are unary relation symbols I want to find structures for which the following formula is 1) valid 2) contradictory
$ ((∀x) P(x) -> (∀y) R(y)) -> (∀z) (P(z)->R(z)) $
I believe the answer is very simple, but formulas with unary relations seem to confuse me, any help will be appreciated.