We provide sufficient conditions for the existence of a conservative translation from a consequence system to another one. We analyze the problem in many settings, namely when the consequence systems are generated by a deductive calculus or by a logic system including both proof-theoretic and model-theoretic components. We also discuss reflection of several metaproperties with the objective of showing that conservative translations provide an alternative to proving such properties from scratch. We discuss soundness and completeness, disjunction property and metatheorem of deduction among others. We provide several illustrations of conservative translations.

中文翻译：

---

重访保守翻译

我们为从一个结果系统到另一个结果系统的保守翻译的存在提供了充分的条件。我们在许多情况下分析问题，即当结果系统由演绎演算或由包括证明理论和模型理论组件的逻辑系统生成时。我们还讨论了几个元属性的反映，目的是表明保守翻译提供了从头开始证明此类属性的替代方法。我们讨论了可靠性和完整性、析取性质和演绎元定理等。我们提供了几个保守翻译的例子。