Skip to main content
SpringerLink
Log in
Book cover

Logic, Foundations of Mathematics, and Computability Theory pp 3–9Cite as

Constructions ‘by Finite’

  • Chapter

Part of the book series: The University of Western Ontario Series in Philosophy of Science ((WONS,volume 9))

Abstract

My talk’s aim is a description and some grounds for one natural ‘good’ model C of finite type functional over the natural numbers N. In this respect the talk is like D. Scott’s report [10] on natural model for type-free λ-calculus at the last Congress.

This is a preview of subscription content, 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   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Ershov, Yu. L., Theory of Enumeration 2, Novosibirsk, 1973, 1–170.

    Google Scholar 

  2. Ershov, Yu. L., Theory of A-Spaces’, Algebra and Logic 12, No. 9 (1973), 369–416.

    Google Scholar 

  3. Ershov, Yu. L., ‘On Model G of the Theory BR’, Dokl. Akad. Nauk 217, No. 5 (1974), 1004–1006.

    Google Scholar 

  4. Ershov, Yu. L., ‘Maximal and Everywhere Defined Functional’, Algebra and Logic 13, No. 4 (1974), 374–397.

    Article  Google Scholar 

  5. Hyland, J. M. E., ‘Recursion Theory on the Countable Functionals, Thesis, 1975.

    Google Scholar 

  6. Luckhardt, H., ‘Extensional Gödel Functional Interpretation: A Consistency Proof of Classical Analysis’, Springer Lecture Notes No. 306 (1973).

    Google Scholar 

  7. Scarpellini, B., ‘A Model for Bar-recursion of Higher Types’, Corns. Math. 23 (1971), 123–153.

    Google Scholar 

  8. Tait, W. W., ‘Normal Form Theorem for Bar-recursive Functions of Finite Type’, in Proceed. Second. Scand. Log. Symp., Amsterdam, 1971, 353-367.

    Google Scholar 

  9. Troelstra, A. S., ‘Metamathematical Investigation of Intuitionistic Arithmetic and Analysis’, Springer Lecture Notes, No. 344 (1973).

    Google Scholar 

  10. Scott, D., ‘Models for Various Type-free Calculi’, in Proceed. IVth Congr. LMPHS’ Amsterdam, 1973, 157-187.

    Google Scholar 

Download references

Authors
  1. Yu. L. Ershov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The University of Western Ontario, Canada

    Robert E. Butts

  2. The Academy of Finland and Stanford University, USA

    Jaakko Hintikka

Rights and permissions

Reprints and permissions

Copyright information

© 1977 D. Reidel Publishing Company, Dordrecht, Holland

About this chapter

Cite this chapter

Ershov, Y.L. (1977). Constructions ‘by Finite’. In: Butts, R.E., Hintikka, J. (eds) Logic, Foundations of Mathematics, and Computability Theory. The University of Western Ontario Series in Philosophy of Science, vol 9. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-1138-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-94-010-1138-9_1

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-1140-2

  • Online ISBN: 978-94-010-1138-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation