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

Hyperarithmetical theory

Known as: Hyperarithmetical, Hyperarithmetical set, Hyperarithmetic hierarchy 
In recursion theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second-order… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Planning under uncertainty is critical for robust robot performance in uncertain, dynamic environments, but it incurs high… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
2011
2011
Maximum yield from any cellulosic bioenergy crop is largely dependent upon total dry weight at harvest and process-specific… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Highly Cited
2010
Highly Cited
2010
We present results for kaon mixing parameter BK calculated using HYP-smeared improved staggered fermions on the MILC asqtad… Expand
  • table I
  • table II
  • figure 1
  • table IV
  • table V
Highly Cited
2010
Highly Cited
2010
Abstract The present study investigated effects of two hypermedia environments on 95 preservice university teachers' self… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
2009
2009
If $\mathcal{L}$ is a finite relational language then all computable $\mathcal{L}$-structures can be effectively enumerated in a… Expand
2008
2008
This document reports on work undertaken at DSTO towards modelling the mean ocean backscatter coefficient at low to medium… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Highly Cited
2003
Highly Cited
2003
[1] Inverse weighted distance and regression nonexact techniques were evaluated for interpolating methods snow water equivalent… Expand
Highly Cited
2000
Highly Cited
2000
Preface. Computability. The arithmetical hierarchy. Languages and structures. Ordinals. The hyperarithmetical hierarchy… Expand
Highly Cited
1987
Highly Cited
1987
  • C. Ash
  • Ann. Pure Appl. Log.
  • 1987
  • Corpus ID: 28693908
Abstract We obtain, under certain assumptions, necessary and sufficient conditions for a recursive structure to be Δ 0… Expand
Highly Cited
1984
Highly Cited
1984
In this paper we introduce a new hierarchy of sets and operators which we call the REA hierarchy for “recursively enumerable in… Expand