Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Kurepa treeKönig's lemmaSet theorySuslin tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Blind Image Watermarking in Canonical and Cepstrum Domains Based on 4-Connected t-o'clock Scrambling
Copyright protection of multimedia content is confronted with great challenges such as easy access to the Internet. Digital… 
2016
2016
The tree property below ℵω⋅2
2013
2013
Weak square sequences and special Aronszajn trees
. A classical theorem of set theory is the equivalence of the weak square principle (cid:3) ∗ µ with the existence of a special… 
2011
2011
Subspaces and quotients of Banach spaces with shrinking unconditional bases
The main result is that a separable Banach space with the weak* unconditional tree property is isomorphic to a subspace as well… 
2009
2009
Forking in NTP_2 theories
We prove that in theories without the tree property of the second kind (which include dependent and simple theories) forking and… 
2005
2005
Finite Tree Property for First-Order Logic with Identity and Functions
1999
1999
Modal Logics That Need Very Large Frames
  • M. Kracht
  • Notre Dame J. Formal Log.
  • 1999
  • Corpus ID: 27423343
The Kuznetsov–Index of a modal logic is the least cardinal μ such that any consistent formula has a Kripke–model of size ≤ μ if… 
1995
1995
Clustering Without (Thinking About) Triangulation
The undirected technique for evaluating belief networks [Jensen et al., 199Oa, Lauritzen and Spiegelhalter, 1988] requires… 
1983
1983
Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic
We give two new finite combinatorial statements which are independent of Peano arithmetic, using the methods of Kirby and Paris… 
1982
1982
The tree property is fundamental for query processing
One can partition the class of relational database schemas into tree schemas and cyclic schemas. In this paper we examine query… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)