Skip to main content

\(\Sigma^0_1\) and \(\Pi^0_1\) Equivalence Structures

  • Conference paper
Mathematical Theory and Computational Practice (CiE 2009)

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

Included in the following conference series:

Abstract

We study computability theoretic properties of \(\Sigma _{1}^{0}\) and \(\Pi _{1}^{0}\) equivalence structures and how they differ from computable equivalence structures or equivalence structures that belong to the Ershov difference hierarchy. Our investigation includes the complexity of isomorphisms between \(\Sigma _{1}^{0}\) equivalence structures and between \(\Pi _{1}^{0}\) equivalence structures.

This research was partially supported by NSF grants DMS-0532644 and DMS-0554841. Cenzer was partially supported by DMS 652372, Harizanov was partially supported by DMS-0704256 and Jeffrey Remmel was partially supported by NSF grant DMS 0654060.

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. Calvert, W., Cenzer, D., Harizanov, V., Morozov, A.: Effective categoricity of equivalence structures. Annals of Pure and Applied Logic 141, 61–78 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cenzer, D., LaForte, G., Remmel, J.B.: Equivalence structures and isomorphisms in the difference hierarchy. Journal of Symbolic Logic 74, 535–556 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Khisamiev, N.G.: Constructive Abelian groups. In: Ershov, Y.L., Goncharov, S.S., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics, vol. 2, pp. 1177–1231. North-Holland, Amsterdam (1998)

    Google Scholar 

  4. Khoussainov, B., Stephan, F., Yang, Y.: Computable categoricity and the Ershov hierarchy. Annals of Pure and Applied Logic 156, 86–95 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Metakides, G., Nerode, A.: Recursively enumerable vector spaces. Annals of Mathematical Logic 11, 141–171 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  6. Remmel, J.B.: Combinatorial functors on co-r.e. structures. Annals of Mathematical Logic 11, 261–287 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  7. Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cenzer, D., Harizanov, V., Remmel, J.B. (2009). \(\Sigma^0_1\) and \(\Pi^0_1\) Equivalence Structures. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds) Mathematical Theory and Computational Practice. CiE 2009. Lecture Notes in Computer Science, vol 5635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03073-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03073-4_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03072-7

  • Online ISBN: 978-3-642-03073-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics