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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

In this paper, we focus on the design of low complexity hybrid analog/digital precoding and diversity combining in the millimeter…

2015

2011

We study the topological charge and the topological susceptibility in lattice QCD with two degenerate flavors of naive Wilson…

2009

If $\mathcal{L}$ is a finite relational language then all computable $\mathcal{L}$-structures can be effectively enumerated in a…

2006

We conducted a systematic investigation of the effects of substituting high-yield pulp (HYP) for hardwood bleached kraft pulp…

2003

We investigate the computational complexity the class of Γ‐categorical computable structures. We show that hyperarithmetic…

2002

We study the locality and topological properties of fat link clover overlap (FCO) actions. We find that a small amount of…

1997

A method for computing inviscid hypersonic flow over complex configurations using unstructured meshes is presented. The…

1994

SummaryWe prove a converse to one of the theorems from [F], giving a description in terms of Turing complexity of sets which can…

1989