Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Hardy hierarchy

In computability theory, computational complexity theory and proof theory, the Hardy hierarchy, named after G. H. Hardy, is an ordinal-indexed family… Expand
Wikipedia

Related topics

Related topics

4 relations

Broader (1)

Computability theory
Computational complexity theoryFast-growing hierarchySlow-growing hierarchy

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
Making Sense of Sensemaking in Organization Studies
‘Sensemaking’ is an extraordinarily influential perspective with a substantial following among management and organization… Expand
Highly Cited
2012
Highly Cited
2012
Organizational Discourse: Domains, Debates, and Directions
Interest in the analysis of organizational discourse has expanded rapidly over the last two decades. In this article, we reflect… Expand
  • table 1
  • table 2
2009
2009
Examining differences in psychological adjustment problems among children conceived by assisted reproductive technologies
The aim of this study was to examine whether there was variation in levels of psychological adjustment among children conceived… Expand
  • table 1
  • table 2
  • table 3
Highly Cited
2008
Highly Cited
2008
Relationships between mindfulness, flow dispositions and mental skills adoption: A cluster analytic approach.
Abstract Objectives This study examines the relationships between mindfulness, flow dispositions and mental skills adoption… Expand
  • table 1
  • table 2
  • figure 1
  • table 3
  • figure 2
Highly Cited
2007
Highly Cited
2007
A meta-analytic examination of client-therapist perspectives of the working alliance.
Abstract Using 53 studies, comprising 52 separate data sets, published in refereed journals from 1985 through 2006, the authors… Expand
  • table I
  • table II
Review
2002
Review
2002
A theory of interest
In a recent survey on interest theory, Professor Sennholz (1996, p. 127) reminded his readers that, as “was the case a century… Expand
Highly Cited
2002
Highly Cited
2002
A Geometrical Version of Hardy's Inequality
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… Expand
Highly Cited
2000
Highly Cited
2000
Multiple solutions for quasi-linear PDEs involving the critical Sobolev and Hardy exponents
We use variational methods to study the existence and multiplicity of solutions for the following quasi-linear partial… Expand
  • table 1
  • table 2
Highly Cited
1995
Highly Cited
1995
Best constants for two nonconvolution inequalities
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… Expand
Highly Cited
1994
Highly Cited
1994
Generalized Hermite interpolation via matrix-valued conditionally positive definite functions
In this paper, we consider a broad class of interpolation problems, for both scalarand vector-valued multivariate functions… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE