Skip to search formSkip to main contentSkip to account menu

Hardy hierarchy

In computability theory, computational complexity theory and proof theory, the Hardy hierarchy, named after G. H. Hardy, is an ordinal-indexed family… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
‘Sensemaking’ is an extraordinarily influential perspective with a substantial following among management and organization… 
Highly Cited
2012
Highly Cited
2012
Interest in the analysis of organizational discourse has expanded rapidly over the last two decades. In this article, we reflect… 
Highly Cited
2010
Highly Cited
2010
Let L be a second order divergence form elliptic operator with complex bounded measurable coefficients. The operators arising in… 
2009
2009
The aim of this study was to examine whether there was variation in levels of psychological adjustment among children conceived… 
Review
2002
Review
2002
In a recent survey on interest theory, Professor Sennholz (1996, p. 127) reminded his readers that, as “was the case a century… 
Highly Cited
2002
Highly Cited
2002
We prove a version of Hardy's type inequality in a domain Omega subset of R-n which involves the distance to the boundary and the… 
Highly Cited
2000
Highly Cited
2000
We use variational methods to study the existence and multiplicity of solutions for the following quasi-linear partial… 
Highly Cited
1995
Highly Cited
1995
The norm of the operator which averages If I in LP (Rn) over balls of radius (51xl centered at either 0 or x is obtained as a… 
1987
1987
In [12], [13] Coifman, Meyer and Stein have developed a theory of "tent spaces" with interesting applications. Their theory has…