Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

$\neg P(x,y)\vee P(S,y)$ (1)

$\neg P(x,f(x))\vee P(S,f(x))$ (2)

$\neg P(S,f(x))\vee P(x,f(x))$ (3)

Is, this set of formulas, consistent? I think so, because I could not to obtain a contradiction. What do you think?

share|improve this question
Usually to speak of consistency of a set of sentences of first order logic. The above looks like they are missing some quantifiers. You should also clarify what is the first order language you are working in. –  William Jun 5 '12 at 8:55
sorry, each variable x y is to be understood universally quantified. –  Mark Jun 5 '12 at 9:14
What about $S$? Is it also a variable? –  William Jun 5 '12 at 9:16
S ground, constant. –  Mark Jun 5 '12 at 9:26
And what about $\rceil$? –  Chris Eagle Jun 5 '12 at 9:27

1 Answer 1

up vote 0 down vote accepted

If $P$ is interpreted to always be true, then (no matter how $S$ and $f$ are interpreted), all three sentences are true. Thus the set has a model and hence is consistent.

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.