Skip to main content
SpringerLink
Log in

What is a Computable Model?

  • Chapter
  • First Online:
Computable Models

  • 464 Accesses

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 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
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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. Andrews, P.B. An Introduction to Mathematical Logic and Type Theory. Academic Press, New York, 1986.

    MATH  Google Scholar 

  2. Barwise, J. Admissible Sets and Structures. Springer-Verlag, Berlin, 1975.

    MATH  Google Scholar 

  3. Beeson, M.J. Foundations of Constructive Mathematics, Springer-Verlag Berlin, 1985.

    MATH  Google Scholar 

  4. Blackburn, P., de Rijke,M., and Venema, Y. Modal Logic. Cambridge Univ. Press, Cambridge, 2001.

    MATH  Google Scholar 

  5. Bridge, J. Beginning Model Theory: The Completeness Theorem and Some Consequences. Clarendon Press, Oxford, 1977.

    MATH  Google Scholar 

  6. Cutland, N. Computability: An Introduction to Recursive Function Theory. Cambridge Univ. Press, Cambridge, 1990.

    Google Scholar 

  7. Dale, N., and Dale, H.M.W. Abstract Data Types: Specifications, Implementations, and Applications. Jones and Bartlett Publishers, Boston, 1996.

    Google Scholar 

  8. Feferman, S. Constructive theories of functions and classes. In: M. Boffa, D. van Dalen, and K. McAloon (Eds.), Logic Colloquium ’78, pp. 159–225, North-Holland, Amsterdam, 1979.

    Google Scholar 

  9. Gordon, J.C. The Denotational Semantics of Programming Languages. Springer-Verlag, New York, 1970

    Google Scholar 

  10. Havel, P. Metamathematics of First Order Arithmetic. Springer-Verlag, Berlin, 1991.

    Google Scholar 

  11. Hodges, W. Model theory. Cambridge University Press, Cambridge, 1993.

    MATH  Google Scholar 

  12. Jones, C.B.. Systematic Software Development Using VDM. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1986.

    MATH  Google Scholar 

  13. Krivine, J.L. Introduction to Axiomatic Set Theory. Springer-Verlag, New York, 1971.

    MATH  Google Scholar 

  14. Martin-Lof, P. An intuitionistic theory of sets, predicative part. In Logic Colloquim, 73. North-Holland, Amsterdam, 1975.

    Google Scholar 

  15. Mulmuley, K. Full Abstraction and Semantic Equivalence. MIT Press, Cambridge, MA, 1986.

    Google Scholar 

  16. Pierce, B.C. Types and Programming Languages. MIT Press, Cambridge, MA, 2002.

    Google Scholar 

  17. Pfenning, F. (Ed.). Types in Logic Programming. MIT Press, Cambridge, MA, 1992.

    Google Scholar 

  18. Rogers, H. Theory of Recursive Functions and Effective Computability. McGraw Hill, New York, 1967; 1988.

    Google Scholar 

  19. Stoy, J.E. Denotational Semantics: The Scott Strachey Approach to Programming Language Theory. MIT Press, Cambridge, MA, 1977.

    Google Scholar 

  20. Turner, R. A theory of properties. J. Symb. Log. 52(2): 455–472, 1987.

    Article  MATH  Google Scholar 

  21. Turner, R. Logics of truth. Notre Dame Journal of Formal Logic, 31(4): 308–329, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  22. Van Benthem, J. Tense logic and time. Notre Dame J. Formal Logic 25(1): 1–16, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  23. Woodcock, J. and Davies, J. Using Z- Specifications, Refinement and Proof, Prentice Hall, Englewood Cliffs, NJ, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Essex, , , UK

    Raymond Turner (Dr)

Authors
  1. Raymond Turner
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag London

About this chapter

Cite this chapter

Turner, R. (2009). What is a Computable Model?. In: Computable Models. Springer, London. https://doi.org/10.1007/978-1-84882-052-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-052-4_1

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-051-7

  • Online ISBN: 978-1-84882-052-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation