Standard

Boolean hierarchies of partitions over a reducible base. / Selivanov, V. L.

In: Algebra and Logic, Vol. 43, No. 1, 01.01.2004, p. 44-61.

Research output: Contribution to journal › Article › peer-review

Harvard

Selivanov, VL 2004, 'Boolean hierarchies of partitions over a reducible base', Algebra and Logic, vol. 43, no. 1, pp. 44-61. https://doi.org/10.1023/B:ALLO.0000015130.31054.b3

APA

Selivanov, V. L. (2004). Boolean hierarchies of partitions over a reducible base. Algebra and Logic, 43(1), 44-61. https://doi.org/10.1023/B:ALLO.0000015130.31054.b3

Vancouver

Selivanov VL. Boolean hierarchies of partitions over a reducible base. Algebra and Logic. 2004 Jan 1;43(1):44-61. https://doi.org/10.1023/B:ALLO.0000015130.31054.b3

Author

Selivanov, V. L. / Boolean hierarchies of partitions over a reducible base. In: Algebra and Logic. 2004 ; Vol. 43, No. 1. pp. 44-61.

BibTeX

@article{ddac6e5e290a4e18b3da392d6194b64e,
title = "Boolean hierarchies of partitions over a reducible base",
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. {\textcopyright} 2004 Plenum Publishing Corporation.",
keywords = "Boolean hierarchy of partitions, Lattice of open sets of the Baire space, Lattice of recursively enumerable sets, Lattice with the reduction property",
author = "Selivanov, {V. L.}",
year = "2004",
month = jan,
day = "1",
doi = "10.1023/B:ALLO.0000015130.31054.b3",
language = "English",
volume = "43",
pages = "44--61",
journal = "Algebra and Logic",
issn = "0002-5232",
publisher = "Springer Nature",
number = "1",

}

RIS

TY - JOUR

T1 - Boolean hierarchies of partitions over a reducible base

AU - Selivanov, V. L.

PY - 2004/1/1

Y1 - 2004/1/1

N2 - 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. © 2004 Plenum Publishing Corporation.

AB - 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. © 2004 Plenum Publishing Corporation.

KW - Boolean hierarchy of partitions

KW - Lattice of open sets of the Baire space

KW - Lattice of recursively enumerable sets

KW - Lattice with the reduction property

UR - http://www.scopus.com/inward/record.url?scp=33750048402&partnerID=8YFLogxK

U2 - 10.1023/B:ALLO.0000015130.31054.b3

DO - 10.1023/B:ALLO.0000015130.31054.b3

M3 - Article

AN - SCOPUS:33750048402

VL - 43

SP - 44

EP - 61

JO - Algebra and Logic

JF - Algebra and Logic

SN - 0002-5232

IS - 1

ER -

ID: 127140695