inclusion.rule: Inclusion Rule
In eba: Elimination-by-Aspects Models

Description Usage Arguments Details Value References See Also Examples

Checks if a family of sets fulfills the inclusion rule.

1	inclusion.rule(A)

`A`	a list of vectors consisting of the stimulus aspects of an elimination-by-aspects model

The inclusion rule is necessary and sufficient for a tree structure on the aspect sets:

Structure theorem. A family \{x' | x \in T\} of aspect sets is representable by a tree iff either x' \cap y' \supset x' \cap z' or x' \cap z' \supset x' \cap y' for all x, y, z in T. (Tversky and Sattath, 1979, p. 546)

Either TRUE if the inclusion rule holds for A, or FALSE otherwise.

Tversky, A., & Sattath, S. (1979). Preference trees. Psychological Review, 86, 542–573. doi: 10.1037/0033-295X.86.6.542

eba, trineq, strans.

A <- list(c(1, 5), c(2, 5), c(3, 6), c(4, 6))  # tree
inclusion.rule(A)

B <- list(c(1, 5), c(2, 5, 6), c(3, 6), c(4, 6))  # lattice
inclusion.rule(B)