Finite Argument Arity

Version

v2 · 2026-10-31 · History

Prime #

1603

Domain group

Formal Sciences

Origin domain

Mathematics

Related primes

Cardinality, Predicate, Relation, Function (Mapping)

Core Idea

Finite argument arity is the number of argument places assigned to a particular symbol or represented relation in a stated signature or schema. The number can be zero. Where applications are defined, their arguments must match the declared places; using the same value twice does not turn two places into one.^[1][2]

How would you explain it like I'm…

Counting the Seats

Some words come with empty seats that need filling. "Hug" has two seats: one for who is hugging and one for who gets hugged. You can even put the same teddy in both seats, and it is hugging itself! Counting the seats tells you the word's number, even if nobody is sitting in them yet.

How Many Blanks

When we write down a word or symbol in a careful way, we can decide how many blanks it has to fill in. "___ is taller than ___" has two blanks, so its number of places is 2. The blanks are spots, not people, so the same person can go in both, like "Sam is taller than Sam" (which is false, but still filled in correctly). A symbol can even have zero blanks and stand on its own. And if someone wrote the same idea a different way, it might have a different number of blanks.

Fixed Argument-Place Count

In logic and math, a symbol's arity is the number of argument places it was declared to have, and Finite Argument Arity means that number is a whole number like 0, 1, 2, or 3. A unary function such as "square of" has one place; a binary relation such as "is less than" has two. An argument place is a position, not an object, so the same term can fill several places, as in "x < x". The count is a fact about how the symbol is set up, not about the world: you could also describe "between" as a three-place relation or rebuild it out of two-place pieces. A symbol can have its arity declared before anyone ever uses it, and a relation can have an arity even if nothing actually stands in it. Arity zero is allowed too: a zero-place operation just names a single fixed element, such as a constant.

 

Finite Argument Arity is the property that a symbol or represented relation has been assigned, by its declaration, a finite family of argument places; its arity is the size n of that family, a nonnegative integer. In a formal signature, for example, a function symbol f of arity 2 must be applied to exactly two terms to form a well-formed term, one per place, according to the formation rules. The arity is relative to the representation, not intrinsic to some underlying fact: currying, reification, or a different choice of primitives can turn a three-place relation into binary ones, so different analyses of the same situation can assign different counts. Places are positions or labelled attributes (as in a relational database schema), not occupants, so a binary expression like R(a, a) is perfectly well-formed with one term filling both places. Declaring an arity does not require that the symbol ever be applied, and a relation of arity n may have an empty extension, containing no n-tuples. Arity zero is possible whenever the representation allows an empty family of places. A nullary operation on a set S is a map S^0 -> S, and since S^0 has exactly one element, such an operation amounts to picking an element of S; consequently no nullary operation exists on the empty set.

Broad Use

A formal language uses place counts to shape expressions. A relational analysis can count labelled participant roles in a particular represented predicate. The count can travel between these settings, but each representation supplies its own labels and interpretation.^[1][3]

Clarity

The count answers how many places there are. It does not say what the places mean, which values fill them, or whether any actual application exists.

Manages Complexity

A declared count offers a simple shape check. Additional syntax, typing, and role rules may still be needed.

Abstract Reasoning

A binary predicate expects two term places; a one-term expression misses one. A zero-place operation is possible under an appropriate representation, but an operation \(S^0\to S\) requires an element of \(S\) and cannot exist when \(S\) is empty.^[2]

Knowledge Transfer

Compare the bearer and its place family before comparing counts. Equal counts do not imply equal meanings, and modifying a predicate can produce a new scheme.

Example

In the Open Logic Project's arithmetic language, less-than is two-place and successor one-place.^[1] In Poller's analysis of “Yawning, she gave Tom a book,” a joined predicate has three labelled attributes: agent, object, and beneficiary.^[3] The latter is a specific modelling example, not a universal rule for “give.”

Not to Be Confused With

Cardinality is the broader idea of collection size; a predicate or relation describes a bearer and its meaning, not just its number of places. General arity conventions can use infinite index sets and are broader than this finite-count entry.^[2]

Notes

The count alone does not preserve the order, labels, or meanings of places, or show that a relation has any tuples.

References

[1] Open Logic Project, First-order Logic, revision 9620cc7 (2026-07-12), Example 2.1 and Definitions 2.4–2.5, pp. 13–15. The document is updated over time. registry ↩a ↩b ↩c

[2] George M. Bergman, An Invitation to General Algebra and Universal Constructions, version 3.0, §1.4 and Definition 8.1.1. registry ↩a ↩b ↩c

[3] Olga Poller, “Natural-Language Predicates as Relations of the Relational Model of Data,” Global Philosophy (2022), §6.2 and Fig. 1. DOI: 10.1007/s10516-022-09649-9. registry ↩a ↩b