Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,259,339 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Kurepa tree
König's lemma
Set theory
Suslin tree
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Influence of compatibilizers on the water-tree property of Montmorillonite / Cross-linked polyethylene nanocomposites
Xiufeng Li
,
Xin Liu
,
+4 authors
Huajun Liu
IEEE International Conference on Properties and…
2012
Corpus ID: 15693132
In this paper, a series of Montmorillonite / Cross-linked polyethylene (MMT/XLPE) nano-composites were prepared though melting…
Expand
2011
2011
Subspaces and quotients of Banach spaces with shrinking unconditional bases
W. Johnson
,
Bentuo Zheng
2011
Corpus ID: 11124344
The main result is that a separable Banach space with the weak* unconditional tree property is isomorphic to a subspace as well…
Expand
2009
2009
A cofinality-preserving small forcing may introduce a special Aronszajn tree
A. Rinot
Archive for Mathematical Logic
2009
Corpus ID: 43382699
It is relatively consistent with the existence of two supercompact cardinals that a special Aronszajn tree of height $${\aleph_…
Expand
2005
2005
Finite Tree Property for First-Order Logic with Identity and Functions
Merrie Bergmann
Notre Dame J. Formal Log.
2005
Corpus ID: 36795356
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…
Expand
1995
1995
Clustering Without (Thinking About) Triangulation
Denise Draper
Conference on Uncertainty in Artificial…
1995
Corpus ID: 10287511
The undirected technique for evaluating belief networks [Jensen et al., 199Oa, Lauritzen and Spiegelhalter, 1988] requires…
Expand
1994
1994
Consistency of Suslin's hypothesis, a nonspecial Aronszajn tree, and GCH
Chaz Schlindwein
Journal of Symbolic Logic (JSL)
1994
Corpus ID: 44346729
Introduction. In [Sh, Chapter IX], Shelah constructs a model of set theory in which Suslin's hypothesis is true, yet there is an…
Expand
1983
1983
Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic
P. Clote
,
K. McAloon
Journal of Symbolic Logic (JSL)
1983
Corpus ID: 36914190
We give two new finite combinatorial statements which are independent of Peano arithmetic, using the methods of Kirby and Paris…
Expand
Review
1982
Review
1982
On Aronszajn trees
S. Shelah
1982
Corpus ID: 28588846
This survey describes the contribution of N. Aronszajn to set theory: the construction of an Aronszajn tree. We would like to…
Expand
1982
1982
The tree property is fundamental for query processing
N. Goodman
,
O. Shmueli
ACM SIGACT-SIGMOD-SIGART Symposium on Principles…
1982
Corpus ID: 13601836
One can partition the class of relational database schemas into tree schemas and cyclic schemas. In this paper we examine query…
Expand
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)
ACCEPT & CONTINUE
or Only Accept Required