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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1962-2016
051019622016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We study arithmetic and hyperarithmetic degrees of categoricity. We extend a result of Fokina, Kalimullin, and R. Miller to show… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
We define a family of properties on hyperhypersimple sets and show that they yield index sets at each level of the… (More)
Is this relevant?
2006
2006
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if for all Y ∈ Q… (More)
Is this relevant?
2005
2005
A statement of hyperarithmetic analysis is a sentence of second order arithmetic S such that for every Y ⊆ ω, the minimum ω-model… (More)
Is this relevant?
1996
1996
The main result proved in the paper is that on every recursive structure the intrinsically hyperarithmetical sets coincide with… (More)
Is this relevant?
1994
1987
1987
We say that a recursive structure 92 is A°-categorical, for cr < ~o cK, if for every recursive structure ~ ~ 92 there exists an… (More)
Is this relevant?
1971
1971
Introduction It has been remarked by Addison ([1]) and Hinman ([6]) that applications of forcing techniques (Cohen ([2… (More)
Is this relevant?