Abstrakt: |
The notion of Δ-categoricity in linear orderings and Boolean algebras is examined. We provide a proof for the fact that there are uncountably many relatively Δ-categorical linear orderings, and furnish a proof of another fact which suggests that the (unrelatively) Δ-categorical linear orderings may be very difficult to classify. In stark contrast to these results for linear orderings, a complete classification of the relatively Δ-categorical Boolean algebras is given. [ABSTRACT FROM AUTHOR] |