Skip to main content
1 of 5
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?

Thanks in advance.

Erfan Khaniki
  • 1.7k
  • 1
  • 11
  • 17