Mathematical logic and foundations Definition
Logical connective
Builds on Propositional logicProposition
Definition
Let be an integer, and write and for the two truth values. An -ary logical connective of classical propositional logic is a symbol with a truth function . For formulas , the expression is again a formula. Under a truth assignment, its value is applied to the values of .
Remarks
Conjunction is a binary connective: exactly when . So is true only when propositions and are both true. The modal operator "it is necessary that" is not a connective of classical propositional logic. It has no truth function: the truth of does not determine whether is necessary. Binary connectives are written in infix form, such as . The set is functionally complete: every truth function is expressed by a formula built with these two. The single connective NAND, with exactly when , is also functionally complete.
Reading path
To understand this page from the ground up, read these 8 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Proposition concept
- Conjunction definition
- Disjunction definition
- Implication definition
- Negation definition
- Biconditional definition
- Propositional logic concept
- Logical connective definition
Further reading
About this page
| Tag | CA49F5KQGB |
|---|---|
| URI | m2://CA49F5KQGB |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03B05 |
| Defines | Logical connective |
| Uses | Propositional logic, Proposition |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.