Log in Sign up
Back to Discover
🔢

Logical connective

math Maturity 11-13

We use special words to join ideas. We can say "and" or "or." These words help us make new thoughts. They work like tools for our minds. Do you use these words to talk?

Venn0111.svg
Venn0111.svg

35 words

We use special words to join ideas. We can say "and" or "or." These words help us make new thoughts. They work like tools for our minds.

Venn0111.svg
Venn0111.svg

One word is "not." It changes a thought. It can turn a "yes" into a "no."

We can also use "if." This links two ideas together. It says if one thing happens, then another might too.

Venn1101.svg
Venn1101.svg

Some words work with one idea. Other words join two ideas. These are like building blocks for thinking.

Venn0110.svg
Venn0110.svg

These tools help us understand the world. They help us see how things fit. Logic helps us think clearly.

103 words

We use special words to join ideas. These are called logical connectives. They work like tools for our minds.

Venn0111.svg
Venn0111.svg
You might use them every day. Think about the words "and" or "or." These words help us make new thoughts. They can join two ideas together. One tool is called negation. We often use the word "not" for this. It can turn a "yes" into a "no."
Venn0110.svg
Venn0110.svg
Some tools work with just one idea. Other tools join two ideas. We call these binary connectives. For example, "and" is a conjunction. It joins two things together. "Or" is called a disjunction. It lets us pick between things. Another tool is "if...then." This is called an implication. It links two ideas in a specific way. There is also "if and only if." This is called equivalence. It means two ideas are the same. These tools help us think clearly. They help us see how facts fit.
Venn1001.svg
Venn1001.svg

157 words

Logical connectives are special tools used to build complex ideas. They work much like math symbols in arithmetic. In arithmetic, you might use a plus sign to join numbers. In logic, you use connectives to join or change statements. These tools help us see how different facts relate to each other. They allow us to create new, longer sentences from simple ones.

Logical connectives Hasse diagram.svg
Logical connectives Hasse diagram.svg

These tools work in different ways depending on how many ideas they use. Some connectives only need one idea to work. This is called a unary connective. An example is negation, which uses the word "not." It can turn a statement into its opposite. Other connectives are binary, meaning they join two ideas together. For example, "and" joins two facts into one group.

Venn0110.svg
Venn0110.svg
You can also use "or" to link two different possibilities.

Many people have worked to create the symbols we use today. These symbols help mathematicians write ideas quickly and clearly. The symbol for negation appeared in the work of Russell in 1908. Later, the symbol for negation was used by Heyting in 1930. The symbol for conjunction, or "and," appeared in 1924 with Schönfinkel. It also comes from the ideas of George Boole.

Red Square.svg
Red Square.svg
Different thinkers like Frege and Peano also helped shape these rules.

There are many different types of connectives to know. A conjunction uses "and" to join two parts. A disjunction uses "or" to offer a choice. An implication uses "if...then" to show a connection. An equivalence uses "if and only if" to show two things are the same.

Venn1001.svg
Venn1001.svg
There are even special tools like "exclusive or" or "neither...nor." Some connectives are even called "nullary" because they represent a single constant like "True" or "False."

You can see these ideas working in your own speech. When you say "It is raining and I am indoors," you are using a connective. Logic helps us study how our natural language works. Sometimes, the way we speak is a little different from strict math rules. For example, the word "or" can sometimes mean you must pick only one.

Venn0111.svg
Venn0111.svg
Scientists study these differences to understand how humans share meaning.

361 words

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.svg
Logical connectives Hasse diagram.svg

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.svg
Venn0110.svg

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.svg
Venn1001.svg

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.svg
Red Square.svg

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.svg
Venn0111.svg

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.svg
Venn1011.svg

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.svg
Venn1101.svg

500 words
🖼️ 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

Up Next
🔢
Propositional logic
Math
More to explore

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.