Hostname: page-component-77f85d65b8-g98kq Total loading time: 0 Render date: 2026-04-15T16:50:10.420Z Has data issue: false hasContentIssue false
  • English
  • Français

The logic of first order intuitionistic type theory with weak sigma-elimination

Published online by Cambridge University Press:  12 March 2014

M. D. G. Swaen
M. D. G. Swaen*
Affiliation:
Fakulteit Wiskunde en Informatika, Universiteit van Amsterdam, 1018 TV Amsterdam, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

Via the formulas-as-types embedding certain extensions of Heyting Arithmetic can be represented in intuitionistic type theories. In this paper we discuss the embedding of ω-sorted Heyting Arithmetic HAω into a type theory WL, that can be described as Troelstra's system with so-called weak Σ-elimination rules. By syntactical means it is proved that a formula is derivable in HAω if and only if its corresponding type in WL is inhabited. Analogous results are proved for Diller's so-called restricted system and for a type theory based on predicate logic instead of arithmetic.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 56 , Issue 2 , June 1991 , pp. 467 - 483
Copyright
Copyright © Association for Symbolic Logic 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

[B 89]Barendsen, E., Representation of logic, data types and recursive functions in typed lambda calculi, Technical Report, Katholieke Universiteit Nijmegen, Nijmegen, 1989.Google Scholar
[D 80]Diller, J., Modified realizability and intuitionistic logic, To H. B. Curry: Essays on combinatory logic, lambda calculus and formalism (Seldin, J. P. and Hindley, J. R., editors), Academic Press, New York, 1980, pp. 490–501.Google Scholar
[H 80]Howard, W. A., Formulae-as-types, To H. B. Curry: Essays on combinatory logic, lambda calculus and formalism (Seldin, J. P. and Hindley, J. R., editors), Academic Press, New York, 1980, pp. 479–489.Google Scholar
[ML75]Martin-Löf, P., An intuitionistic theory of types: predicative part, Logic colloquium '73(Rose, H. E. and Shepherdson, J. C., editors), North-Holland, Amsterdam, 1975, pp. 73–118.Google Scholar
[ML 80]Martin-Löf, P., Intuitionistic type theory, Bibliopolis, Naples, 1980.Google Scholar
[S 89]Swaen, M. G. D., Weak and strong sum-elimination in intuitionistic type theory, Thesis, Universiteit van Amsterdam, Amsterdam, 1989.Google Scholar
[T/vD 88]Troelstra, A. S. and van Dalen, D., Constructivism in mathematics. Vols. I, II, North-Holland, Amsterdam, 1988.Google Scholar