Abstract
Constructive reasoning has played an increasingly important role in the development of provably correct software. Both typed and type-free frameworks stemming from ideas of Heyting, Kleene, and Curry have been developed for extracting computations from constructive specifications. These include Realizability, and Theories based on the Curry-Howard isomorphism. Realizability — in its various typed and type-free formulations — brings out the algorithmic content of theories and proofs and supplies models of the “recursive universe”. Formal systems based on the propositions-as-types paradigm, such as Martin-Löf's dependent type theories, incorporate term extraction into the logic itself.
Another, major tradition in constructive semantics originated in the model theory developed by Gödel, Herbrand and Tarski, resulting in the interpretations developed by Kripke and Beth, and in subsequent categorical generalizations. They provide a complete semantics for constructive logic. These models are a powerful tool for building counterexamples and establishing independence and conservativity results, but they are often less constructive and less computationally oriented.
It is highly desirable to combine the power of these approaches to constructive semantics, and to elucidate some connections between them. We define modified Kripke and Beth models for syntactic Realizability and Dependent Type theory, in particular for the one-universe Intensional Martin-Löf Theory ML i0 and prove a completeness theorem for the latter theory. These models provide a new framework for reasoning about computational evidence and the process of term-extraction. They are defined over a constructive type-free metatheory based on the Feferman-Beeson theories of abstract applicative structure.
Our models have a feature which is shared by all published constructive completeness theorems for intuitionistic logic, known in the literature as “fallibility”: there may be worlds in which some sentences are both false and true, a phenomenon which corresponds to the presence of empty types in various type disciplines. We also identify a natural lattice of truth values associated with type theory and realizability: the degrees of inhabitation.
Preview
Unable to display preview. Download preview PDF.
References
Aczel, P. [1977] The Strength of Martin-Löf's Type Theory with One Universe, in: Mietissen, S. and Väänänen, J., (eds), The proceedings of the symposiums on Mathematical Logic Helsinki 1975, University of Helsinki, 1977.
Allen,S. [1988], Ph. D. Dissertation, Cornell University, Ithaca, N.Y.
Beeson, M. J. [1985a], Foundations of Constructive Mathematics, Springer-Verlag, Berlin.
Constable, R. L., et al [1986], Implementing Mathematics with the NUPRL Development System, Prentice-Hall, N.J.
Coquand, T. [1990], “On the analogy between propositions and types”, in: Logic Foundations of Functional Programming, Huet, G. ed., Addison-Wesley, Reading, MA.
Dragalin, A. G., [1988], “A Completeness Theorem for Higher Order Intuitionistic Logic: An Intuitionistic Proof”, in Mathematical Logic and its Applications, D. Skordev, ed., Plenum.
Feferman, S. [1975], “A language and axioms for explicit mathematics”, in: Algebra and Logic, Lecture Notes in Mathematics No. 450, pp. 87–139, Springer, Berlin.
Fitting, M. [1983], Proof Methods for Modal and Intuitionistic Logics, D. Reidel, Dordrecht, The Netherlands.
Fourman, M. P. and D. S. Scott [1979], “Sheaves and logic”, in: Fourman, Mulvey and Scott, (eds.), Applications of Sheaves, Mathematical Lecture Notes 753, pp.302–401, Springer-Verlag, Berlin.
Grayson, R. J. [1983], “Forcing in intuitionistic systems without power set”, Journal of Symbolic Logic 48, 670–682.
Hyland, J. M. E., P. T. Johnstone and A. M. Pitts [1980], “Tripos Theory”, Math. Proceedings of the Cambridge Phil. Society 88, 205–252.
Hyland, J. M. E. [1982], “The effective topos”. in: Troelstra, A. S. and D. S. van Dalen (eds.), L.E.J. Brouwer Centenary Symposium, North-Holland, Amsterdam.
Kleene, S. C. [1952], Introduction to Metamathematics, North-Holland (1971 edition), Amsterdam.
Kripke, S. [1965], “Semantical analysis of intuitionistic logic I”, in: Crossley, J. N. and M. Dummett (eds.), Formal Systems and Recursive Functions, Proceedings of the Eighth Logic Colloquium, Oxford, 1963, North-Holland, Amsterdam, 92–130.
Lambek, J. and P. J. Scott [1986], Introduction to higher order categorical logic, Cambridge Studies in Advanced Mathematics 7, Cambridge.
Läuchli, H. [1970], “An abstract notion of realizability for which predicate calculus is complete”, in: Myhill, J., A. Kino, and R. E. Vesley (eds.), Intuitionism and Proof Theory, North-Holland, Amsterdam, 227–234.
Lipton, J. [1990], “Realizability and Kripke Forcing”, in the Annals of Mathematics and Artificial Intelligence, Vol.4, North-Holland, Amsterdam. An expanded version appeared as technical report 90-1163, Dept. of Computer Science, Cornell University, Ithaca, NY.
Lipton, J. [1990], “Constructive Kripke Semantics and Realizability”, to appear in the proceedings of the Logic for Computer Science conference held at the Math. Sci. Research Institute, Berkeley, Nov. 1989.
Lipton, J. [1992] “Type theory, Kripke models and degrees of Inhabitation.” Submitted to the Annals of Pure and Applied Logic.
Lipton, J. [1992], “Kripke Models for Subrecursive computation”, to appear.
Martin-Löf, P. [1982], “Constructive Mathematics and Computer Programming”, in Logic, Methodology and Philosophy of Science IV, North Holland, Amsterdam.
Martin-Löf, P. [1984], Intuitionistic Type Theory, Studies in Proof Theory Lecture Notes, BIBLIOPOLIS, Napoli, Italy.
McCarty, D. C. [1986], “Realizability and recursive set theory”, Annals of Pure and Applied Logic 32, 11–194.
Mitchell, J. and E. Moggi [1987], “Kripke-style models for typed lambda calculus”, Proceedings from Symposium on Logic in Computer Science, Cornell University, June 1987, IEEE, Washington, D.C..
Nerode, A. [1989b], “Some lecures on Intuitionistic Logic I”, Proceedings on Summer School on Logical Foundations of Computer Science, CIME, Montecatini, 1988, Lecture Notes in Mathematics, Springer-Verlag, Berlin.
Nerode, A., and P. Odifreddi, [1990], Lambda Calculi and Constructive Logics, MSI Tech. Report'90-55
Odifreddi, P. [1989], Classical Recursion Theory, North-Holland, Amsterdam.
Plotkin, G., [1980], “Lambda definability in the full type hierarchy”, in: Seldin, J.P. and J. R. Hindley (eds.), To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism, Academic Press, New York.
Statman, R., [1982],“Logical relations and the typed Lambda Calculus”, Information and Control.
Swart, H. C. M. de [1976], “Another intuitionistic completeness proof”, Journal of Symbolic Logic 41, 644–662.
Troelstra, A. S. and D. van Dalen [1988], Constructivism in Mathematics: An Introduction, Vol. II, Studies in Logic and the Foundations of Mathematics, Vol. 123, North-Holland, Amsterdam.
Veldman, W. [1976], “An intuitionistic completeness theorem for intuitionistic predicate logic”, Journal of Symbolic Logic 41, 159–166.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lipton, J. (1992). Kripke semantics for dependent type theory and realizability interpretations. In: Myers, J.P., O'Donnell, M.J. (eds) Constructivity in Computer Science. Constructivity in CS 1991. Lecture Notes in Computer Science, vol 613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021080
Download citation
DOI: https://doi.org/10.1007/BFb0021080
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55631-2
Online ISBN: 978-3-540-47265-0
eBook Packages: Springer Book Archive