Skip to main content
SpringerLink
Log in

Computable Model Theory over the Reals

  • Chapter
  • First Online:
Computability and Complexity

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

  • 1002 Accesses

Abstract

This paper is a survey of results together with a list of open questions on \(\Sigma \)–definability of structures over \(\mathbb {HF}(\mathbb {R})\), the hereditarily finite superstructure over the ordered field of the real numbers.

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. Morozov, A.S., Korovina, M.V.: On \(\Sigma \)-definability of countable structures over real numbers, complex numbers, and quaternions. Algebra Logic 47(3), 193–209 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Barwise, J.: Admissible Sets and Structures. Springer, Heidelberg (1975)

    Book  MATH  Google Scholar 

  3. Ershov, Y.L.: Definability and Computability. Plenum Publ. Co., New York (1996)

    MATH  Google Scholar 

  4. Ershov, Y.L.: \(\Sigma \)-definability of algebraic structures. In: Studies in Logic and Foundations of Mathematics, vol. 1, pp. 235–260. Elsevier, Amsterdam (1998)

    Google Scholar 

  5. Korovina, M.V.: Generalized computability of functions on the reals. Vychislitel’nye Systemi (Computing Systems) 133, 38–68 (1990). In Russian

    MathSciNet  Google Scholar 

  6. Morozov, A.S.: On some presentations of the real number field. Algebra Logic 51(1), 66–88 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Morozov, A.S.: On \(\Sigma \)-rigid presentations of the real order. Siberian Math. J. 55(3), 562–572 (2014)

    Article  MathSciNet  Google Scholar 

  8. Morozov, A.S.: One-dimensional \(\Sigma \)-presentations of structures over \(\mathbb{HF}{\mathbb{R}}\). In: Geschke, P.S.S., Löwe, B. (eds.) Infinity, Computability, and Metamathematics, Festschrift celebrating the 60th birthdays of Peter Koepke and Philip Welch. Tributes Series, vol. 23, pp. 285–298. College Publications, London (2014)

    Google Scholar 

  9. Morozov, A.S.: \(\Sigma \)-presentations of the ordering on the reals. Algebra Logic 53(3), 217–237 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. Morozov, A.S.: A sufficient condition for nonpresentability of structures in hereditarily finite superstructures. Algebra Logic 55, 242–251 (2016)

    Article  Google Scholar 

  11. Morozov, A.S.: Nonpresentability of some structures of analysis in hereditarily finite superstructures. Algebra Logic (2017, to appear)

    Google Scholar 

  12. Korovina, M.V., Kudinov, O.V.: Positive predicate structures for continuous data. Math. Struct. Comput. Sci. 25(Special Issue 08), 1669–1684 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ershov, Y.L., Goncharov, S.S.: Constructive Models. Siberian School of Algebra and Logic. Kluwer Academic/Plenum, New York (2000)

    Book  MATH  Google Scholar 

  14. Tarski, A.: A Decision Method for Elementary Algebra and Geometry. The Rand Corporation, Santa Monica (1957)

    MATH  Google Scholar 

  15. Weihrauch, K.: Computable Analysis. An Introduction, p. 285. Springer, Heidelberg (2000)

    Book  MATH  Google Scholar 

  16. Ershov, Y.L., Puzarenko, V.G., Stukachev, A.I.: \(\mathbb{HF}\)-Computability. In: Cooper, S.B., Andrea, S. (eds.) Computability in Context. Computation and Logic in the Real World, pp. 169–242. Imperial College Press, London (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics SB RAS, Koptyug Avenue 4, Novosibirsk, Russia

    Andrey S. Morozov

  2. The Novosibirsk State University, Pirogova Street 2, Novosibirsk, 630090, Russia

    Andrey S. Morozov

Authors
  1. Andrey S. Morozov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrey S. Morozov .

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

Morozov, A.S. (2017). Computable Model Theory over the Reals. 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_22

Download citation

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

  • 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