Back to Search Start Over

Computability of a topological poset

Authors :
Gillam, W.D.
Source :
Topology & Its Applications. Jan2006, Vol. 153 Issue 7, p1132-1140. 9p.
Publication Year :
2006

Abstract

Abstract: For subspaces X and Y of the notation means that X is homeomorphic to a subspace of Y and means . The resulting set of equivalence classes is partially-ordered by the relation if . In a previous paper by the author it was established that this poset is essentially determined by considering only the scattered of finite Cantor–Bendixson rank. Results from that paper are extended to show that this poset is computable. [Copyright &y& Elsevier]

Details

Language :
English
ISSN :
01668641
Volume :
153
Issue :
7
Database :
Academic Search Index
Journal :
Topology & Its Applications
Publication Type :
Academic Journal
Accession number :
19588714
Full Text :
https://doi.org/10.1016/j.topol.2005.03.004