On decidability of finite subsets’ theory for dense linear order

We consider atomless boolean algebras, and study algebraic structures where the universe consists of finite subsets of such an algebra. On these structures, we define the new relation between finite subsets: we say that one set is less than another one iff all elements of the first set are less than all elements of the second one. We show that the theory of constructed structure is reducible to the theory of original boolean algebra. Hence, the theory of constructed structure is decidable.