Skip to main content
SpringerLink
Log in

Nested PLS

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

Abstract

In this note we will introduce a class of search problems, called nested Polynomial Local Search (nPLS) problems, and show that definable NP search problems, i.e., \({\Sigma^{b}_{1}}\)-definable functions in \({T^{2}_{2}}\) are characterized in terms of the nested PLS.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arai, T.: Intuitionistic fixed point theories over Heyting arithmetic. In: Feferman, S., Sieg, W. (eds.) Proofs, Categories and Computations. Essays in honor of Grigori Mints. College Publications, King’s College London (to appear)

  2. Beckmann A., Buss S.R.: Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic. J. Math. Logic 9, 103–138 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  3. Beckmann, A., Buss, S.R.: Characterising definable search problems in bounded arithmetic via proof notations (submitted)

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

    MATH  Google Scholar 

  5. Buss, S.R.: Bounded arithmetic and constant depth Frege proofs. In: Krajíček, J. (ed.) Complexity of Computations and Proofs (Quaderni di matematica, vol. 13), pp. 153–174 (2004)

  6. Buss S.R., Krajíček J.: An application of Boolean complexity to separation problems in bounded arithmetic. Proc. Lond. Math. Soc. 69, 1–21 (1994)

    Article  MATH  Google Scholar 

  7. Johnson D.S., Papadimitriou C.H., Yannakakis M.: How easy is local search?. J. Comput. Syst. Sci. 37, 79–100 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  8. Krajíček J., Skelly A., Thapen N.: NP search problems in low fragments of bounded arithmetic. J. Symb. Logic 72, 649–672 (2007)

    Article  MATH  Google Scholar 

  9. Megiddo N., Papadimitriou C.H.: A note on total functions, existence theorems, and computational complexity. Theor. Comp. Sci. 81, 317–324 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  10. Papadimitriou C.H.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comp. Syst. Sci. 48, 498–532 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  11. Skelly, A., Thapen, N.: The provable total search problems of bounded arithmetic, Typeset manuscript (2007)

Download references

Author information

Authors and Affiliations

  1. Graduate School of Science, Chiba University, 1-33, Yayoi-cho, Inage-ku, Chiba, 263-8522, Japan

    Toshiyasu Arai

Authors
  1. Toshiyasu Arai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Toshiyasu Arai.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Arai, T. Nested PLS. Arch. Math. Logic 50, 395–409 (2011). https://doi.org/10.1007/s00153-010-0221-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-010-0221-8

Keywords

Mathematics Subject Classification (2000)

Search

Navigation