Arithmetical hierarchy and complexity of computation

This publication has 5 references indexed in Scilit:

• Independence results in computer science
  ACM SIGACT News, 1976
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
  SIAM Journal on Computing, 1975
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• Arithmetization of metamathematics in a general setting
  Fundamenta Mathematicae, 1960
• Examples of sets definable by means of two and three quantifiers
  Fundamenta Mathematicae, 1955