Skip to main content

Some lectures on intuitionistic logic

  • Conference paper
  • First Online:
Logic and Computer Science

Part of the book series: Lecture Notes in Mathematics ((LNMCIME,volume 1429))

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 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 39.95
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

Part I: General References

  • M. J. Beeson [1985]. Foundations of Constructive Mathematics, Springer-Verlag, Berlin.

    Book  MATH  Google Scholar 

  • M. Dummett [1977], Elements of Intuitionism, Clarendon Press, Oxford.

    MATH  Google Scholar 

  • A. G. Dragalin [1987], Mathematical Intuitionism: Introduction to Proof Theory, Translations of Mathematical Monographs 67, AMS, Providence, R. I.

    MATH  Google Scholar 

  • M. Fitting [1983], Proof Methods for Modal and Intuitionistic Logics, D. Reidel, Dordrecht.

    Book  MATH  Google Scholar 

  • D. G. Gabbay [1981], Semantical Investigations in Heyting's Intuitionistic Logic, D. Reidel, Dordrecht.

    Book  MATH  Google Scholar 

  • J-Y. Girard [1987], Proof Theory and Logical Complexity, vol. I, Studies in Proof Theory, Bibliopolis, Naples.

    Google Scholar 

  • A. Heyting [1956], Intuitionism: an Introduction, North-Holland, Amsterdam.

    MATH  Google Scholar 

  • S. C. Kleene [1952], Introduction to Metamathematics, North-Holland (1971 edition), Amsterdam.

    MATH  Google Scholar 

  • A. Nerode [1986], "Applied logic", in The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics, (R. E. Ewing, K. I. Gross, C. F. Martin, eds.), Springer-Verlag, Berlin, 127–163.

    Chapter  Google Scholar 

  • A. Nerode and J. B. Remmel [1985], "A survey of r.e. substructures", in Recursion Theory (A. Nerode and R. Shore, eds.), Proc. Symposia in Pure Math 42, Amer. Math. Soc., Providence, RI, 323–373.

    Chapter  Google Scholar 

  • D. Prawitz [1965], Natural Deduction, Almqvist and Wiskell, Stockholm.

    MATH  Google Scholar 

  • R. M. Smullyan [1968], First-Order Logic, Springer-Verlag, Berlin.

    Book  MATH  Google Scholar 

  • A. S. Troelstra [1973], Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, Mathematical Lecture Notes 344, Springer-Verlag, Berlin.

    MATH  Google Scholar 

  • A. S. Troelstra and D. van Dalen [1988], Constructivism in Mathematics, vol. I, II, North-Holland.

    Google Scholar 

  • D. van Dalen [1983], Logic and Structure, second ed., Springer-Verlag, Berlin.

    Book  Google Scholar 

  • D. van Dalen [1986], "Intuitionistic logic", in The Handbook of Philosophical Logic, vol. III, 225–339, D. Reidel, Dordrecht.

    Chapter  Google Scholar 

Part II: Other References

  • E. Bishop [1967], Foundations of Constructive Analysis, McGraw-Hill, New York. The 1985 edition is much expanded with D. Bridges as co-author.

    MATH  Google Scholar 

  • H. de Swart [1976], "Another intuitionistic completeness proof", J. Symb. Logic 41, 4–662.

    Article  MathSciNet  MATH  Google Scholar 

  • M. P. Fourman and D. S. Scott [1977], "Sheaves in logic", in Applications of Sheaves, (Fourman, Mulvey and Scott, eds.), Mathematical Lecture Notes 753, Springer-Verlag, Berlin, 302–401. This paper is very useful for understanding the relation between higher order intuitionistic logic and category theory.

    Chapter  Google Scholar 

  • J-Y. Girard [1971], "Une extension de l'interprétation de Gödel à l'analyse, et son application à l'élimination de coupures dans l'analyse et la théorie des types", in Proceedings of the Second Scandinavian Logic Symposium, (J. E. Fenstad, ed.), North-Holland, Amsterdam.

    Google Scholar 

  • J-Y. Girard [1972], "Interprétation fonctionelle et élimination de coupures de l'arithmétique d'ordre supérieur," Thèse de Doctorat d'état, Université Paris VII.

    Google Scholar 

  • J-Y. Girard, Y. Lafont, and P. Taylor [1989], Proofs and Types, Cambridge tracts in theoretical computer science 7, Cambridge University Press, Cambridge, England. The first exposition in understandable textbook form of Girard's system F as a basis for polymorphic λ-calculus. This book also contains some linear logic.

    Google Scholar 

  • R. J. Grayson [1983], "Forcing in intuitionistic systems without power set", J. Symb. Logic, 48, 670–682.

    Article  MathSciNet  MATH  Google Scholar 

  • J. E. Hopcroft and J. D. Ullman [1979], Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, Mass.

    MATH  Google Scholar 

  • W. A. Howard [1980], "The Formulae-as-types notion of construction", in To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism, Academic Press, 479–490.

    Google Scholar 

  • G. E. Hughes and M. J. Cresswell [1968], An Introduction to Modal Logic, Methuen, London.

    MATH  Google Scholar 

  • S. C. Kleene and R. Vesley [1965], The Foundations of Intuitionistic Mathematics, North-Holland, Amsterdam.

    MATH  Google Scholar 

  • G. Kreisel [1962], "On weak completeness of intuitionistic predicate logic", J. Symb. Logic 27, 139–158.

    Article  MathSciNet  MATH  Google Scholar 

  • S. Kripke [1965], "Semantical analysis of intuitionistic logic I", in Formal Systems and Recursive Functions, (J. N. Crossley, M. Dummett, eds.) North-Holland, Amsterdam, 92–130.

    Chapter  Google Scholar 

  • J. Lambek and P. J. Scott [1986], Introduction to Higher Order Categorical Logic, Cambridge Studies in Advanced Mathematics 7, Cambridge University Press, Cambridge, England.

    Google Scholar 

  • H. Läuchli [1970], "An abstract notion of realizability for which predicate calculus is complete," in Intuitionism and Proof Theory, (Kino, Myhill, Vesley, eds.), North-Holland, Amsterdam.

    Google Scholar 

  • D. Leivant [1983], "Polymorphic type inference" in Proc. 10th ACM Symposium on the Principles of Programming Languages, ACM, New York, 88–98.

    Google Scholar 

  • D. Leivant [1983a], "Reasoning about functional programs and complexity classes associated with type disciplines," in 24th Annual Symposium on Foundations of Computer Science, 460–496.

    Google Scholar 

  • H. Rasiowa and R. Sikorski [1963], Mathematics of Metamathematics, Monographie Matematyczne, t. 41, Warsawa.

    Google Scholar 

  • C. Smorynski [1973], "Applications of Kripke models", in Troelstra [1973], see part I of the bibliography.

    Google Scholar 

  • R. Statman [1973], "Intuitionistic propositional logic is polynomial space complete", Theoretical Computer Science 9, 67–72.

    Article  MathSciNet  MATH  Google Scholar 

  • S. Stenlund [1972], Combinators, λ-terms and Proof Theory, D. Reidel, Dordrecht.

    Book  MATH  Google Scholar 

  • P. B. Thistlewaite, M. A. McRobbie, R. K. Meyer [1988], Automated Theorem Proving in Non-Classical Logics, Wiley, N.Y.

    MATH  Google Scholar 

  • W. Veldman [1976], "An intuitionistic completeness theorem for intuitionistic predicate logic", J. Symb. Logic 41, 159–166.

    MathSciNet  MATH  Google Scholar 

  • L. Wallen, [1990], Automated Proof Search in Nonclassical Logics, MIT Press, Cambridge, Mass.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Piergiorgio Odifreddi

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Nerode, A. (1990). Some lectures on intuitionistic logic. In: Odifreddi, P. (eds) Logic and Computer Science. Lecture Notes in Mathematics, vol 1429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0093923

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52734-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics