|
This article is cited in 32 scientific papers (total in 32 papers)
Boolean Hierarchies of Partitions over a Reducible Base
V. L. Selivanov Novosibirsk State Pedagogical University
Abstract:
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.
Received: 11.09.2001 Revised: 03.09.2003
Citation:
V. L. Selivanov, “Boolean Hierarchies of Partitions over a Reducible Base”, Algebra Logika, 43:1 (2004), 77–109; Algebra and Logic, 43:1 (2004), 44–61
Linking options:
https://www.mathnet.ru/eng/al58 https://www.mathnet.ru/eng/al/v43/i1/p77
|
Statistics & downloads: |
Abstract page: | 523 | Full-text PDF : | 135 | References: | 69 | First page: | 1 |
|