Skip to main content
SpringerLink
Log in

The equivalence of theories that characterize ALogTime

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

Abstract

A number of theories have been developed to characterize ALogTime (or uniform NC 1, or just NC 1), the class of languages accepted by alternating logtime Turing machines, in the same way that Buss’s theory \({{\bf S}^{1}_{2}}\) characterizes polytime functions. Among these, ALV′ (by Clote) is particularly interesting because it is developed based on Barrington’s theorem that the word problem for the permutation group S 5 is complete for ALogTime. On the other hand, ALV (by Clote), T 0 NC 0 (by Clote and Takeuti) as well as Arai’s theory \({{\bf AID}+\Sigma_0^B{-}{\bf CA}}\) and its two-sorted version VNC 1 (by Cook and Morioka) are based on the circuit characterization of ALogTime. While the last three theories have been known to be equivalent, their relationship to ALV′ has been an open problem. Here we show that ALV′ is indeed equivalent to the other theories.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Arai T.: Bounded arithmetic AID for Frege system. Ann. Pure Appl. Logic 103, 155–199 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Barrington D.A.: Bounded-width polynomial-size branching programs recognizes exactly those languages in NC 1. J. Comput. Syst. Sci. 38, 150–164 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. Barrington D.A.M., Immerman N., Straubing H.: On uniformity within NC 1. J. Comput. Syst. Sci. 41, 274–306 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Buss S.: Bounded Arithmetic. Bibliopolis, Naples (1986)

    MATH  Google Scholar 

  5. Buss, S.: The Boolean formula value problem is in Alogtime. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp 123–131 (1987)

  6. Clote, P.: Alogtime and a conjecture of S. A. Cook. In: Proceedings of IEEE Symposium on Logic in Computer Science (1990a)

  7. Clote, P.: Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k, NC k and NC. In: Buss, S.R., Scott, P.J. (eds.) Feasible Mathematics, pp. 49–70. Birkhauser (1990b)

  8. Clote, P.: On polynomial size Frege proofs of certain combinatorial principles. In: Peter, C., Krajíček, J. (eds.) Arithmetic, Proof Theory, and Computational Complexity, pp. 162–184. Oxford (1993)

  9. Clote P., Takeuti G.: Bounded arithmetic for NC, Alogtime, L and NL. Ann. Pure Appl. Logic 56, 73–117 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  10. Clote, P., Takeuti, G.: First order bounded arithmetic and small Boolean circuit complexity classes. In: Clote, P., Remmel, J.B. (eds.) Feasible Mathematics II. Birkhäuser (1995)

  11. Cook, S.: Relating the provable collapse of P to NC 1 and the power of logical theories. DIMACS Series in Discrete Math. and Theoretical Computer Science, 39 (1998)

  12. Cook, S.: Theories for complexity classes and their propositional translations. In: Krajíček, J. (ed.) Complexity of Computations and Proofs, pp. 175–227. Quaderni di Matematica (2005)

  13. Cook S., Morioka T.: Quantified propositional calculus and a second-order theory for NC 1. Arch. Math. Logic 44, 711–749 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  14. Cook, S., Nguyen P.: Foundations of proof complexity: Bounded Arithmetic and propositional translations. Book in progress (2006)

  15. Hájek, P., Pudlák, P. Metamathematics of First-Order Arithmetic. Springer–Verlag (1993)

  16. Immerman, N.: Descriptive Complexity. Springer (1999)

  17. Kolokolova, A.: Systems of bounded arithmetic from descriptive complexity. PhD thesis, University of Toronto (2004)

  18. Krajíček J.: Exponentiation and second-order bounded arithmetic. Ann. Pure Appl. Logic 48, 261–276 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  19. Krajíček, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press (1995)

  20. Nguyen, P.: VTC 0: A second-order theory for TC 0. Master’s thesis, University of Toronto (2004). http://www.cs.toronto.edu/~pnguyen/

  21. Nguyen, P.: Two–sorted theories for L, SL, NL and P based on graph accessibility problems. ECCC Report TR05-017, January (2005)

  22. Nguyen P., Cook S.: Theory for TC 0 and other small complexity classes. Logic. Methods Comput. Sci. 2, 1–39 (2005)

    MathSciNet  Google Scholar 

  23. Pitt, F.: A quantifier-free string theory Alogtime reasoning. PhD thesis, University of Toronto (2000)

  24. Razborov, A.A.: An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic. In: Clote, P., Krajíček, J. (eds.) Arithmetic, Proof Theory and Computational Complexity, pp. 247–277. Oxford (1993)

  25. Reingold, O.: Undirected ST-connectivity in log-space. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 376–385 (2005)

  26. Ruzzo W.: On uniform circuit complexity. J. Comput. Syst. Sci. 22, 365–383 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  27. Takeuti, G.: RSUV isomorphism. In: Clote, P., Krajíček, J. (eds.) Arithmetic, Proof Theory and Computational Complexity, pp. 364–386. Oxford (1993)

  28. Zambella D.: Notes on polynomially bounded arithmetic. J. Symb. Logic 61(3), 942–966 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Toronto, Toronto, Canada

    Phuong Nguyen

Authors
  1. Phuong Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Phuong Nguyen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nguyen, P. The equivalence of theories that characterize ALogTime. Arch. Math. Logic 48, 523–549 (2009). https://doi.org/10.1007/s00153-009-0136-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-009-0136-4

Keywords

Mathematics Subject Classification (2000)

Search

Navigation