Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory (Extended Version). - Yannick Forster 002; Dominik Kirst; Dominik Wehr (CoRR, 2020)

Completeness theorems for first-order logic analysed in constructive type theory. - Yannick Forster 002; Dominik Kirst; Dominik Wehr (J. Log. Comput., 2021)

Material Dialogues for First-Order Logic in Constructive Type Theory. - Dominik Wehr; Dominik Kirst (WoLLIC, 2022)

Exact bounds for acyclic higher-order recursion schemes. - Bahareh Afshari; Dominik Wehr (Inf. Comput., 2023)

From GTC to : Generating reset proof systems from cyclic proof systems. - Graham E. Leigh; Dominik Wehr (Ann. Pure Appl. Log., 2024)

Abstract cyclic proofs. - Bahareh Afshari; Dominik Wehr (Math. Struct. Comput. Sci., 2024)

Material dialogues for first-order logic in constructive type theory: extended version. - Dominik Wehr; Dominik Kirst (Math. Struct. Comput. Sci., 2024)

Unravelling Cyclic First-Order Arithmetic. - Graham E. Leigh; Dominik Wehr (CoRR, 2025)