Two di erent operational interpretations of intuitionistic linear logic have been proposed in the literature. The simplest interpretation recomputes non-linear values every time they are required. It has good memory-management properties, but is often dismissed as being too ine cient. Alternatively,
Logical problems of functional interpretations
โ Scribed by Justus Diller
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 135 KB
- Volume
- 114
- Category
- Article
- ISSN
- 0168-0072
No coin nor oath required. For personal study only.
โฆ Synopsis
G odel interpreted Heyting arithmetic HA in a "logic-free" fragment T0 of his theory T of primitive recursive functionals of รฟnite types by his famous Dialectica-translation D . This works because the logic of HA is extremely simple. If the logic of the interpreted system is di erent-in particular more complicated-, it forces us to look for di erent and more complicated functional translations. We discuss the arising logical problems for arithmetical and set theoretical systems from HA to CZF. We want to test the thesis: While the functionals take care of the proof theoretic strength of the interpreted system, it is the functional translation that has to cope with the logical complexities of the system.
๐ SIMILAR VOLUMES
## Abstract In distinction from the wellโknown doubleโnegation embeddings of the classical logic we consider some variants of singleโnegation embeddings and describe some classes of superintuitionistic firstโorder predicate logics in which the classical firstโorder calculus is interpretable in such