# Truth functional completness for quantifiers

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 ?

-

## 1 Answer

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.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 3, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8866167068481445, "perplexity_flag": "head"}