Let (R, less than or equal to) be a linearly ordered set. A bottleneck
algebra is the set R together with two operations a + b = max {a,b} a
nd a x b = min {a,b}. In this paper we suggest various definitions of
linear independence of sets of n-tuples over R and study their charact
eristics and interrelations.