Eliminating Disjunctions by Disjunction Elimination. - Davide Rinaldi; Peter Schuster 001; Daniel Misselbeck-Wessel (Bull. Symb. Log., 2017)

Suzumura Consistency, an Alternative Approach. - Peter Schuster 001; Daniel Misselbeck-Wessel (FLAP, 2018)

Extension by Conservation. Sikorski's Theorem. - Davide Rinaldi; Daniel Misselbeck-Wessel (Log. Methods Comput. Sci., 2018)

A General Extension Theorem for Directed-Complete Partial Orders. - Peter Schuster 001; Daniel Misselbeck-Wessel (Reports Math. Log., 2018)

Cut elimination for entailment relations. - Davide Rinaldi; Daniel Misselbeck-Wessel (Arch. Math. Log., 2019)

Some forms of excluded middle for linear orders. - Peter Schuster 001; Daniel Misselbeck-Wessel (Math. Log. Q., 2019)

The Computational Significance of Hausdorff's Maximal Chain Principle. - Peter Schuster 001; Daniel Misselbeck-Wessel (CiE, 2020)

Resolving finite indeterminacy: A definitive constructive universal prime ideal theorem. - Peter Schuster 001; Daniel Misselbeck-Wessel (LICS, 2020)

Algebras of Complemented Subsets. - Iosif Petrakis; Daniel Misselbeck-Wessel (CiE, 2022)

The Jacobson radical of a Propositional Theory. - Giulio Fellin; Peter Schuster 001; Daniel Misselbeck-Wessel (Bull. Symb. Log., 2022)

The Jacobson radical for an inconsistency predicate. - Peter Schuster 001; Daniel Misselbeck-Wessel (Comput., 2022)

A formal approach to Menger's theorem. - Roberta Bonacina; Daniel Misselbeck-Wessel (Reports Math. Log., 2022)

Radical theory of Scott-open filters. - Daniel Misselbeck-Wessel; Peter Schuster 001 (Theor. Comput. Sci., 2023)

Maximal elements with minimal logic. - Daniel Misselbeck-Wessel (Inf. Process. Lett., 2023)

Complemented subsets and Boolean-valued, partial functions. - Daniel Misselbeck-Wessel; Iosif Petrakis (Comput., 2024)