- polyadic
- In one usage a term for a function or predicate that takes more than one argument. Sometimes a function or predicate is polyadic if it is a function that can take a varying number of arguments, or a relational predicate that can relate a varying number of things. ‘a, b…n are brothers’ can be true for varying numbers of people; and similarly ‘the eldest of a, b…n’.

*Philosophy dictionary.
Academic.
2011.*

### Look at other dictionaries:

**polyadic**— adjective a) Of or pertaining to a polyad b) Comprising many elements … Wiktionary**polyadic**— [ˌpɒlɪ adɪk] adjective involving three or more elements or parts. Origin early 20th cent.: from poly , on the pattern of words such as dyadic … English new terms dictionary**polyadic**— poly·ad·ic … English syllables**polyadic**— adjective see polyad II, 1 … Useful english dictionary**Pi-calculus**— In theoretical computer science, the pi calculus is a process calculus originally developed by Robin Milner, Joachim Parrow and David Walker as a continuation of work on the process calculus CCS (Calculus of Communicating Systems). The aim of the … Wikipedia**π-calculus**— In theoretical computer science, the π calculus (or pi calculus) is a process calculus originally developed by Robin Milner, Joachim Parrow and David Walker as a continuation of work on the process calculus CCS (Calculus of Communicating Systems) … Wikipedia**Quasigroup**— In mathematics, especially in abstract algebra, a quasigroup is an algebraic structure resembling a group in the sense that division is always possible. Quasigroups differ from groups mainly in that they need not be associative. A quasigroup with … Wikipedia**Arity**— In logic, mathematics, and computer science, the arity i/ˈær … Wikipedia**Monadic predicate calculus**— In logic, the monadic predicate calculus is the fragment of predicate calculus in which all predicate letters are monadic (that is, they take only one argument), and there are no function letters. All atomic formulae have the form P(x), where P… … Wikipedia**Lindström quantifier**— In mathematical logic, a Lindström quantifier is a generalized polyadic quantifier. They are a generalization of first order quantifiers, such as the existential quantifier, the universal quantifier, and the counting quantifiers.They were… … Wikipedia