This article is within the scope ofWikiProject Mathematics, a collaborative effort to improve the coverage ofmathematics on Wikipedia. If you would like to participate, please visit the project page, where you can jointhe discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
This article is within the scope ofWikiProject Philosophy, a collaborative effort to improve the coverage of content related tophilosophy on Wikipedia. If you would like to support the project, please visit the project page, where you can get more details on how you can help, and where you can join thegeneral discussion about philosophy content on Wikipedia.PhilosophyWikipedia:WikiProject PhilosophyTemplate:WikiProject PhilosophyPhilosophy
This article is within the scope ofWikiProject Computer science, a collaborative effort to improve the coverage ofComputer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can jointhe discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science
Also, in non-functional programming, a function without arguments can be meaningful and not necessarily constant (due to side effects).
Technically, "pure" should replace "functional", but programming is impure by default (pure programming is a special case of general programming).— Precedingunsigned comment added by173.176.165.23 (talk)08:03, 29 April 2012 (UTC)[reply]
The list of adjectives "unary", "binary", "ternary", ... is informative but it should link to the wiktionary, not the wikipedia. I'll do that asap. Having "denary" point to Decimal is rather confusing...
Actually, it's arities above 2 that are rare. Further, the alleged reason seems invalid to me. The fact that one could formally represent anyn-ary operation withn > 2 as the composition of binary operations by using a cute trick is quite separate from the fact that we relatively rarely have a use for such operations in mathematics. I've removed most of this statement but I preserve it here in case anyone can find a good justification, or some use for it:
Arities greater than 4 are seldom encountered inmathematics andcomputer science. This fact has a mathematical justification. Burris and Sankappanavar (1981: Ex. IV.7.8) attribute toSierpinski a theorem to the effect that any finitary operation on a finite set can be expressed as the composition of binary operations.
Actually arities above 2 aren't very rare. Take Integration for example; An operation on a given function (operand), starting value (operand), ending value (operand). Another example: Summation (for the same reason, function, start, end). Another Example (capital PI notation for products of sequences, same as before). Of course, one may argue that one is really performing the integration over an interval (just one operand) or over an area/volume/etc. as just one operand, and it is just convention to define that volume with a list of various values.
Most stuff in math is not about finite sets, so there wasa fair bit of stretch from that result to math in general. Also, can be expressed doesn't mean it's convenient to do it. The claim about computer science was even more silly. Just think ofrelational databases; most tables in practice have more than two or three columns.Tijfo098 (talk)09:12, 27 November 2012 (UTC)[reply]
Would it be possible to edit this page with a few examples. I'm not against complex greek and roman math symbols, but most of the people I know glaze over when they see any complicated numbers.
Also, perhaps more context examples would be useful...
I agree. Let's have an example of some of these, at least one in arithmetic, and one for the bigger, um, things. Otherwise, this is not appropriate for a layman.
The synonyms of arity are given as adicity, type and rank. I would challenge the latter two.Types as used in programming include characteristics of components, not just their number. The type of a function is a different concept which includes the type of its return value.Rank conveys a sense of order of one thing bring of higher rank than another. Both of these words do not seem to really bysynonyms of arity. (Adicity is fine as a synonym; a function that takes a variable number of arguments is variadic, for example.)Ablonus (talk)13:23, 27 November 2008 (UTC)[reply]
I never heard of "variadic", and if I wanted to challenge anything it would be "adicity" - but Google Scholar has quite a few hits for that. Both "type" and "rank" are very plausible as synonyms for "arity" in some fields of mathematics, although it's hard to search for such uses. That "type" has another, unrelated, meaning in computer science is no more relevant than the fact that it also has another, unrelated, meaning in model theory (seetype (model theory)). BTW, the most important synonym of "n-adic" seems to be missing because it doesn't have a version as a noun: "n-place". --Hans Adler (talk)13:34, 27 November 2008 (UTC)[reply]
OK. I wasn't aware that they could be synonyms in some fields of mathematics so it's good you mentioned that. I can only comment on the computing side. The opening sentence which currently says, "In logic, mathematics, and computer science, the arity (synonyms include type, adicity, and rank) of a function..." makes it sound as though such synonyms apply to computer science (and, for that matter, to mathematics generally not just parts thereof). That does not seem to be a valid assertion. (By the way the most common example of a variadic function is C's printf. Being variadic it takes an indefinite number of arguments.)Ablonus (talk)10:21, 28 November 2008 (UTC)[reply]
Ah, I must have heard this in the C context before. I don't agree with your reading of the parentheses. After all, we add synonyms for users who are more familiar with them than with the article title, not as a recommendation to actually use them. (Unless we do it in the article.) Therefore it doesn't seem really relevant in which fields the synonyms are used. --Hans Adler (talk)13:46, 28 November 2008 (UTC)[reply]
That works well when dealing with one subject area or one discipline. In this case, however, three disciplines are mentioned specifically. In the very same sentence (the first) where the three areas of applicability are mentioned the article states that Type and Rank are synonyms. A person who did not know the topic would naturally, on reading this, understand that the synonyms are generally applicable. The first sentence does NOT make it clear that Type is a synonym of Arity only in the fields of mathematics and logic and not in computer science. (Presumably logic goes along with mathematics but maybe not.)Ablonus (talk)15:08, 28 November 2008 (UTC)[reply]
Can this section of the discussion page be deleted now? The change being discussed was made more than a year ago. I'm not sure what the guidelines are for when to delete discussion sections.Ablonus (talk)10:55, 20 March 2010 (UTC)[reply]
Is the term arity only colloquial use and adicity formal usage? Arity sounds a bit like this, but I am no native speaker. This might be indecated. --Munibert (talk)21:05, 30 June 2010 (UTC)[reply]
The article says that the term "dyadic" less ambiguous than "binary",
... as illustrated by the term dyadic Boolean operator where boolean can be safely replaced by binary, but replacing dyadic by binary exposes the ambiguity.
I do not agree.
It is not safe (in the sense of "does not change the meaning") to replace "boolean" by "binary". A boolean operator is a function defined on B, the set of two truth values, or some (finite) power of B; a binary operator is an operator that takes two arguments (usually from the same set.
It is true that the term "binary" is used in other contexts, such as "binary arithmetic", where it does not refer to arity. But also "dyadic" is used in other contexts, such asdyadic rationals.
The example under the ternary heading that uses assembly language is wrong: The notation employed implies AT&T syntax, so the source and destination operands are reversed; the instruction actually moves data from the AX register to memory.— Precedingunsigned comment added by79.168.133.49 (talk)03:09, 18 June 2014 (UTC)[reply]
This article seems to be written largely from a computer science perspective, but arity differs between computer science and mathematics. It may be worth moving this page to "arity (computer science)" and having a disambiguation page between here andfinitary relation, which discusses the mathematical definition. Mathematical arity is a property of relations, not functions, which do not distinguish "inputs" and "outputs".
Of the "mathematical" examples in the table, only one - the additive inverse as a unary relation - is accurate. I have not seen the mathematical definition of arity applied to constants, but if pressed I would define them as unary relations containing a single element; addition is a ternary () or n-ary relation; the triple products are quaternary. The only mathematical nullary relations are the empty set and the set of one element containing the empty tuple, which see some use inrelational algebra.
Incorporating the difference would probably require substantial rewriting or the aforementioned move/disambiguate, and I'm inclined to ask here first in case someone has other ideas.Fishsicles (talk)17:03, 20 March 2025 (UTC)[reply]
The redirectAdic has been listed atredirects for discussion to determine whether its use and function meets theredirect guidelines. Readers of this page are welcome to comment on this redirect atWikipedia:Redirects for discussion/Log/2024 March 12 § Adic until a consensus is reached.1234qwer1234qwer413:03, 12 March 2024 (UTC)[reply]
