Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Part I: General References
M. J. Beeson [1985]. Foundations of Constructive Mathematics, Springer-Verlag, Berlin.
M. Dummett [1977], Elements of Intuitionism, Clarendon Press, Oxford.
A. G. Dragalin [1987], Mathematical Intuitionism: Introduction to Proof Theory, Translations of Mathematical Monographs 67, AMS, Providence, R. I.
M. Fitting [1983], Proof Methods for Modal and Intuitionistic Logics, D. Reidel, Dordrecht.
D. G. Gabbay [1981], Semantical Investigations in Heyting's Intuitionistic Logic, D. Reidel, Dordrecht.
J-Y. Girard [1987], Proof Theory and Logical Complexity, vol. I, Studies in Proof Theory, Bibliopolis, Naples.
A. Heyting [1956], Intuitionism: an Introduction, North-Holland, Amsterdam.
S. C. Kleene [1952], Introduction to Metamathematics, North-Holland (1971 edition), Amsterdam.
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.
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.
D. Prawitz [1965], Natural Deduction, Almqvist and Wiskell, Stockholm.
R. M. Smullyan [1968], First-Order Logic, Springer-Verlag, Berlin.
A. S. Troelstra [1973], Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, Mathematical Lecture Notes 344, Springer-Verlag, Berlin.
A. S. Troelstra and D. van Dalen [1988], Constructivism in Mathematics, vol. I, II, North-Holland.
D. van Dalen [1983], Logic and Structure, second ed., Springer-Verlag, Berlin.
D. van Dalen [1986], "Intuitionistic logic", in The Handbook of Philosophical Logic, vol. III, 225–339, D. Reidel, Dordrecht.
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.
H. de Swart [1976], "Another intuitionistic completeness proof", J. Symb. Logic 41, 4–662.
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.
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.
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.
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.
R. J. Grayson [1983], "Forcing in intuitionistic systems without power set", J. Symb. Logic, 48, 670–682.
J. E. Hopcroft and J. D. Ullman [1979], Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, Mass.
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.
G. E. Hughes and M. J. Cresswell [1968], An Introduction to Modal Logic, Methuen, London.
S. C. Kleene and R. Vesley [1965], The Foundations of Intuitionistic Mathematics, North-Holland, Amsterdam.
G. Kreisel [1962], "On weak completeness of intuitionistic predicate logic", J. Symb. Logic 27, 139–158.
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.
J. Lambek and P. J. Scott [1986], Introduction to Higher Order Categorical Logic, Cambridge Studies in Advanced Mathematics 7, Cambridge University Press, Cambridge, England.
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.
D. Leivant [1983], "Polymorphic type inference" in Proc. 10th ACM Symposium on the Principles of Programming Languages, ACM, New York, 88–98.
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.
H. Rasiowa and R. Sikorski [1963], Mathematics of Metamathematics, Monographie Matematyczne, t. 41, Warsawa.
C. Smorynski [1973], "Applications of Kripke models", in Troelstra [1973], see part I of the bibliography.
R. Statman [1973], "Intuitionistic propositional logic is polynomial space complete", Theoretical Computer Science 9, 67–72.
S. Stenlund [1972], Combinators, λ-terms and Proof Theory, D. Reidel, Dordrecht.
P. B. Thistlewaite, M. A. McRobbie, R. K. Meyer [1988], Automated Theorem Proving in Non-Classical Logics, Wiley, N.Y.
W. Veldman [1976], "An intuitionistic completeness theorem for intuitionistic predicate logic", J. Symb. Logic 41, 159–166.
L. Wallen, [1990], Automated Proof Search in Nonclassical Logics, MIT Press, Cambridge, Mass.
Author information
Authors and Affiliations
Editor information
Rights 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