Skip to main content

Notes on the Jump of a Structure

  • Conference paper

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

Abstract

We introduce the notions of a complete set of computably infinitary \(\Pi^0_n\) relations on a structure, of the jump of a structure, and of admitting n th jump inversion.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ash, C.J., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy. Elsevier Science, Amsterdam (2000)

    MATH  Google Scholar 

  2. Ash, C., Knight, J., Manasse, M., Slaman, T.: Generic copies of countable structures. Ann. Pure Appl. Logic 42(3), 195–205 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ash, C.J.: A construction for recursive linear orderings. J. Symbolic Logic 56(2), 673–683 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chisholm, J., Fokina, E., Goncharov, S., Knight, J., Miller, S.: Intrinsic bounds on complexity at limit levels. Journal of Symbolic Logic (to appear)

    Google Scholar 

  5. Chisholm, J.: Effective model theory vs. recursive model theory. J. Symbolic Logic 55(3), 1168–1191 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Downey, R., Jockusch, C.G.: Every low Boolean algebra is isomorphic to a recursive one. Proc. Amer. Math. Soc. 122(3), 871–880 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Downey, R., Knight, J.F.: Orderings with αth jump degree \({\bf 0}\sp {(\alpha)}\). Proc. Amer. Math. Soc. 114(2), 545–552 (1992)

    MathSciNet  MATH  Google Scholar 

  8. Goncharov, S., Harizanov, V., Knight, J., McCoy, C., Miller, R., Solomon, R.: Enumerations in computable structure theory. Ann. Pure Appl. Logic 136(3), 219–246 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Harris, K., Montalbán, A.: On the n-back-and-forth types of Boolean algebras (submitted for publication)

    Google Scholar 

  10. Kach, A., Montalbán, A.: Linear orders with finitely many descending cuts (in preparation)

    Google Scholar 

  11. Knight, J.F., Stob, M.: Computable Boolean algebras. J. Symbolic Logic 65(4), 1605–1623 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  12. Thurber, J.J.: Every \({\rm low}\sb 2\) Boolean algebra has a recursive copy. Proc. Amer. Math. Soc. 123(12), 3859–3866 (1995)

    MathSciNet  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

Montalbán, A. (2009). Notes on the Jump of a Structure. 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_38

Download citation

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

  • 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