Skip to main content
SpringerLink
Log in

A Rigid Cone in the Truth-Table Degrees with Jump

  • Chapter
  • First Online:
Book cover Computability and Complexity

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

Abstract

The automorphism group of the truth-table degrees with order and jump is fixed on the set of degrees above the fourth jump, \(\mathbf 0^{(4)}\).

B. Kjos-Hanssen—Thanks are due to Noam Greenberg for a correction to an early draft of this article. This work was partially supported by a grant from the Simons Foundation (#315188 to Bjørn Kjos-Hanssen). This material is based upon work supported by the National Science Foundation under Grant No. 1545707.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Anderson, B.A.: Automorphisms of the truth-table degrees are fixed on a cone. J. Symb. Log. 74(2), 679–688 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.S.: Continuous Lattices and Domains. Encyclopedia of Mathematics and its Applications, vol. 93. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  3. Grätzer, G.: General Lattice Theory. Birkhäuser, Basel (2003). With appendices by Davey, B.A., Freese, R., Ganter, B., Greferath, M., Jipsen, P., Priestley, H.A., Rose, H., Schmidt, E.T., Schmidt, S.E., Wehrung, F., Wille, R., Reprint of the 1998 2nd edn. [MR1670580]

    MATH  Google Scholar 

  4. Grätzer, G.: Universal Algebra, 2nd edn. Springer, New York (2008). With appendices by Grätzer, Jónsson, B., Taylor, W., Quackenbush, R.W., Wenzel, G.H., Grätzer, Lampe, W.A

    Book  MATH  Google Scholar 

  5. Jockusch Jr., C.G., Solovay, R.M.: Fixed points of jump preserving automorphisms of degrees. Israel J. Math. 26(1), 91–94 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kjos-Hanssen, B.: Lattice initial segments of the Turing degrees. ProQuest LLC, Ann Arbor, MI, 2002. Thesis (Ph.D.)-University of California, Berkeley (2002)

    Google Scholar 

  7. Kjos-Hanssen, B.: Local initial segments of the Turing degrees. Bull. Symb. Log. 9(1), 26–36 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lachlan, A.H., Lebeuf, R.: Countable initial segments of the degrees of unsolvability. J. Symb. Log. 41(2), 289–300 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lerman, M.: Degrees of Unsolvability: Local and Global Theory. Perspectives in Mathematical Logic. Springer, Berlin (1983)

    Book  MATH  Google Scholar 

  10. Mal’cev, A.I.: On the general theory of algebraic systems. Mat. Sb. N.S. 35(77), 3–20 (1954)

    MathSciNet  Google Scholar 

  11. Mal’cev, A.I.: On the general theory of algebraic systems. Am. Math. Soc. Transl. 2(27), 125–142 (1963)

    MathSciNet  Google Scholar 

  12. Mohrherr, J.: Density of a final segment of the truth-table degrees. Pac. J. Math. 115(2), 409–419 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  13. Nies, A., Shore, R.A., Slaman, T.A.: Definability in the recursively enumerable degrees. Bull. Symb. Log. 2(4), 392–404 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  14. Nies, A., Shore, R.A., Slaman, T.A.: Interpretability and definability in the recursively enumerable degrees. Proc. Lond. Math. Soc. 77(2), 241–291 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  15. Pudlák, P.: A new proof of the congruence lattice representation theorem. Algebra Univers. 6(3), 269–275 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  16. Shore, R.A.: The theory of the degrees below \({ 0}^{\prime } \). J. Lond. Math. Soc. 24(1), 1–14 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  17. Shore, R.A.: On homogeneity and definability in the first-order theory of the Turing degrees. J. Symb. Log. 47(1), 8–16 (1982)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Hawai‘i at Mānoa, Honolulu, USA

    Bjørn Kjos-Hanssen

Authors
  1. Bjørn Kjos-Hanssen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bjørn Kjos-Hanssen .

Editor information

Editors and Affiliations

  1. Victoria University of Wellington, Wellington, New Zealand

    Adam Day

  2. University of Bergen, Bergen, Norway

    Michael Fellows

  3. Victoria University of Wellington, Wellington, New Zealand

    Noam Greenberg

  4. University of Auckland, Auckland, New Zealand

    Bakhadyr Khoussainov

  5. Massey University, Auckland, New Zealand

    Alexander Melnikov

  6. University of Bergen, Bergen, Norway

    Frances Rosamond

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Kjos-Hanssen, B. (2017). A Rigid Cone in the Truth-Table Degrees with Jump. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds) Computability and Complexity. Lecture Notes in Computer Science(), vol 10010. Springer, Cham. https://doi.org/10.1007/978-3-319-50062-1_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50062-1_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50061-4

  • Online ISBN: 978-3-319-50062-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation