Boolean analysis
Boolean analysis was introduced by Flament (1976). The goal of a Boolean analysis is to detect deterministic dependencies between the items of a questionnaire or similar data-structures in observed response patterns. These deterministic dependencies have the form of logical formulas connecting the items. Assume, for example, that a questionnaire contains items i, j, and k. Examples of such deterministic dependencies are then i → j, i ∧ j → k, and i ∨ j → k.
known for
Link from a Wikipage to another Wikipage
known for
primaryTopic
Boolean analysis
Boolean analysis was introduced by Flament (1976). The goal of a Boolean analysis is to detect deterministic dependencies between the items of a questionnaire or similar data-structures in observed response patterns. These deterministic dependencies have the form of logical formulas connecting the items. Assume, for example, that a questionnaire contains items i, j, and k. Examples of such deterministic dependencies are then i → j, i ∧ j → k, and i ∨ j → k.
has abstract
Boolean analysis was introduce ...... ether with a Boolean analysis.
@en
Wikipage page ID
16,807,880
page length (characters) of wiki page
Wikipage revision ID
981,264,850
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
Boolean analysis was introduce ...... → j, i ∧ j → k, and i ∨ j → k.
@en
label
Boolean analysis
@en