Gödel interpreted Heyting arithmetic HA in a “logic-free” fragment T 0 of his theory T of primitive recursive functionals of finite 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 different—in particular more complicated—, it forces us to look for different 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. (shrink)