Boolean Hierarchies of Partitions over a Reducible Base
Algebra i logika, Tome 43 (2004) no. 1, pp. 77-109
Voir la notice de l'article provenant de la source Math-Net.Ru
The Boolean hierarchy of partitions was introduced and studied by Kosub and Wagner, primarily over the lattice of $NP$-sets. Here, this hierarchy is treated over lattices with the reduction property, showing that it has a much simpler structure in this instance. A complete characterization is given for the hierarchy over some important lattices, in particular, over the lattices of recursively enumerable sets and of open sets in the Baire space
Keywords:
Boolean hierarchy of partitions, lattice with the reduction property, lattice of recursively enumerable sets, lattice of open sets of the Baire space.
@article{AL_2004_43_1_a3,
author = {V. L. Selivanov},
title = {Boolean {Hierarchies} of {Partitions} over {a~Reducible} {Base}},
journal = {Algebra i logika},
pages = {77--109},
publisher = {mathdoc},
volume = {43},
number = {1},
year = {2004},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/AL_2004_43_1_a3/}
}
V. L. Selivanov. Boolean Hierarchies of Partitions over a Reducible Base. Algebra i logika, Tome 43 (2004) no. 1, pp. 77-109. http://geodesic.mathdoc.fr/item/AL_2004_43_1_a3/