Can both sides of an OR be true?

Yes. Classical inclusive OR is true if one or both propositions are true. “Exactly one” requires exclusive OR or an equivalent expression.

Does P implies Q assert that P occurs?

No. It rules out P being true while Q is false; it does not itself assert P.

Why use parentheses if ordinary language seems clear?

Parentheses specify grouping. Different groupings can change which conditions must hold and therefore change the truth value of the whole formula.

AI Glossary / Graphs and symbolic AI / Beginner

Logical connectives

Definition

Logical connectives are operators that combine or modify statements to form more complex statements. In classical propositional logic, familiar examples include not, and, or, implication, and equivalence. Each has a precise truth rule, allowing a reasoning system to evaluate compound statements and check whether conclusions follow from specified premises.

What it means

Suppose a workflow involves two statements: a form is complete, and a reviewer has approved it. A connective determines how those statements contribute to a larger condition. Requiring both is different from requiring at least one, and denying the combined condition is different from denying each statement separately.

Formal connectives make these differences explicit. Everyday words can be ambiguous: “or” may be inclusive or exclusive, and “if” can imply timing or causation in conversation. A logical formula needs defined semantics rather than relying on whichever reading seems natural in a particular sentence.

How it works

In classical two-valued logic, each proposition is true or false. Negation reverses that truth value. Conjunction, written P and Q, is true only when both are true. Inclusive disjunction, P or Q, is true when at least one is true, including when both are true.

Material implication, P implies Q, is false only when P is true and Q is false. It is equivalent to not P or Q. The biconditional, P if and only if Q, is true when P and Q have matching truth values.

Parentheses determine how operators group. A truth table evaluates a formula across all assignments to its component propositions. Other logical systems can define additional truth values or different operators, so these rules should be identified as classical propositional semantics.

Three practical examples

1. An access-rule prototype requires ValidAccount and HasPermission. The conjunction distinguishes having both conditions from satisfying only one.

2. A data-validation rule accepts EmailProvided or PhoneProvided. An inclusive interpretation permits both contact methods; an exclusive rule would need a different expression.

3. A configuration checker represents AddOnSelected implies BaseInstalled. This identifies the invalid combination where the add-on is selected but the supporting base is absent.

Think of it this way

Think of connectives as precisely specified switches in a signal circuit. An AND gate activates only with both inputs active, while an OR gate activates when either or both inputs are active.

The analogy is useful for Boolean truth tables, but a logical proposition need not correspond to an electrical signal. Also, material implication does not describe a physical mechanism causing one event to produce another. It specifies which truth-value combinations satisfy a statement.

Worked example

Let C mean “the request is complete” and A mean “the request is approved.” Compare two conditions: not(C and A), and (not C) and (not A).

If C and A are both true, both conditions are false. If C is true and A is false, not(C and A) is true, but (not C) and (not A) is false. If C is false and A is true, the same difference occurs. If both are false, both conditions are true.

Therefore the two formulas are not equivalent. The first means that at least one requirement is missing. The second means that both are missing. By De Morgan's law, not(C and A) is equivalent to (not C) or (not A).

For a separate implication C implies A, the only false case is C true and A false. The formula alone does not establish that C is actually true, or that completing a request causes approval. Those would require additional statements or a different model.

Illustrative case study

Fictional case: Birch Forms wants to display “more information needed” whenever either of two required fields is absent. A prototype instead displays the message only when both fields are absent.

The analyst translates the intended and implemented conditions into formulas, then enumerates all four combinations of field presence. The two mixed cases reveal the difference immediately. The team reviews the message behavior separately from any further business eligibility rules. This fictional example illustrates a truth-table review; it claims no real reduction in form abandonment or support demand.

Common misconceptions and mistakes

Do not confuse inclusive OR with exclusive OR. Exclusive OR is true when exactly one of two propositions is true, whereas ordinary classical OR also permits both.

Do not move negation across a parenthesized expression without changing the connective appropriately. Negating an AND produces an OR of negations, and negating an OR produces an AND of negations.

Finally, do not assume programming-language conditions always behave like pure Boolean propositions. Null values, exceptions, side effects, and short-circuit evaluation can introduce behavior beyond the truth-functional formulas being discussed. Check the implementation language's actual semantics when translating a rule into software.

Business use

Logical connectives are useful when reviewing eligibility criteria, filters, validation checks, and configuration rules. Write the intended condition in plain language, define the underlying propositions, and compare the formal expression against representative combinations.

For a small number of inputs, enumerate all combinations. For larger expressions, use appropriate automated checks while preserving the meaning of each input. Include boundary and missing-data cases explicitly. A formula can be perfectly evaluated yet still encode the wrong requirement if a proposition such as “approved” is unclear or an exception has been omitted.

Check your understanding

A request is complete but not approved. Which worked-example condition is true: not(C and A), or (not C) and (not A)?

Answer: The first is true because the two requirements are not both satisfied. The second is false because C is true, so not C is false.

Related terms

Learn next

Construct truth tables for inclusive OR, exclusive OR, and implication. Then translate a small real requirement into propositions and test whether its negation means what the wording suggests.

Sources

Russell and Norvig, AIMA logical-agents slides, propositional syntax, connective semantics, and logical equivalences: https://aima.cs.berkeley.edu/slides-pdf/chapter07.pdf

The request conditions, truth-value comparisons, and fictional form case are original teaching examples. The entry uses classical two-valued logic and does not assume every software system adopts identical missing-value behavior.

Previous: Logic learning machine Next: Logical Data Model