TY - CPAPER TI - Faithful Logic Embeddings in HOL : Deep and Shallow AU - Benzmüller, Christoph PY - 2025 T2 - Automated Deduction – CADE 30 : 30th International Conference on Automated Deduction, Stuttgart, Germany, July 28-31, 2025, Proceedings SP - 280-301 PB - Springer Nature Switzerland CY - Cham SN - 9783031999833 DO - 10.1007/978-3-031-99984-0_16 UR - https://fis.uni-bamberg.de/handle/uniba/116345 LA - eng AB - Deep and shallow embeddings of non-classical logics in classical higher-order logic have been explored, implemented, and used in various reasoning tools in recent years. This paper presents a method for the simultaneous deployment of deep and shallow embeddings of various degrees in classical higher-order logic. This enables flexible, interactive and automated theorem proving and counterexample finding at meta and object level, as well as automated faithfulness proofs between these logic embeddings. The method is beneficial for logic education, research and application and is illustrated here using a simple propositional modal logic. However, this approach is conceptual in nature and not limited to this simple logic context. KW - Logic embeddings KW - Faithfulness KW - Automated Reasoning ER -