Math 2.0

Areas Set theory Topic

Trees, Suslin's problem and combinatorial principles

Summary

This topic is a part of set theory. It covers trees on cardinals, Aronszajn, Suslin and Kurepa trees, Suslin's problem, and the guessing and coherence principles such as diamond, square and morasses.

About this page
TagD51VHW7R6K
URIm2://D51VHW7R6K
Kindtopic
WritingW0 stub
MSC03E05, 03E65
Part ofSet theory
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.