The number of argument places of a predicate symbol, specifying how many terms the predicate takes; a k-ary predicate relates k terms and is central to the signature of a language.

Principle

Arity classifies predicates by their argument structure and limits the shape of atomic formulas; it constrains the relations that can be expressed and affects translations, model constructions and decidability in fragments of logic.

Demonstration

A binary predicate R(x,y) has arity 2 and expresses a relation between pairs of domain elements; a nullary predicate P (often treated as a propositional atom) has arity 0 and denotes a truth-valued propositional property.

Misapplication

Confusing predicate arity with the number of occurrences of a predicate, with the arity of function symbols, or counting bound variables instead of argument positions is a typical misuse that obscures the correct structural role of arity.

Consequence

Fixing arity bounds (for example restricting to unary predicates) can drastically change expressive power and decidability: many decidable fragments arise precisely because predicate arities are limited, and arity influences canonical model shape.

Reversal

The inverted notion emphasizes variable-arity or unbounded-arity signatures where predicates may have arbitrarily large arities; allowing unbounded arity increases expressiveness but complicates many combinatorial and decidability arguments.

Boundary

Arity refers to the declared number of argument places in the signature and not to the number of distinct terms appearing in a particular atomic formula; it excludes meta-level parameter lists and is independent of domain cardinality.

Semantic Tension

Predicate arity competes with related ideas like predicate degree (how many tuples a predicate holds of in a structure) and function arity; a predicate's declared arity does not determine how many tuples actually satisfy it in a model, producing potential confusion.

Synthesis

Predicate arity is the declared count of term positions a predicate accepts (k for a k-ary predicate); it is a syntactic signature feature that governs the form of atomic formulas and strongly influences the language's expressiveness and model-theoretic behavior.