Ternary Operation¶
A total three-input function—internally T:A³→A when defined on a set—that maps each ordered triple to one output, with any further identities stated separately.
Core Idea¶
A ternary operation generalizes a binary operation by taking three ordered inputs. For an operation on A in universal algebra, every triple in A³ must receive exactly one output in A. Closure and totality belong to the formal definition; symmetry, associativity-like laws, or special meanings do not.
Different fields add structure. The affine expression a−b+c gives heaps and origin-free vector reasoning; planar ternary rings encode geometry; programming languages use three-operand operators such as conditional selection. These are examples because of arity, not because all share the same laws.
Scope of Application¶
- Universal algebra. Studies sets equipped with three-ary operations and identities.
- Geometry. Uses ternary laws in heaps, torsors, and coordinatization.
- Logic and Boolean algebra. Represents majority or conditional-like connectives.
- Programming languages. Classifies operators by three operands and typing behavior.
Clarity¶
Declare carrier sets, argument order, totality, output sort, and any identities. When nesting terms, use parentheses or a stated ternary associativity law rather than borrowing binary convention. Inclusion test: Specify three ordered inputs, a total single-valued rule, and—when called an operation on A—closure of outputs in A. Exclusion test: Exclude binary operations written with three symbols, partial three-place relations, functions of more than three independent arguments, and syntax whose apparent third part is not an operand. Nearest boundary: A ternary relation classifies triples as related or not; a ternary operation assigns exactly one output to every admissible triple. Exit condition: The object ceases to be a ternary operation if arity changes, outputs are multivalued, or some input triples lack output without being explicitly treated as partial.
Manages Complexity¶
The abstraction isolates arity from semantics, letting diverse constructions share one formal type while preventing properties of a familiar example from being projected onto all ternary operations.
Abstract Reasoning¶
- Identify the three argument positions and their sorts.
- Verify a unique output for every admitted triple.
- Check closure for an internal algebraic operation.
- State any equations or invariances beyond arity.
- Analyze nested applications with explicit grouping.
Knowledge Transfer¶
Three-input function reasoning transfers across algebra and computing when typing is preserved. Domain-specific names such as heap or conditional require additional laws or semantics.
Relationships to Other Abstractions¶
Current abstraction Ternary Operation Domain-specific
Parents (1) — more general patterns this builds on
-
Ternary Operation is a kind of Function (Mapping) Prime
A Ternary Operation is a Function Mapping from ordered triples to one output.
Hierarchy path (1) — routes to 1 parentless root
- Ternary Operation → Function (Mapping)
Neighborhood in Abstraction Space¶
Ternary Operation sits in a crowded region of the domain-specific corpus (34th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Number & Formal Language Properties (7 abstractions)
Nearest neighbors
- Algebraic Operation — 0.88
- Logical NOR — 0.88
- Distributivity — 0.88
- Empty Sum — 0.88
- Logical Operation — 0.88
Computed from structural-signature embeddings · 2026-10-08