出典(authority):フリー百科事典『ウィキペディア（Wikipedia）』「2015/10/15 13:57:35」(JST)
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (June 2009) 
Transformation rules 

Propositional calculus 
Rules of inference 

Rules of replacement 

Predicate logic 


In mathematics, the associative property^{[1]} is a property of some binary operations. In propositional logic, associativity is a valid rule of replacement for expressions in logical proofs.
Within an expression containing two or more occurrences in a row of the same associative operator, the order in which the operations are performed does not matter as long as the sequence of the operands is not changed. That is, rearranging the parentheses in such an expression will not change its value. Consider the following equations:
Even though the parentheses were rearranged, the values of the expressions were not altered. Since this holds true when performing addition and multiplication on any real numbers, it can be said that "addition and multiplication of real numbers are associative operations".
Associativity is not to be confused with commutativity, which addresses whether a × b = b × a.
Associative operations are abundant in mathematics; in fact, many algebraic structures (such as semigroups and categories) explicitly require their binary operations to be associative.
However, many important and interesting operations are nonassociative; some examples include subtraction, exponentiation and the vector cross product. In contrast to the theoretical counterpart, the addition of floating point numbers in computer science is not associative, and is an important source of rounding error.
Formally, a binary operation ∗ on a set S is called associative if it satisfies the associative law:
Here, ∗ is used to replace the symbol of the operation, which may be any symbol, and even the absence of symbol like for the multiplication.
The associative law can also be expressed in functional notation thus: f(f(x, y), z) = f(x, f(y, z)).
If a binary operation is associative, repeated application of the operation produces the same result regardless how valid pairs of parenthesis are inserted in the expression.^{[2]} This is called the generalized associative law. For instance, a product of four elements may be written in five possible ways:
If the product operation is associative, the generalized associative law says that all these formulas will yield the same result, making the parenthesis unnecessary. Thus "the" product can be written unambiguously as
As the number of elements increases, the number of possible ways to insert parentheses grows quickly, but they remain unnecessary for disambiguation.
Some examples of associative operations include the following.
"hello"
, " "
, "world"
can be computed by concatenating the first two strings (giving "hello "
) and appending the third string ("world"
), or by joining the second and third string (giving " world"
) and concatenating the first string ("hello"
) with the result. The two methods produce the same result; string concatenation is associative (but not commutative).×  A  B  C 

A  A  A  A 
B  A  B  C 
C  A  A  A 
In standard truthfunctional propositional logic, association,^{[3]}^{[4]} or associativity^{[5]} are two valid rules of replacement. The rules allow one to move parentheses in logical expressions in logical proofs. The rules are:
and
where "" is a metalogical symbol representing "can be replaced in a proof with."
Associativity is a property of some logical connectives of truthfunctional propositional logic. The following logical equivalences demonstrate that associativity is a property of particular connectives. The following are truthfunctional tautologies.
Associativity of disjunction:
Associativity of conjunction:
Associativity of equivalence:
A binary operation on a set S that does not satisfy the associative law is called nonassociative. Symbolically,
For such an operation the order of evaluation does matter. For example:
Also note that infinite sums are not generally associative, for example:
whereas
The study of nonassociative structures arises from reasons somewhat different from the mainstream of classical algebra. One area within nonassociative algebra that has grown very large is that of Lie algebras. There the associative law is replaced by the Jacobi identity. Lie algebras abstract the essential nature of infinitesimal transformations, and have become ubiquitous in mathematics.
There are other specific types of nonassociative structures that have been studied in depth; these tend to come from some specific applications or areas such as combinatorial mathematics. Other examples are Quasigroup, Quasifield, Nonassociative ring, Nonassociative algebra and Commutative nonassociative magmas.
In mathematics, addition and multiplication of real numbers is associative. By contrast, in computer science, the addition and multiplication of floating point numbers is not associative, as rounding errors are introduced when dissimilarsized values are joined together.^{[6]}
To illustrate this, consider a floating point representation with a 4bit mantissa:
(1.000_{2}×2^{0} + 1.000_{2}×2^{0}) + 1.000_{2}×2^{4} = 1.000_{2}×2^{1} + 1.000_{2}×2^{4} = 1.001_{2}×2^{4}
1.000_{2}×2^{0} + (1.000_{2}×2^{0} + 1.000_{2}×2^{4}) = 1.000_{2}×2^{0} + 1.000_{2}×2^{4} = 1.000_{2}×2^{4}
Even though most computers compute with a 24 or 53 bits of mantissa,^{[7]} this is an important source of rounding error, and approaches such as the Kahan Summation Algorithm are ways to minimise the errors. It can be especially problematic in parallel computing.^{[8]} ^{[9]}
In general, parentheses must be used to indicate the order of evaluation if a nonassociative operation appears more than once in an expression. However, mathematicians agree on a particular order of evaluation for several common nonassociative operations. This is simply a notational convention to avoid parentheses.
A leftassociative operation is a nonassociative operation that is conventionally evaluated from left to right, i.e.,
while a rightassociative operation is conventionally evaluated from right to left:
Both leftassociative and rightassociative operations occur. Leftassociative operations include the following:
Rightassociative operations include the following:
Nonassociative operations for which no conventional evaluation order is defined include the following.
Look up associative property in Wiktionary, the free dictionary. 
Definition 1.1 (i) a(bc) = (ab)c for all a, b, c in G.
If are elements of a set with an associative operation, then the product is unambiguous; this is, the same element will be obtained regardless of how parentheses are inserted in the product
全文を閲覧するには購読必要です。 To read the full text you will need to subscribe.
リンク元  「associate」「union」「連合性」「federation」「associational」 
拡張検索  「associative memory」「associative strength」 