Skip to content

Minimal Axioms for Boolean Algebra

A Boolean-algebra axiom presentation shown complete and minimal by an explicitly stated size or redundancy criterion.

Version
v1 · 2026-09-28 · History
Domain-specific #
10732
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Algebraic Logic → Mathematics
Aliases
Single axioms for Boolean algebra

Core Idea

A minimal Boolean-algebra axiomatization is a set of equations whose models are exactly the Boolean algebras in a specified language, together with a proven minimality property. The language matters: NAND alone and OR plus NOT use different signatures and symbol lengths, and translating an equation need not preserve one-axiom sufficiency. An equation that happens to be true in the usual two-element Boolean algebra is only a candidate. It becomes an axiom basis when its consequences force the full Boolean laws and those laws validate it.

Minimal has several meanings. A one-equation basis is minimal in axiom count among nonempty presentations, but a shortest single axiom requires a separate lower-bound result under a declared symbol metric. A multi-equation irredundant basis has no removable member yet need not minimize count or total length. McCune and collaborators' short Sheffer single axiom is an attested case where both a complete basis and a within-signature length lower bound are proved. Their OR/NOT result shows that changing primitives resets the proof obligation.

Scope of Application

The metric and operation signature determine which minimality claim can be made.

  • Equational logic. Compare candidate model classes with the class of Boolean algebras.
  • Automated deduction. Use proof search and countermodels as distinct verification tools.
  • Axiom compression. Separate minimum axiom count from minimum symbolic length.
  • Signature comparison. Re-evaluate a basis when primitive connectives change.

Clarity

Specify the primitive connectives and whether minimal means fewest axioms, irredundancy, or shortest symbolic expression. A candidate must hold in every Boolean algebra and exclude all non-Boolean models; a two-element truth table is not enough. McCune's Sheffer equation is both a single basis and shortest under a particular Sheffer length rule, while an OR/NOT presentation requires a separate proof.

Manages Complexity

A short basis compresses an entire equational theory into few starting identities. The compression can make proofs less intuitive: a compact formula may hide a long derivation of familiar laws. Keeping signature, model-equivalence proof, and minimality metric visible prevents the short surface form from masquerading as self-evidence.

Abstract Reasoning

  1. Declare the Boolean operations used as primitives and the domain of models.
  2. Write the candidate equation set and show it holds in Boolean algebras.
  3. Prove its consequences derive the Boolean laws or otherwise exclude non-Boolean models.
  4. State whether minimality means cardinality, irredundancy, or symbol length.
  5. Prove the relevant lower bound and repeat the check after changing signatures.

Knowledge Transfer

The presentation–model-class–minimality test transfers to other equational theories, but Sh1's exact formula and its Sheffer length bound do not become axioms or shortestness results for groups, lattices, or even the OR/NOT signature. The generic idea of an axiom is broader; this entry's result stops at presentations of Boolean algebra under stated primitives.

Relationships to Other Abstractions

Local relationship map for Minimal Axioms for Boolean AlgebraParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Minimal Axioms forBoolean AlgebraDOMAINPrime abstraction: Formal System — is a kind ofFormal SystemPRIME

Current abstraction Minimal Axioms for Boolean Algebra Domain-specific

Parents (1) — more general patterns this builds on

  • Minimal Axioms for Boolean Algebra is a kind of Formal System Prime

    Minimal Axioms for Boolean Algebra is a domain-specific kind of formal system under its frozen identity and differentia. Complete-catalog comparison found the corresponding live broader identity.

Hierarchy paths (2) — routes to 2 parentless roots

Neighborhood in Abstraction Space

Minimal Axioms for Boolean Algebra sits in a moderately populated region (49th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Formal Systems & Discrete Structures (18 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08