Skip to main content

Intuitionistic L

  • Chapter
Logical Methods

Part of the book series: Progress in Computer Science and Applied Logic ((PCS,volume 12))

Abstract

The goal of this paper is to develop the basics of IL, that is, L under intuitionistic reasoning. The highlights are that (under IZF) IL is a model of V = L and also of IZF. While these are not exciting results classically, they and their associated lemmas are examples of the phenomenon that classical trivialities can become sticky intuitionistically, when they are not downright false.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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. Friedman, H. and A. Scedrov [1985], The lack of definable witnesses and provably recursive functions in intuitionistic set theories, Advances in Math, 57, 1–13.

    Article  MathSciNet  MATH  Google Scholar 

  2. Grayson, R. [1982], Constructive well-orderings, Zeitschrift f. Math. Logik u. Grundlagen d. Math. 28, 495–504.

    Article  MathSciNet  MATH  Google Scholar 

  3. Grayson, R. [1979], Hey ting-valued models for intuitionistic set theory, Applications of Sheaves ( Fourman, Mulvey and Scott, eds.), Springer Lecture Notes in Mathematics 753, 402–414.

    Google Scholar 

  4. Lipton, J., Readability, set theory, and term extraction, in The Curry-Howard Isomorphism. To appear.

    Google Scholar 

  5. Lubarsky, R., IKP and friends. To appear.

    Google Scholar 

  6. McCarty, C. [D]. [1986], Realizability and recursive set theory, Annals of Pure and Applied Logic, 32, 153–183.

    Article  MathSciNet  MATH  Google Scholar 

  7. Powell, W. [1975], Extending Gödel’s negative interpretation of ZF, J. of Symbolic Logic 40, 221–229.

    Article  MATH  Google Scholar 

  8. Scedrov, A. [1985], Intuitionistic set theory, Harvey Friedman’s Research on the Foundations of Mathematics, North-Holland, 257–284.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer Science+Business Media New York

About this chapter

Cite this chapter

Lubarsky, R.S. (1993). Intuitionistic L. In: Crossley, J.N., Remmel, J.B., Shore, R.A., Sweedler, M.E. (eds) Logical Methods. Progress in Computer Science and Applied Logic, vol 12. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0325-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-0325-4_18

  • Publisher Name: Birkhäuser, Boston, MA

  • Print ISBN: 978-1-4612-6708-9

  • Online ISBN: 978-1-4612-0325-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics