Skip to main content
SpringerLink
Log in

Information systems, continuity and realizability

  • Conference paper
  • First Online:
Logics of Programs (Logic of Programs 1983)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 164))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Section 11: References

  1. Beeson, M. Continuity in intutionistic set theories. Logic Colloquium '78 (1979)

    Google Scholar 

  2. Bishop, E. Foundations of Constructive Analysis. McGraw-Hill (1967)

    Google Scholar 

  3. Friedman, H. Some applications of Kleene's methods for intuitionistic systems. Cambridge Summer School in Mathematical Logic (1973). pp.113–170

    Google Scholar 

  4. Heyting, A. Mathematische Grundlagenforschung. Intuitionismus. Beweistheorie. Springer, Berlin (1934) iv+74 pp.

    Google Scholar 

  5. Kleene, S. C. On the interpretation of intuitionistic number theory. Journal of Symbolic Logic Volume 10 (1945) pp. 109–124

    Google Scholar 

  6. McCarty. D. C. D. Phil Thesis. Oxford University (1983)

    Google Scholar 

  7. Plotkin, G. D. Lectures on the theory of domains. manuscript.

    Google Scholar 

  8. Scott, D. S. Domains for denotational semantics. Proceedings of the ICALP '82 Lecture Notes in Computer Science 140 (1982)

    Google Scholar 

  9. Scott, D. S. Data types as lattices. SIAM Journal of Computing Volume 5 (1976) pp. 522–587

    Google Scholar 

  10. Scott, D.S. Lectures on a Mathematical Theory of Computation. Oxford University Computing Laboratory, Programming Research Group (1981) 148 pp.

    Google Scholar 

  11. Troelstra, A. S. Notions of realizability for intuitionistic arithmetic and intuitionistic arithmetic in all finite types. Proceedings of the Second Scandinavian Logic Symposium (1971) pp. 369–405

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Carnegie-Mellon University, Pittsburgh, PA

    Charles McCarty

Authors
  1. Charles McCarty
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edmund Clarke Dexter Kozen

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

McCarty, C. (1984). Information systems, continuity and realizability. In: Clarke, E., Kozen, D. (eds) Logics of Programs. Logic of Programs 1983. Lecture Notes in Computer Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12896-4_372

Download citation

  • DOI: https://doi.org/10.1007/3-540-12896-4_372

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12896-0

  • Online ISBN: 978-3-540-38775-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation