Variable-polyadic relation¶

A variable-polyadic relation can apply one logical relation symbol to finite argument sequences of different lengths under a declared interpretation.

Version: v1 · 2026-10-31 · History
Domain-specific #: 14595
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Knowledge Representation, Formal Semantics → Mathematics

Core Idea¶

A variable-polyadic relation lets one logical relation symbol be applied to finite argument sequences of different lengths. Its interpretation determines which sequences satisfy the relation. This differs from assigning that symbol one fixed number of places: the same symbol can occur in assertions with different numbers of explicit arguments. A vocabulary may still impose a minimum length or type restrictions, and a well-formed application need not be true.^[1]^[2]^[3]

How would you explain it like I'm…

Any-Number Friend Word

Some words can be used with different numbers of names. You can say 'Amy and Ben are friends' or 'Amy, Ben and Cara are friends.' A Variable-polyadic relation is like that: one relation word that works with two names, three names, or more. Saying it doesn't make it true, though.

Relations With Flexible Slots

In logic, a relation is like a statement-pattern such as 'is taller than' that you fill in with things. Usually each relation has a fixed number of blanks: 'is taller than' always takes two. A Variable-polyadic relation can take different numbers of things, like 'are in a line' working for three people or five people. What it means decides which lists of things make it true. There can still be rules, like needing at least two things, and a sentence can follow the rules and still be false.

Variable-Arity Relation Symbol

A Variable-polyadic relation is a logical relation symbol that can be applied to finite lists of arguments of different lengths, instead of having one fixed number of places. In standard logic, a relation symbol has a set arity: a two-place relation always takes exactly two arguments. Here, the same symbol can appear with two, three or more arguments in different statements, and its interpretation decides which lists satisfy it. A vocabulary can still impose limits, like a minimum length or type restrictions. And applying it correctly doesn't make the statement true; being well-formed and being true are separate.

A Variable-polyadic relation is a logical relation symbol that may be applied to finite argument sequences of varying lengths, with its interpretation determining which sequences satisfy it. This contrasts with the standard practice of assigning each relation symbol a single fixed arity, so that a two-place symbol always takes exactly two arguments. Under the variable-polyadic approach, the same symbol can occur in assertions with different numbers of explicit arguments. The vocabulary may still constrain applications, for example by imposing a minimum length or type restrictions on argument positions. Well-formedness and truth remain distinct: a properly formed application with any permitted number of arguments need not be satisfied by the interpretation.

Structural Signature¶

Sig role-phrases:

Relation symbol: One logical name is used across the applications. Separate fixed-arity names are a different representation even if linked by axioms.
Finite argument sequence: An application supplies an ordered finite list of objects or terms; the list length may vary.
Admissibility regime: A language or vocabulary specifies which applications are allowed; its regime may be unrestricted across finite lengths or may constrain minimum length or argument types. Restrictions do not assert that every permitted list satisfies the relation.
Interpretation and satisfaction: The logical interpretation assigns a relation on finite object sequences; membership or the applicable semantic rules determine whether a sentence is true.
Interpretation across lengths: One interpretation determines satisfaction for each allowed finite sequence. A particular vocabulary may additionally specify a connection between uses at different lengths; no such extra coherence law is required in general.^[1]^[2]^[3]

What It Is Not¶

This is not merely a fixed-arity relation written with a different number of visible words, nor a programming function that happens to accept extra arguments. A variable-polyadic logical relation concerns relation applications and satisfaction. It does not require that the language permit infinite argument lists or that all arities occur in a particular extension.^[1]^[2]

Scope of Application¶

The examples concern formal knowledge representation. KIF’s draft specification uses lists of numbers to illustrate an ordering relation. A later SUMO-K translation studies an ontology relation over classes and its representation in higher-order set theory. These cases do not establish a measured benefit in a deployed service or an equivalence with linguistic verb valency.^[1]^[3]

Clarity¶

Say whether a length is syntactically admitted, satisfies a vocabulary’s type guard, or is actually true in an interpretation. These are separate questions. When comparing different lengths, explain any intended role of additional positions; an additional cross-length coherence law is optional.

Manages Complexity¶

A shared relation symbol can avoid introducing a separate symbol for each permitted length. Its interpretation determines satisfaction, and a particular vocabulary may also define connections among uses at different lengths. Menzel’s Teacher illustration uses one, two or three arguments to express a teacher, a teacher and student, or those participants with a time interval; it does not by itself prove that all these statements have the same truth conditions.^[2]

Abstract Reasoning¶

For a domain D, an interpretation can assign a relation symbol a subset of the finite sequences over D. A specific sequence is true of that relation exactly when it belongs to the assigned extension. Admitting sequences of different lengths is a feature of the interpretation framework; whether the extension actually includes tuples of several lengths is a separate fact.^[1]^[2]

Knowledge Transfer¶

To evaluate another proposal, locate the repeated relation symbol, the permitted finite argument sequences and any type or length guard. Then inspect the semantics or assertions that say which sequences satisfy it. A variable number of operands in source code is an analogy unless the logical relation and truth conditions are also present.

Examples¶

Canonical: numeric ordering in the KIF draft¶

The KIF draft describes a less-than relation whose extension includes both <2,3> and <2,3,4>. It reads the first as 2<3, and the second as the chain 2<3 and 3<4.^[1]

Mapped back: One < relation supplies the symbol and extension; its entries are finite sequences of numbers of lengths two and three; the source specifies how those examples satisfy the relation. This is a specification illustration, not evidence of a running installation.

Applied/practice: SUMO-K partition relation¶

Brown, Pease and Urban describe the SUMO Partition relation as variable arity: at least two arguments are required, the arguments are classes, and additional arguments have the same intended class domain. They identify a six-argument assertion in the January 2023 Merge.kif file and describe translating relation information into higher-order set theory.^[3]

Mapped back: Partition is one ontology relation; class sequences are its argument objects; a minimum length and type guard describe admissible applications; the cited six-argument assertion supplies a concrete occurrence. Those conditions do not make every sequence of classes a true partition. The paper’s account does not establish measured production performance.

Structural Tensions¶

T1 — Flexibility and explicit meaning. Allowing one symbol at several lengths avoids fixing a separate name for every place count, but the vocabulary must still explain how each permitted sequence is interpreted. In the KIF example the longer ordering list has a stated adjacent-comparison reading; the SUMO relation also records a minimum and class domain. Diagnostic: What do added positions mean, and which sequences satisfy the relation?^[1]^[3]

Structural–Framed Character¶

This is a formal representation choice: one relation symbol is interpreted over finite sequences, with application and truth rules supplied by a language or ontology. It can be compared across different knowledge bases, but its success for a task depends on the intended semantics and the reasoning tools used. Ordinary statements with optional detail may suggest the idea; they do not alone establish the same formal interpretation. Its character: a domain-specific logical mechanism for reusing a relation symbol across variable finite argument sequences.^[1]^[2]

Structural Core vs. Domain Accent¶

The broader idea is to express configurations with varying numbers of participants. Here the core is fixed to a logical relation symbol, finite ordered arguments and a declared interpretation; those are constitutive formal roles. A programming callable or linguistic frame may show related variation without having the same logical semantics.

Finite Argument Arity describes a specified finite count of positions in a representation; this mechanism allows a single relation symbol to appear at different counts. Set-indexed Operation Arity studies a specified position set for an algebraic operation, and Variadic Function describes a programming callable. The comparisons expose distinct questions about positions, operations and logical satisfaction.

Neighborhood in Abstraction Space¶

Variable-polyadic relation sits in a moderately populated region (45^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Formal Models & Logical Foundations (37 abstractions)

Nearest neighbors

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

Not to Be Confused With¶

A declaration that Partition permits class arguments at lengths of at least two is a length and type condition, not an assertion that all such tuples are partitions. Similarly, a logical relation over finite lists is not a promise of infinitely long inputs or a universal account of natural-language valency.^[1]^[3]

References¶

[1] Knowledge Interchange Format, draft proposed American National Standard NCITS.T2/98-004 (1998), §5.1. https://www.jfsowa.com/ikl/KIFdpans.htm registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i

[2] Christopher Menzel, “Knowledge Representation, the World Wide Web, and the Evolution of Logic,” §3.1, author-paper copy. https://jfsowa.com/ikl/Menzel11.pdf registry ↩a ↩b ↩c ↩d ↩e ↩f

[3] Chad E. Brown, Adam Pease and Josef Urban, “Translating SUMO-K to Higher-Order Set Theory,” Frontiers of Combining Systems, Lecture Notes in Computer Science 14279 (2023), §2.2. https://doi.org/10.1007/978-3-031-43369-6_14 registry ↩a ↩b ↩c ↩d ↩e ↩f