scientific article
From MaRDI portal
Publication:3669469
zbMath0519.06002MaRDI QIDQ3669469
Publication date: 1981
Full work available at URL: https://eudml.org/doc/116814
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dedekind completionSuslin treeBlumberg spaceSuslin continuumK0-spaceslinearly ordered first countable continuumnon-separable linearly ordered continuumSuslin problemuncountable treeunion of antichains
Partial orders, general (06A06) Continua and generalizations (54F15) Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces (54F05) Counterexamples in general topology (54G20) Total orders (06A05) Separability of topological spaces (54D65)
Related Items
Everywhere dense metrizable subspaces of Corson compacta, Partition relations for partially ordered sets, Closure-preserving covers by small sets, On trees and dual rotund norms, Products and Remote Points: Examples and Counterexamples, Conjectures of Rado and Chang and special Aronszajn trees, Algebraic objects generated by topological structure, Dense metrizable subspaces in powers of Corson compacta, Observations about Scott and Karp trees, Two applications of finite side conditions at \(\omega _2\), Dense metrizability, Monotonically monolithic spaces, Corson compacts, and \(D\)-spaces, Aronszajn trees, square principles, and stationary reflection, The special tree number, Rado’s Conjecture and its Baire version, A theory of stationary trees and the balanced Baumgartner-Hajnal-Todorcevic theorem for trees, Trees, ladders and graphs, An Asplund space with norming Markuševič basis that is not weakly compactly generated, Hedetniemi's conjecture for uncountable graphs, SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS, On some classes of Lindelöf \(\Sigma\)-spaces, Trees, Gâteaux norms and a problem of Haydon, The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable, Game-theoretic inductive definability
