A rule of inference used in prepositional logic. Written 'Assoc.' for short. It allows you to change the parenthesis for order of operations in situations when it will make no logical difference, but will allow you to manipulate statements in useful ways. To demonstrate:

(P∨{Q∨R}) = ({P∨Q}∨R)
(P∧{Q∧R}) = ({P∧Q}∧R)

Back up to Rules of Inference
Review your Logic symbols

A property some binary operations possess. The operation @ is associative if for all a,b,c

a@(b@c) = (a@b)@c


Non examples:

These all are not associative.

Note that the operation @ must have the type AxA -> A. So it is a categorical error to suggest that relations might be associative.

Log in or register to write something here or to contact authors.