Topologies on Pseudo-Trees and Applications
Jacek Nikiel
Jan 1989 · American Mathematical Soc.
Kitabu pepe
116
Kurasa
reportUkadiriaji na maoni hayajahakikishwa Pata Maelezo Zaidi
Kuhusu kitabu pepe hiki
A pseudo-tree is a partially ordered set such that the set of all predecessors of any element is linearly ordered. Clearly, each linearly ordered set is a pseudo-tree and pseudo-trees are, in general, much more complicated objects than chains. The aim of this paper is to develop a theory of natural order topologies on pseudo-trees which extends the theories of linearly ordered topological spaces and GO-spaces. Moreover, applications are given for some classes of continua which admit a natural ordering.
Kadiria kitabu pepe hiki
Tupe maoni yako.
Kusoma maelezo
Simu mahiri na kompyuta vibao
Sakinisha programu ya Vitabu vya Google Play kwa ajili ya Android na iPad au iPhone. Itasawazishwa kiotomatiki kwenye akaunti yako na kukuruhusu usome vitabu mtandaoni au nje ya mtandao popote ulipo.
Kompyuta za kupakata na kompyuta
Unaweza kusikiliza vitabu vilivyonunuliwa kwenye Google Play wakati unatumia kivinjari cha kompyuta yako.
Visomaji pepe na vifaa vingine
Ili usome kwenye vifaa vya wino pepe kama vile visomaji vya vitabu pepe vya Kobo, utahitaji kupakua faili kisha ulihamishie kwenye kifaa chako. Fuatilia maagizo ya kina ya Kituo cha Usaidizi ili uhamishe faili kwenye visomaji vya vitabu pepe vinavyotumika.
