  We propose and develop an algebraic approach to revealed preference. Our
approach dispenses with non algebraic structure, such as topological
assumptions. We provide algebraic axioms of revealed preference that subsume
previous, classical revealed preference axioms, as well as generate new axioms
for behavioral theories, and show that a data set is rationalizable if and only
if it is consistent with an algebraic axiom.
