English

Acceptable colorings of indexed hyperspaces

Logic 2019-02-20 v1

Abstract

Previous results about nn-grids with acceptable colorings are extended to nn-indexed hyperspaces, which are structures A=(A;E0,E1,,En1){\mathcal A} = (A;E_0,E_1, \ldots, E_{n-1}), where each EiE_i is an equivalence relation.

Keywords

Cite

@article{arxiv.1802.00370,
  title  = {Acceptable colorings of indexed hyperspaces},
  author = {James H. Schmerl},
  journal= {arXiv preprint arXiv:1802.00370},
  year   = {2019}
}