Aronszajn tree

Known as: Aronszajn trees, Special Aronszajn tree, Tree property

In set theory, an Aronszajn tree is an uncountable tree with no uncountable branches and no uncountable levels. For example, every Suslin tree is an…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

In a new approach, functional correctness specifications of insert/update and delete operations on search trees are expressed on…

2012

Abstract We show that given ω many supercompact cardinals, there is a generic extension in which the tree property holds at ℵω2…

2011

The main result is that a separable Banach space with the weak* unconditional tree property is isomorphic to a subspace as well…

2009

It is relatively consistent with the existence of two supercompact cardinals that a special Aronszajn tree of height $${\aleph_…

2004

In this paper, we develop a measure-theoretic version of the junction tree algorithm to compute desired marginals of a product…

1999

The Kuznetsov–Index of a modal logic is the least cardinal μ such that any consistent formula has a Kripke–model of size ≤ μ if…

1995

The undirected technique for evaluating belief networks [Jensen et al., 199Oa, Lauritzen and Spiegelhalter, 1988] requires…

1994

Introduction. In [Sh, Chapter IX], Shelah constructs a model of set theory in which Suslin's hypothesis is true, yet there is an…

1983

We give two new finite combinatorial statements which are independent of Peano arithmetic, using the methods of Kirby and Paris…

Review

1982

Review

1982

This survey describes the contribution of N. Aronszajn to set theory: the construction of an Aronszajn tree. We would like to…