Skip to search formSkip to main contentSkip to account menu

Arithmetical hierarchy

Known as: Pi-0-1 sentences, Arithmetical reducibility, AH (complexity) 
In mathematical logic, the arithmetical hierarchy, arithmetic hierarchy or Kleene–Mostowski hierarchy classifies certain sets based on the complexity… 
Wikipedia (opens in a new tab)

Related topics

Related topics

40 relations
Algorithmically random sequenceAnalytical hierarchyArithmetical setBounded quantifier

Broader (2)

Computability theoryEffective descriptive set theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semi definite… 
Highly Cited
2006
Highly Cited
2006
MPTP 0.2: Design, Implementation, and Initial Experiments
  • J. Urban
  • Journal of automated reasoning
  • 2006
  • Corpus ID: 21315287
This paper describes the second version of the Mizar Problems for Theorem Proving (MPTP) system and first experimental results… 
Highly Cited
2003
Highly Cited
2003
The development of arithmetic concepts and skills: Constructing adaptive expertise
Contents: G. Hatano, Foreword. A.J. Baroody, A. Dowker, Preface. A.J. Baroody, The Development of Adaptive Expertise and… 
Highly Cited
1999
Highly Cited
1999
Subsystems of second order arithmetic
  • S. G. Simpson
  • Perspectives in Mathematical Logic
  • 1999
  • Corpus ID: 116890781
List of tables Preface Acknowledgements 1. Introduction Part I. Development of Mathematics within Subsystems of Z2: 2. Recursive… 
Highly Cited
1999
Highly Cited
1999
Hierarchical Reinforcement Learning with the MAXQ Value Function Decomposition
This paper presents a new approach to hierarchical reinforcement learning based on decomposing the target Markov decision process… 
Highly Cited
1999
Highly Cited
1999
The Arithmetical Hierarchy of Real Numbers
A real number is computable if it is the limit of an effectively converging computable sequence of rational numbers, and left… 
Highly Cited
1993
Highly Cited
1993
Solving a linear equation in a set of integers I
(1.1) a1x1 + . . .+ akxk = b with x1, . . . , xk in a prescribed set of integers. We saw that the vanishing of the constant term… 
Highly Cited
1993
Highly Cited
1993
Logical Specifications of Infinite Computations
Starting from an identification of infinite computations with ω-words, we present a framework in which different classification… 
Review
1984
Review
1984
Residue Arithmetic A Tutorial with Examples
The ancient study of the residue numbering system, or RNS, begins with a verse from a third-century book, Suan-ching, by Sun Tzu… 
Highly Cited
1976
Highly Cited
1976
The Polynomial-Time Hierarchy
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)