A construction of Boolean algebras from first-order structures (Q685061)

Let \(\mathcal A\) be an \(\mathcal L\)-structure with underlying set \(A\), and \(\Sigma\) a theory in the language \(\mathcal L\) enlarged by a unary predicate. A subset \(U\) of \(A\) is called a \(\Sigma\)-set, if \(({\mathcal A},U)\) is a model of \(\Sigma\). If the sentences in \(\Sigma\) are of a special form (called universal over \({\mathcal L}\)), then the family of all \(\Sigma\)-sets is a closed subspace of \({\mathcal P}(A)\) (where \({\mathcal P}(A)\) is identified with \(^ A 2\) with the product topology) and thus a Boolean space. The author investigates the corresponding classes of Boolean algebras which can arise for a given set \(\Sigma\). She shows that several classes of Boolean algebras previously considered in the literature can thus be obtained. Among them are the classes of all Boolean algebras, free algebras, finite-cofinite algebras, pseudo-tree algebras and interval algebras. It is shown that the class of semigroup algebras is Horn definable. Further on the author gives some results how model-theoretic properties are reflected in the corresponding class of Boolean algebras.