Skip to main content
Log in

Generalized quantifier and a bounded arithmetic theory for LOGCFL

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

Abstract

We define a theory of two-sort bounded arithmetic whose provably total functions are exactly those in \({\mathcal{F}_{LOGCFL}}\) by way of a generalized quantifier that expresses computations of SAC 1 circuits. The proof depends on Kolokolova’s conditions for the connection between the provable capture in two-sort theories and descriptive complexity.

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. Bedard F., Lemieux F. and Mckenzie P. (1993). Extensions to Barrington’s M-program Model. Theor. Comput. Sci. 107(1): 31–61

    Article  MATH  MathSciNet  Google Scholar 

  2. Borodin A., Cook S.A., Dymond P.W., Ruzzo W.L. and Tompa M. (1989). Two applications of inductive counting for complementation problems. SIAM J. Comput. 18(3): 559–578

    Article  MATH  MathSciNet  Google Scholar 

  3. Buss, S.R.: Bounded Arithmetic. Bibliopolis (1986)

  4. Cook, S.A.: Theories for complexity classes and their propositional translations. In: Krajicek, J. (ed.) Complexity of Computations and Proofs, pp.175–227. Quaderni di Matematica (2003)

  5. Immerman, N.: Descriptive Complexity, Graduate Texts in Computer Science. Springer, Heidelberg (1998)

  6. Kolokolova, A.: Systems of bounded arithmetic from descriptive complexity. Ph.D. Thesis, University of Toronto (2005)

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

    Google Scholar 

  8. Lautemann C., McKenzie P., Schwentick T. and Vollmer H. (2001). The descriptive complexity approach to LOGCFL. J. Comput. Syst. Sci. 62(4): 629–652

    Article  MATH  MathSciNet  Google Scholar 

  9. Nguyen P. and Cook S. (2006). Theories for TC 0 and other small complexity classes. Log. Methods Comput. Sci. 2(1): 1–40

    Google Scholar 

  10. Venkateswaran H. (1991). Properties that characterizes LOGCFL. J. Comput. Syst. Sci. 42: 380–404

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Satoru Kuroda.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kuroda, S. Generalized quantifier and a bounded arithmetic theory for LOGCFL. Arch. Math. Logic 46, 489–516 (2007). https://doi.org/10.1007/s00153-007-0052-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-007-0052-4

Mathematics Subject Classification (2000)

Navigation