2008
DOI: 10.1016/j.ic.2007.06.003
|View full text |Cite
|
Sign up to set email alerts
|

The boolean hierarchy of NP-partitions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
11
0

Year Published

2008
2008
2012
2012

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(12 citation statements)
references
References 19 publications
1
11
0
Order By: Relevance
“…We will characterize the corresponding algebra in the class of so-called semilattices with discrete closures, introduced in our previous work on complete numberings and fine hierarchies of the arithmetical sets and functions (see [6,7]). We also extend the main results of this paper, as well as some of the results in [1,4,5], to the countable case, which yields a generalization of the classical Hausdorff difference hierarchy to the case of k-partitions.…”
Section: Introductionsupporting
confidence: 52%
See 1 more Smart Citation
“…We will characterize the corresponding algebra in the class of so-called semilattices with discrete closures, introduced in our previous work on complete numberings and fine hierarchies of the arithmetical sets and functions (see [6,7]). We also extend the main results of this paper, as well as some of the results in [1,4,5], to the countable case, which yields a generalization of the classical Hausdorff difference hierarchy to the case of k-partitions.…”
Section: Introductionsupporting
confidence: 52%
“…Can the notion of the Boolean hierarchy be naturally extended to arbitrary k in place of 2? A partial answer to this question was suggested in [4,5] by introducing a hierarchy RBH k (L), which was called the Boolean hierarchy of k-partitions over L, because elements of k M are in a natural bijective correspondence with k-partitions of M (i.e., pairwise disjoint sets A 0 , . .…”
Section: Introductionmentioning
confidence: 99%
“…In this section we recall some definitions and facts for the so called homomorphic preorder [8,9,13,14,21,23]. Most posets considered here are assumed to be (at most) countable and without infinite chains.…”
Section: The Homomorphic Preordermentioning
confidence: 99%
“…In this section we consider the Boolean hierarchy of k-partitions, which was studied for the case of finite k-posets in [13,14,21] and for the countable case in [23]. Let P = (P ; ≤) be a countable poset without infinite chains, X be a space, and L be a σ-base in X (see Section 1).…”
Section: The Boolean Hierarchymentioning
confidence: 99%
See 1 more Smart Citation