# Logical connective

## Symbol connecting sentential formulas in logic / From Wikipedia, the free encyclopedia

#### Dear Wikiwand AI, let's keep it short by simply answering these key questions:

Can you list the top facts and stats about Logical connective?

Summarize this article for a 10 years old

In logic, a **logical connective** (also called a **logical operator**, **sentential connective**, or **sentential operator**) is a logical constant. They can be used to connect logical formulas. For instance in the syntax of propositional logic, the binary connective $\lor$ can be used to join the two atomic formulas $P$ and $Q$, rendering the complex formula $P\lor Q$.

Common connectives include negation, disjunction, conjunction, implication, and equivalence. In standard systems of classical logic, these connectives are interpreted as truth functions, though they receive a variety of alternative interpretations in nonclassical logics. Their classical interpretations are similar to the meanings of natural language expressions such as English "not", "or", "and", and "if", but not identical. Discrepancies between natural language connectives and those of classical logic have motivated nonclassical approaches to natural language meaning as well as approaches which pair a classical compositional semantics with a robust pragmatics.

A logical connective is similar to, but not equivalent to, a syntax commonly used in programming languages called a conditional operator.[1]^{[better source needed]}