Skip to main content
Log in

RSUV isomorphisms for TACi, TNCi and TLS

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Summary

We investigate the second order bounded arithmetical systems which is isomorphic to TACi, TNCi or TLS.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Allen B.: Arithmetizing uniform NC. Ann. Pure Appl. Logic53, 1–50 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Buss S.: Bounded arithmetic. Napoli: Biblopolis 1986

    Google Scholar 

  3. Clote P., Takeuti G.: Bounded arithmetic for NC, ALOGTIME, L and NL. Ann. Pure Appl. Logic56, 73–117 (1992)

    Article  MathSciNet  Google Scholar 

  4. Colte P., Takeuti G.: First order bounded arithmetic and small boolean circuit complexity classes (to appear)

  5. Håstad J.: Computational limitations of small-depth circuits. Cambridge, Massachusetts: MIT Press 1987

    Google Scholar 

  6. Hájek P., Pudlák P.: Metamathematics of first-order arithmetic. Berlin Heidelberg New York: Springer 1991

    Google Scholar 

  7. Krajíček J., Takeuti G.: On boundedΣ 11 polynomial induction. In: Buss S., Scott P. (eds.) Feasible mathematics, pp. 259–280. Basel: Birkhäuser 1990

    Google Scholar 

  8. Takeuti G.: Proof theory, 2nd ed. Amsterdam: North-Holland

  9. Takeuti G.:S i3 and0V i(BD)2 . Arch. Math. Logic29, 149–169 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  10. Takeuti G.: RSUV Isomorphisms. In: Clote P., Krajíček J. (eds.) Arithmetic, proof theory and computational complexity, pp. 364–386. Oxford: Oxford Univ. Press 1993

    Google Scholar 

  11. Wilkie A.J., Paris J.B.: On the scheme of induction for bounded arithmetical formulas. Ann. Pure Appl. Logic35, 261–302 (1987)

    Article  MathSciNet  Google Scholar 

  12. Yao A.: Separating the polynomial-time hierachy by oracles. Proceedings 26th Annual IEEE Symposium on Foundations of Computer Science, pp. 1–10 (1985)

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Takeuti, G. RSUV isomorphisms for TACi, TNCi and TLS. Arch Math Logic 33, 427–453 (1995). https://doi.org/10.1007/BF02390458

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02390458

Keywords

Navigation