Metraipolis › archive › dc_ac94202eb32c

Aronszajn tree — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Aronszajn_tree
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-09T23:38:07.603Z
SHA-256 of the archived text
c84c0038107a077db108d88b279e363a6115fbc8d2ae6c65e68be8dd7ba01cd1
Stable URL of this page
https://metraipolis.com/documento/dc_ac94202eb32c

How to cite

Aronszajn tree — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Aronszajn_tree (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_ac94202eb32c (Metraipolis archive dc_ac94202eb32c, sha256 c84c0038107a077db108d88b279e363a6115fbc8d2ae6c65e68be8dd7ba01cd1)
BibTeX
@misc{dcac94202eb32c,
  title = {Aronszajn tree — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Aronszajn_tree},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_ac94202eb32c; sha256 c84c0038107a077db108d88b279e363a6115fbc8d2ae6c65e68be8dd7ba01cd1},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Aronszajn_tree. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In set theory, an Aronszajn tree is a tree of uncountable height with no uncountable branches and no uncountable levels. For example, every Suslin tree is an Aronszajn tree. More generally, for a cardinal κ, a κ-Aronszajn tree is a tree of height κ in which all levels have size less than κ and all branches have height less than κ (so Aronszajn trees are the same as ℵ1-Aronszajn trees). They are named for Nachman Aronszajn, who constructed an Aronszajn tree in 1934; his construction was described by Kurepa (1935). A cardinal κ for which no κ-Aronszajn trees exist is said to have the tree property (sometimes the condition that κ is regular and uncountable is included).

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Aronszajn tree» — https://en.wikipedia.org/wiki/Aronszajn_tree
Wikidata Q1192020: «in set theory, a tree of uncountable height with no uncountable branches and no uncountable levels» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1192020
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Aronszajn_tree?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1325267411, consultata il 2026-11-09T23:33:49.312Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 169b63026da52f7e01a60b8b60fcd5e04a3f3a3fc137ad89d0cc7e9577fcac5b