Representation of ordinal contexts by ordered \(n\)-quasigroups (Q1911850)

In data analysis dependencies between attributes are of central interest. An important question is whether there exist algebraic descriptions of these dependencies. It is shown that simple ordinal axioms already allow to describe dependencies between ordinal attributes by ordered \(n\)-quasigroup operations. This is done with respect to \(n\) distinguished attributes. Further questions concerning stronger representations by ordered \(n\)-quasigroups are also discussed.