Nepedia
Back to Discover
Advanced Reader
🔢

Logical connective

math Maturity 11-13 Next article →

A logical connective is a formal operator used to modify or combine logical variables and formulas. Much like arithmetic operators combine numbers, these connectives build complex logical expressions from simpler ones. In the syntax of propositional logic, they allow us to create well-formed formulas. These formulas have a single, clear interpretation in formal languages. This clarity is provided by truth functions, which assign specific truth values to the resulting statements.

Logical connectives Hasse diagram
Logical connectives Hasse diagram

Logical connectives operate based on the number of inputs they require. We categorize them by their arity, which describes how many statements they act upon. Nullary connectives, or zero-ary operators, represent constants like True or False. Unary connectives, such as negation, act on a single statement to change its value. Binary connectives, like conjunction or disjunction, join two separate statements together.

Venn0110
Venn0110

Common connectives include negation, conjunction, disjunction, implication, and equivalence. Negation, often called "not," is a unary operator that flips a truth value. Conjunction, or "and," requires both parts to be true to result in truth. Disjunction, or "or," typically results in truth if at least one part is true. Implication, often expressed as "if...then," connects an antecedent to a consequent. Finally, biconditional equivalence, or "if and only if," states that two formulas are equivalent.

Venn1001
Venn1001

History shows that many different symbols have been used for these operations. The symbol for negation appeared in the work of Russell in 1908 and later in Heyting in 1930. Conjunction symbols appeared in the work of Schönfinkel in 1924 and trace back to Boole. Disjunction symbols were used by Russell in 1908 and relate to Peano's work. The implication symbol appeared in Hilbert's work in 1918 and was used by Russell. Equivalence symbols have a long history, including use by Frege in 1879.

Red Square
Red Square

In classical logic, these connectives are interpreted through specific truth functions. There are sixteen possible Boolean functions that associate two input truth values with binary outputs. Because of this, some connectives are considered redundant. For example, a classical system does not strictly need the conditional operator if it already uses negation and disjunction. A system can instead use a minimal, functionally complete set of operators to build all other possible meanings.

Venn0111
Venn0111

Logical connectives also possess specific mathematical properties. Commutativity means the order of operands can be swapped without changing the result. Associativity allows the grouping of similar connectives to be changed without affecting the outcome. Distributivity describes how one connective can spread across another, similar to multiplication in algebra. Other properties include idempotence, absorption, and monotonicity. These properties help mathematicians prove complex theorems within logical systems.

Venn1011
Venn1011

While logical connectives resemble natural language, they are not identical to it. In English, "or" can sometimes be interpreted exclusively, meaning only one option is possible. This creates a distinction between classical logic and the semantics of natural language. Researchers study these discrepancies to understand how humans communicate meaning. This field, known as formal semantics, investigates how logical structures exist within our everyday speech.

Venn1101
Venn1101
494 words

Where will your curiosity go next?

Keep exploring at your chosen reading level.

🖼️ Images & Media (15)
File:Logical connectives Hasse diagram.svg
Logical connectives Hasse diagram.svg
File:Red Square.svg
Red Square.svg
File:Blank Square.svg
Blank Square.svg
File:Venn01.svg
Venn01.svg
File:Venn10.svg
Venn10.svg
File:Venn0001.svg
Venn0001.svg
File:Venn1110.svg
Venn1110.svg
File:Venn0111.svg
Venn0111.svg
File:Venn1000.svg
Venn1000.svg
File:Venn0110.svg
Venn0110.svg
File:Venn1001.svg
Venn1001.svg
File:Venn1011.svg
Venn1011.svg

+ 3 more

More to explore

🔬 Go deeper

More advanced topics to explore

🪜 Step back

Simpler topics to build understanding

What is Nepedia?

A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.