A sequentially rationalizable choice function is a choice function that can be retrieved by applying sequentially to each choice problem the same fixed set of asymmetric binary relations (rationales) to remove inferior alternatives. These concepts translate into economic language some human choice heuristics studied in psychology and explain cyclical patterns of choice observed in experiments. We study some properties of sequential rationalizability and provide a full characterization of choice functions rationalizable by two and three rationales.