Skip to main content

A Note on the Sequential Version of \({\rm \Pi^1_2}\) Statements

  • Conference paper
The Nature of Computation. Logic, Algorithms, Applications (CiE 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7921))

Included in the following conference series:

Abstract

In connection with uniform computability and intuitionistic provability, the strength of the sequential version of \({\rm \Pi^1_2}\) theorems has been investigated in reverse mathematics. In some examples, we illustrate that it occasionally depends on the way of formalizing the \({\rm \Pi^1_2}\) statement, so the investigation of sequential strength demands careful attention to the formalization. Moreover our results suggest the optimality of Dorais’s uniformization theorems.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dorais, F.G.: Classical consequences of continuous choice principles from intuitionistic analysis. Notre Dame Journal to Formal Logic (to appear)

    Google Scholar 

  2. Dorais, F.G., Dzhafarov, D.D., Hirst, J.L., Mileti, J.R., Shafer, P.: On uniform relationships between combinatorial problems (to appear)

    Google Scholar 

  3. Dorais, F.G., Hirst, J.L., Shafer, P.: Reverse mathematics, trichotomy, and dichotomy. Journal of Logic and Analysis 4(13), 1–14 (2012)

    Article  MathSciNet  Google Scholar 

  4. Hirst, J.R.: Combinatorics in Subsystems of Second Order Arithmetic. Ph.D. thesis, Pennsylvania State University (1987)

    Google Scholar 

  5. Hirst, J.R.: Marriage theorems and reverse mathematics. Contemporary Mathematics 106, 181–196 (1990)

    Article  MathSciNet  Google Scholar 

  6. Hirst, J.R.: Representations of reals in reverse mathematics. Bull. Pol. Acad. Sci. Math. 55(4), 303–316 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hirst, J.R., Mummert, C.: Reverse mathematics and uniformity in proofs without excluded middle. Notre Dome Journal to Formal Logic 52(2), 149–162 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Sanders, S., Yokoyama, K.: The Dirac delta function in two settings of Reverse Mathematics. Archive for Mathematical Logic 51, 99–121 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. Simpson, S.G.: Association for Symbolic Logic. In: Subsystems of Second Order Arithmetic, 2nd edn. Cambridge University Press (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fujiwara, M., Yokoyama, K. (2013). A Note on the Sequential Version of \({\rm \Pi^1_2}\) Statements. In: Bonizzoni, P., Brattka, V., Löwe, B. (eds) The Nature of Computation. Logic, Algorithms, Applications. CiE 2013. Lecture Notes in Computer Science, vol 7921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39053-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39053-1_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39052-4

  • Online ISBN: 978-3-642-39053-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics