Skip to search formSkip to main contentSkip to account menu

Kurepa tree

Known as: Kurepa hypothesis, Kurepa conjecture, Kurepa family 
In set theory, a Kurepa tree is a tree (T, <) of height ω1, each of whose levels is at most countable, and has at least ℵ2 many branches. This… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Given a prime number $p$, we deduce from a formula of Barsky and Benzaghou and from a result of Coulter and Henderson on… 
2008
2008
Closing a Kurepa family under finite intersection yields a Kurepa family of the same cardinality, so we may assume N = {N… 
2005
2005
Refinements of Buzano’s and Kurepa’s inequalities in inner product spaces and applications for discrete and integral inequalities… 
2002
2002
In this paper we define the function vMm(s; a, z), and we study the special cases 1Mm(s; a, z) and nM−1(1; 1, n + 1). We prove… 
1996
Review
1995
Review
1995
We discuss some problems in number theory posed by-Duro Kurepa, including the so-called left factorial hypothesis that an odd… 
1993
1993
By an !1{tree we mean a tree of power !1 and height !1. An !1{tree is called a Kurepa tree if all its levels are countable and it… 
1993
1993
SummaryBy an ω1 we mean a tree of power ω1 and height ω1. An ω1-tree is called a Kurepa tree if all its levels are countable and… 
1991
1991
We determine all additive F, G: ℍ → ℝ and multiplicative M: H → ℝ satisfying the functional equation F(λ) + M(λ)G(λ−1) = 0. As an…