Math 2.0

Mathematical logic and foundations Definition

Logical connective

Builds on Propositional logicProposition

Definition

Let n≥0n \ge 0 be an integer, and write 𝖳\mathsf{T} and 𝖥\mathsf{F} for the two truth values. An nn-ary logical connective of classical propositional logic is a symbol cc with a truth function fc ⁣:{𝖳,𝖥}n→{𝖳,𝖥}f_c \colon \set{\mathsf{T}, \mathsf{F}}^n \to \set{\mathsf{T}, \mathsf{F}}. For formulas φ1,…,φn\varphi_1, \dots, \varphi_n, the expression c(φ1,…,φn)c(\varphi_1, \dots, \varphi_n) is again a formula. Under a truth assignment, its value is fcf_c applied to the values of φ1,…,φn\varphi_1, \dots, \varphi_n.

Remarks

Conjunction ∧\land is a binary connective: f∧(a,b)=𝖳f_\land(a, b) = \mathsf{T} exactly when a=b=𝖳a = b = \mathsf{T}. So p∧qp \land q is true only when propositions pp and qq 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 pp does not determine whether pp is necessary. Binary connectives are written in infix form, such as φ→ψ\varphi \to \psi. The set {¬,∧}\set{\neg, \land} is functionally complete: every truth function is expressed by a formula built with these two. The single connective NAND, with f(a,b)=𝖥f(a, b) = \mathsf{F} exactly when a=b=𝖳a = b = \mathsf{T}, 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Proposition concept
  2. Conjunction definition
  3. Disjunction definition
  4. Implication definition
  5. Negation definition
  6. Biconditional definition
  7. Propositional logic concept
  8. Logical connective definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Logical_connective
About this page
TagCA49F5KQGB
URIm2://CA49F5KQGB
Kinddefinition
WritingW0 stub
MSC03B05
DefinesLogical connective
UsesPropositional logic, Proposition
Changed2 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.