Skip to main content
4 of 5
added 191 characters in body
Erfan Khaniki
  • 1.7k
  • 1
  • 11
  • 17

Collapsing the Linear Time Hierarchy and finite axiomatizability of bounded arithmetic

It is well known that if ${\bf T_2}$ (or $I\Delta_0+\Omega_1$) is finitely axiomatizable, then the Polynomial Hierarchy collapses.

Q. Is there any similar relation between $I\Delta_0$ and Linear Time Hierarchy?

Edit: related questions

Q'. Why standard proof (like corollary 4.39 in chapter V of Metamathematics of first-order arithmetic) of

Finite axiomatizability of ${\bf T_2}$ $\Rightarrow$ PH collapse.

does not work for proving

Finite axiomatizability of ${\bf {\bf I}\Delta_0}$ $\Rightarrow$ LiH collapse ?

Relativized Case

Q''. Is there any oracle $\alpha$ with following properties?

I. $\mathbb{N} \models$ "LiH($\alpha$) does not colapse",

II. ${\bf I}\Delta_0(\alpha)$ is finitly axiomatizable.

Thanks in advance.

Erfan Khaniki
  • 1.7k
  • 1
  • 11
  • 17