This paper contributes to the calculization of evocation and erotetic implication as defined by Inferential Erotetic Logic (IEL). There is a straightforward approach to calculizing (propositional) erotetic implication which cannot be applied to evocation. First-order evocation is proven to be uncalculizable, i.e. there is no proof system, say FOE, such that for all $X, Q$ : X evokes Q iff there is an FOE-proof for the evocation of Q by X. These results suggest a critique of the represented approaches to calculizing IEL. This critique is expanded into a programmatic reconsideration of the IEL-definitions of evocation and erotetic implication. From a different point of view these definitions should be seen as desiderata that may or may not play the role of a point of orientation when setting up “rules of asking.”

中文翻译：

---

经典推理色情逻辑的计算

本文有助于计算由推理色情逻辑 (IEL) 定义的唤起和色情暗示。有一种直接的方法可以计算（命题）色情暗示，但不能应用于唤起。一阶唤起被证明是不可计算的，即没有证明系统，比如说 FOE，这样对于所有$X, Q$：X唤起问如果有一个 FOE 证明来唤起问经过X. 这些结果表明了对计算 IEL 的代表方法的批评。这种批评被扩展为对 IEL 对唤起和色情暗示的定义的程序性重新考虑。从不同的角度来看，这些定义应该被视为在制定“询问规则”时可能会或可能不会发挥导向点作用的需求。