✦ScienexySCIENCE KNOWLEDGE LIBRARY
reference · SCI-REF-006-039

Logic, Quantifiers and Propositional Symbols

Logic notation expresses propositions, truth conditions, logical operations and quantified statements. Symbols such as ¬, ∧, ∨, ⇒, ⇔, ∀ and ∃ are used in mathematical proofs, computer science, formal reasoning and scientific definitions.

Negation: ¬P. Conjunction: P ∧ Q. Disjunction: P ∨ Q. Implication: P ⇒ Q. Biconditional: P ⇔ Q. Universal statement: ∀x ∈ S, P(x). Existential statement: ∃x ∈ S such that P(x).

Explanation

Mathematical logic provides a formal language for expressing statements and reasoning about their truth. A proposition is a declarative statement that is either true or false within a specified interpretation. Propositional variables such as P and Q represent propositions. The negation symbol ¬ reverses the truth value of a proposition. Conjunction, represented by ∧, is true only when both component propositions are true. Disjunction, represented by ∨, is commonly inclusive: it is true when at least one component is true, including when both are true. Exclusive OR, written ⊕ in many conventions, is true when exactly one of the two propositions is true. Implication, written ⇒ or →, states that one proposition is sufficient for another: P ⇒ Q is false only when P is true and Q is false. Biconditional notation ⇔ indicates that each proposition implies the other. Logical equivalence means that two propositions have the same truth value under every relevant interpretation. Quantifiers extend logic to statements about elements of a domain. The universal quantifier ∀ means for all, while the existential quantifier ∃ means there exists at least one. The uniqueness quantifier ∃! means there exists exactly one object satisfying a condition. A quantified expression must identify or clearly establish its domain. For example, ∀x ∈ ℝ, x² ≥ 0 is true over the real numbers. Quantifier order matters: ∀x∃y and ∃y∀x generally express different claims. The symbol ∴ means therefore, and ∵ means because in some mathematical writing. Logical notation is used in theorem statements, proof construction, algorithms, digital circuit design, scientific hypotheses and formal verification. A logical implication must not be confused with a causal relationship: P ⇒ Q is a formal truth condition, not necessarily a claim that P physically causes Q.

Variables

SymbolMeaningSi Unit

¬

Logical negation; not.

Not applicable.

∧

Logical conjunction; and.

Not applicable.

∨

Inclusive logical disjunction; or.

Not applicable.

⊕

Exclusive OR in common logical and algebraic conventions.

Not applicable.

⇒

Logical implication; if the antecedent is true, the consequent must be true.

Not applicable.

⇔

Logical biconditional; each side implies the other.

Not applicable.

∀

Universal quantifier; for every element in the stated domain.

Not applicable.

∃

Existential quantifier; there exists at least one element.

Not applicable.

∃!

Unique existence; exactly one object satisfies the condition.

Not applicable.

∴

Therefore; introduces a conclusion.

Not applicable.

∵

Because; introduces a reason or premise.

Not applicable.

⊤

Logical truth or a true proposition in many formal systems.

Not applicable.

⊥

Logical falsehood or contradiction in many formal systems.

Not applicable.

Example or application

A worked example has not yet been added.

Definition

Logic notation is a formal symbolic system for representing propositions, logical connectives, implication, equivalence and quantified statements about objects in a defined domain.

Purpose

Logical symbols make formal reasoning concise and precise, allowing statements, assumptions, conclusions and quantified claims to be represented without ambiguity.

Importance

Logic is foundational to mathematical proofs, scientific reasoning, programming, digital electronics, artificial intelligence, database systems and formal verification.

Logical Connectives

ConnectiveSymbolMeaning

Negation

¬P

True when P is false and false when P is true.

Conjunction

P ∧ Q

True only when both P and Q are true.

Inclusive disjunction

P ∨ Q

True when at least one of P and Q is true.

Exclusive disjunction

P ⊕ Q

True when exactly one of P and Q is true.

Implication

P ⇒ Q

False only when P is true and Q is false.

Biconditional

P ⇔ Q

True when P and Q have the same truth value.

Quantifier Distinctions

QuantifierSymbolMeaning

Universal

∀

The statement holds for every element in the specified domain.

Existential

∃

At least one element in the specified domain satisfies the statement.

Unique existence

∃!

Exactly one element in the specified domain satisfies the statement.

Worked Examples

ExampleInterpretation

P: 4 is even. Q: 4 is positive. Then P ∧ Q is true.

Both component propositions are true, so their conjunction is true.

P: 5 is even. Q: 5 is positive. Then P ⇒ Q is true.

The implication is true because its antecedent P is false. This illustrates the formal truth condition of material implication, not a causal claim.

∀x ∈ ℝ, x² ≥ 0.

For every real number x, its square is nonnegative. The statement is universally true over the real numbers.

∃x ∈ ℤ such that x² = 9.

At least one integer satisfies the condition. In fact, both 3 and −3 satisfy it.

∃!x ∈ ℝ such that x² = 0.

There is exactly one real number satisfying the condition, namely x = 0.

Notation Rules

  • Define proposition variables before using them in a proof.

  • Specify the domain of every quantified variable.

  • Use parentheses to make the scope of logical connectives clear.

  • Distinguish inclusive OR from exclusive OR.

  • Remember that implication does not necessarily express causation.

  • Preserve quantifier order because changing it can change the statement.

  • Distinguish logical equivalence from ordinary numerical approximation.

  • State the logical system when using specialized symbols or non-classical interpretations.

Common Errors

  • Treating inclusive OR as exclusive OR.

  • Confusing implication with causation.

  • Ignoring the domain of a quantified variable.

  • Assuming ∀x∃y means the same as ∃y∀x.

  • Confusing a proposition with a mathematical expression that has an unspecified truth value.

  • Using ⇔ when only one direction of implication has been established.

  • Failing to distinguish existence from unique existence.

Applications

  • Mathematical theorem statements and proofs.

  • Boolean algebra and digital circuit design.

  • Programming conditions and logical expressions.

  • Formal verification of software and hardware.

  • Database query conditions.

  • Artificial intelligence and automated reasoning.

  • Scientific hypotheses and formal model definitions.

Limitations

Classical propositional logic uses binary truth values, but some fields study multi-valued, probabilistic, fuzzy or intuitionistic logic. Logical implication establishes a formal relationship between propositions and should not automatically be interpreted as physical causation.

Reference

  • Herbert B. Enderton, A Mathematical Introduction to Logic.

  • Kenneth H. Rosen, Discrete Mathematics and Its Applications.

  • George S. Boolos, John P. Burgess and Richard C. Jeffrey, Computability and Logic.

Related Topic

  • Set Theory Symbols and Mathematical Membership Notation

  • Comparison, Ordering and Equivalence Relations

  • Probability, Statistics and Mathematical Expectation Symbols

  • Scientific Equations and Mathematical Expressions

Sources and verification

Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.

  • Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.

Suggest a correction or source · More in Scientific Symbols & Notation