Skip to main content
Springer Nature Link
Log in

Strength and Weakness in Computable Structure Theory

  • Chapter
  • First Online:
Computability and Complexity

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

Abstract

We survey the current results about degrees of categoricity and the degrees that are low for isomorphism as well as the proof techniques used in the constructions of elements of each of these classes. We conclude with an analysis of these classes, what we may deduce about them given the sorts of proof techniques used in each case, and a discussion of future lines of inquiry.

The author would like to thank the editors of this Festschrift for the invitation to contribute.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook
USD 12.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    We note with some amusement that the isomorphism condition is actually lower in the arithmetic hierarchy than the others and is therefore not the condition that determines the degree of genericity necessary to force lowness for isomorphism.

References

  1. Anderson, B.A., Csima, B.F.: Degrees that are not degrees of categoricity. Notre Dame J. Formal Logic (to appear)

    Google Scholar 

  2. Ash, C.J., Knight, J.: Computable structures and the hyperarithmetical hierarchy. In: Studies in Logic and the Foundations of Mathematics, vol. 144. North-Holland (2000)

    Google Scholar 

  3. Csima, B.: Degrees of categoricity and related notions. In: BIRS Computable Model Theory Workshop, November 2013

    Google Scholar 

  4. Csima, F.B., Franklin, J.N.Y., Shore, R.A.: Degrees of categoricity and the hyperarithmetic hierarchy. Notre Dame J. Formal Logic 54(2), 215–231 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  5. Csima, B.F., Harrison-Trainor, M.: Degrees of categoricity on a cone. J. Symbolic Logic (to appear)

    Google Scholar 

  6. Downey, R., Griffiths, E., LaForte, G.: On Schnorr and computable randomness, martingales, and machines. Math. Log. Q. 50(6), 613–627 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, New York (2010)

    Book  MATH  Google Scholar 

  8. Ershov, Y.: A hierarchy of sets, I. Algebra Logic 7(1), 212–232 (1968). Originally appearing in Algebra i Logika 7(1), 47–74 (1968) (Russian)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ershov, Y.: On a hierarchy of sets, II. Algebra Logic 7(4), 25–43 (1968). Originally appearing in Algebra i Logika 7(4), 15–47 (1968) (Russian)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ershov, Y.: On a hierarchy of sets, III. Algebra Logic 9(1), 20–31 (1970). Originally appearing in Algebra i Logika 9(1), 34–51 (1970) (Russian)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fokina, E.B., Kalimullin, I., Miller, R.: Degrees of categoricity of computable structures. Arch. Math. Logic 49(1), 51–67 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. Franklin, J.N.Y.: Schnorr trivial reals: a construction. Arch. Math. Logic 46(7–8), 665–678 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Franklin, J.N.Y.: Lowness and highness properties for randomness notions. In: Arai, T. et al. (ed.) Proceedings of the 10th Asian Logic Conference, pp. 124–151. World Scientific (2010)

    Google Scholar 

  14. Franklin, J.N.Y., Solomon, R.: Degrees that are low for isomorphism. Computability 3(2), 73–89 (2014)

    MathSciNet  MATH  Google Scholar 

  15. Franklin, J.N.Y., Stephan, F.: Schnorr trivial sets and truth-table reducibility. J. Symbol. Logic 75(2), 501–521 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  16. Franklin, J.N.Y., Turetsky, D.: Genericity and lowness for isomorphism (submitted)

    Google Scholar 

  17. Fröhlich, A., Shepherdson, J.C.: Effective procedures in field theory. Philos. Trans. R. Soc. Lond. Ser. A. 248, 407–432 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  18. Harizanov, V.S.,: Pure computable model theory. In: Handbook of Recursive Mathematics, Volume 1: Recursive Model Theory, Studies in Logic and the Foundations of Mathematics, vol. 138, pp. 3–114 (1998)

    Google Scholar 

  19. Hirschfeldt, D., Khoussainov, B., Shore, R., Slinko, A.: Degree spectra and computable dimensions in algebraic structures. Ann. Pure Appl. Logic 115(1–3), 71–113 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  20. Hirschfeldt, D.R., Shore, R.A.: Combinatorial principles weaker than Ramsey’s theorem for pairs. J. Symbol. Logic 72(1), 171–206 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  21. Hirschfeldt, D.R., Shore, R.A., Slaman, T.A.: The atomic model theorem and type omitting. Trans. Am. Math. Soc. 361(11), 5805–5837 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  22. Hirschfeldt, D.R., White, W.M.: Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures. Notre Dame J. Formal Logic 43(1), 51–64 (2003). 2002

    MathSciNet  MATH  Google Scholar 

  23. Knight, J.F.: Degrees coded in jumps of orderings. J. Symbol. Logic 51(4), 1034–1042 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  24. Marker, D.: Non \(\Sigma _n\) axiomatizable almost strongly minimal theories. J. Symbol. Logic 54(3), 921–927 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  25. Montalbán, A.: Priority arguments via true stages. J. Symbol. Log. 79(4), 1315–1335 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  26. Moschovakis, Y.N.: Descriptive Set Theory. Studies in Logic and the Foundations of Mathematics, vol. 100. North-Holland (1980)

    Google Scholar 

  27. Nies, A.: Computability and Randomness. Clarendon Press, Oxford (2009)

    Book  MATH  Google Scholar 

  28. Nies, A., Stephan, F., Terwijn, S.A.: Randomness, relativization and Turing degrees. J. Symbol. Logic 70(2), 515–535 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  29. Odifreddi, P.: Classical Recursion Theory. Studies in Logic and the Foundations of Mathematics, vol. 125. North-Holland (1989)

    Google Scholar 

  30. Odifreddi, P.: Classical Recursion Theory, Volume II. Studies in Logic and the Foundations of Mathematics, vol. 143. North-Holland (1999)

    Google Scholar 

  31. Sacks, G.E.: Higher Recursion Theory. Springer, New York (1990)

    Book  MATH  Google Scholar 

  32. Slaman, T.A., Solovay, R.M.: When oracles do not help. In: Fourth Annual Workshop on Computational Learning Theory, pp. 379–383. Morgan Kaufman, Los Altos (1991)

    Google Scholar 

  33. Soare, R.: The Friedberg-Muchnik theorem re-examined. Can. J. Math. 24, 1070–1078 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  34. Soare, R.I.: Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic. Springer, New York (1987)

    Book  MATH  Google Scholar 

  35. Suggs, J.: Degrees that are low for \(\cal{C}\) isomorphism. Ph.D. thesis, University of Connecticut (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Hofstra University, Room 306, Roosevelt Hall, Hempstead, New York, 11549-0114, USA

    Johanna N. Y. Franklin

Authors
  1. Johanna N. Y. Franklin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Johanna N. Y. Franklin .

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

Franklin, J.N.Y. (2017). Strength and Weakness in Computable Structure Theory. 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_20

Download citation

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

  • 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