Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

There is a definition for truth-functional completness for a set of propositional connectives. Is there a definition for truth-functional completness of a set of quantifiers and propositional connectives ?

share|cite|improve this question
up vote 3 down vote accepted

There cannot be a direct analogue, because a formula with quantifiers in it can depend on the truth values of infinitely many atomic propositions. There are $2^{2^{\kappa}}$ different possible truth functions of $\kappa$ inputs, and when $\kappa$ is infinite this much larger than the number of possible formulas one can build from any finite set of connectives. So in this sense there is no complete finite set of quantifiers and connectives.

I suppose one could consider complete sets containing (uncountably) infinitely many different quantifiers, but that's not very practical.

share|cite|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.