Can a complex sentence contain just one atom?

Yes. NOT P is built from one atom using negation.

Does a long predicate name make an atom complex?

No. Logical complexity depends on formula structure, not the number of characters in a name.

Are all formulas with variables sentences?

No. In strict first-order terminology, a sentence has no free variables; an open formula requires additional context or binding.

AI Glossary / Graphs and symbolic AI / Beginner

Complex sentences

Definition

Complex sentences in formal logic are built from simpler logical expressions using connectives such as NOT, AND, OR, and implication, and, in predicate logic, quantifiers. Their meaning depends on how those components are combined. The term concerns logical structure, not whether a natural-language sentence is long, difficult, or grammatically elaborate.

What it means

An atomic sentence states a basic proposition or predicate relationship. A complex sentence adds logical structure around one or more simpler expressions. For example, approved(order7) is atomic, while approved(order7) AND packed(order7) combines two atoms.

A complex expression need not be lengthy. NOT P already adds a connective to the atom P. Conversely, a predicate with a long name and many arguments can still be atomic if its formula has no outer logical connective or quantifier.

In strict terminology, a first-order sentence has no free variables. A compound expression containing an unbound variable is a formula, but it becomes a sentence only when its variables are appropriately bound or replaced by ground terms.

How it works

Begin with well-formed atoms. Apply the language's formation rules to build larger formulas. Parentheses or explicit precedence rules determine which components each connective joins and how the entire expression is grouped.

In classical propositional logic, truth tables specify the connective meanings. AND requires both components to be true. Inclusive OR requires at least one to be true. NOT reverses truth value. Material implication is false only when its antecedent is true and its consequent false.

Predicate logic adds quantifiers. A universally quantified sentence makes a claim about every relevant domain element; an existentially quantified sentence claims that at least one qualifying element exists. The scope and order of quantifiers matter.

The reasoner evaluates the resulting structure using an interpretation and, where needed for open formulas, variable assignments. Correct syntax alone does not establish truth. A well-formed complex sentence can be true in one interpretation and false in another.

Three practical examples

1. A rule model expresses that an order can proceed only when several required conditions jointly hold, making their logical grouping explicit.

2. A verification exercise combines a system property with its negation to test whether a set of assumptions is inconsistent.

3. A knowledge-base designer uses a quantified sentence to express a general relationship across objects instead of listing every individual instance manually.

Think of it this way

Think of building a sentence with clearly marked connectors and brackets. The same basic statements can convey different conditions when joined differently.

The analogy does not make everyday language automatically precise. Words such as or and if can carry conversational implications that differ from their formal logical definitions, so the intended interpretation needs to be stated.

Worked example

Let A mean that a parcel is approved, P mean that it is packed, and L mean that its label is attached. Compare two formulas: F = (A OR P) AND L, and G = A OR (P AND L).

Suppose A is true, P is false, and L is false. In F, the parenthesized OR is true, but the final AND with false L makes F false. In G, P AND L is false, but true A makes the outer OR true.

The same three atoms appear in both formulas, yet their grouping produces different results. Therefore the formulas are not logically equivalent.

Now consider the implication A implies L. Under the same assignment, its antecedent is true and consequent false, so it is false. Reversing it to L implies A produces a true material implication here, demonstrating that implication cannot generally be reversed without changing meaning.

Illustrative case study

Fictional case: BrightParcel translates a written handling policy into a rule expression. One developer groups an exception with the wrong condition, allowing the rule to pass in a case the policy owner intended to reject.

The team writes named atoms, adds explicit parentheses, and checks a small set of contrasting truth assignments with the policy owner. It discovers that the disagreement concerns the intended policy, not the rule engine's calculation.

The fictional lesson is that complex sentences make reasoning precise only after the component meanings and grouping have been agreed. Formal evaluation can faithfully execute an incorrectly translated requirement.

Common misconceptions and mistakes

Complex does not mean difficult. A short negation is structurally compound, while an informative predicate atom may remain atomic.

Inclusive OR is not automatically exclusive OR. If exactly one alternative must hold, the formula needs to express that requirement.

A material implication does not establish causation, temporal order, or the converse implication. Those meanings require additional representation or assumptions.

Do not ignore free variables and quantifier scope. Everyone having some assigned reviewer is different from one reviewer being assigned to everyone. Both descriptions can use the same predicate while expressing different claims through quantifier order.

Business use

For business rule design, complex sentences provide a way to express combinations, exceptions, and general conditions precisely. Create a shared vocabulary for the atoms before translating the policy.

Use explicit grouping and test contrasting cases, including cases where one component changes while the others remain fixed. Ask reviewers to confirm the intended result rather than merely inspect the formula's appearance. Keep the formal expression connected to its versioned business meaning so later edits do not silently change what a condition represents.

Check your understanding

With A true and both P and L false, do (A OR P) AND L and A OR (P AND L) agree?

Answer: No. The first is false because L is false. The second is true because its outer disjunction includes true A. Parentheses change the logical structure.

Related terms

Atom
Logical connectives
Conjunction
Disjunction
Implication
formula
logical connective
quantifier
free variable
truth table

Learn next

Build truth tables for two differently grouped formulas using the same atoms. Identify a row where their results differ. Then move to predicate logic and compare an open formula with universally and existentially quantified sentences derived from it.

Predicate (logic)

Sources

Primary sources consulted: Russell and Norvig, Logical Agents slides, propositional syntax and semantics, https://aima.cs.berkeley.edu/slides-pdf/chapter07.pdf ; Poole and Mackworth, Predicate Calculus, https://artint.info/3e/html/ArtInt3e.Ch15.S3.html . Scope is formal logical sentences, distinguished from natural-language grammar. Parcel formulas and the fictional case are original.

Previous: Complex inverse Wishart distribution Next: Complex steerable pyramid