Is there an algorithm which for a formula P of PA outputs (sum^0_m)/(prod^0_m) such that the output is the level P belongs to in Arithmetical hierarchy? If that's not computable is there an algorithm which outputs an upper bound on the level?

iescabroussexg

iescabroussexg

Answered question

2022-09-07

Is there an algorithm which for a formula P of PA outputs Σ m 0 / Π m 0 such that the output is the level P belongs to in Arithmetical hierarchy? If that's not computable is there an algorithm which outputs an upper bound on the level?

Answer & Explanation

Francis Blanchard

Francis Blanchard

Beginner2022-09-08Added 12 answers

Step 1
Getting an upper bound is pretty easy: just put the formula into prenex normal form and count the quantifier types and alternations. This is something a computer can do.
Of course, the answer this gives will sometimes be silly. For example,
x y z w u ( 0 = 1 )
"is" Π 5 0 , but we shouldn't think of it that way. So what's really being calculated is in some sense the "trivial" level of the arithmetical hierarchy that a formula lies in - what we get by simply performing basic logical operations and nothing else.
This is the best we can do, in a precise sense. Say that the optimal level of a formula φ , which I'll call " o l ( φ ) ," is the least n such that φ is equivalent to a Σ n 0 formula or to a Π n 0 formula. Then it's not hard to show that the map
φ o l ( φ )
is not computable - we can't computably tell whether a given Σ 2 0 sentence is equivalent to a Σ 1 0 sentence, for example.
(Here by "equivalent" I could mean either "provably equivalent over PA" or "equivalent in the structure N " - in either case, the point is the same.)

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?