Article contents
A characterization of ML in many-sorted arithmetic with conditional application
Published online by Cambridge University Press: 12 March 2014
Abstract
In this paper we discuss an interpretation of intuitionistic type theory in many-sorted arithmetic with so-called conditional application. Via the formulas-as-types correspondence the arithmetical system in turn can be embedded in ML, resulting in a characterization of strong Σ-elimination by an axiom of conditional choice.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1992
References
REFERENCES
- 1
- Cited by