Skip to main content

Classically and intuitionistically provably recursive functions

Part of the Lecture Notes in Mathematics book series (LNM,volume 669)

Keywords

  • Recursive Function
  • Atomic Formula
  • Intuitionistic Logic
  • Double Negation
  • Functional Interpretation

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.95
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Friedman, The consistency of classical set theory relative to a set theory with intuitionistic logic, Journal of Symbolic Logic, JSL (38), June, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Friedman, H. (1978). Classically and intuitionistically provably recursive functions. In: Müller, G.H., Scott, D.S. (eds) Higher Set Theory. Lecture Notes in Mathematics, vol 669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0103100

Download citation

  • DOI: https://doi.org/10.1007/BFb0103100

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08926-1

  • Online ISBN: 978-3-540-35749-0

  • eBook Packages: Springer Book Archive