How to normalize the Jay. - Dieter Probst; Thomas Studer (Theor. Comput. Sci., 2001)

Variation on a theme of Schütte. - Gerhard Jäger; Dieter Probst (Math. Log. Q., 2004)

On the relationship between fixed points and iteration in admissible set theory without foundation. - Dieter Probst (Arch. Math. Log., 2005)

Corrigendum to "Variation on a theme of Schütte". - Gerhard Jäger; Dieter Probst (Math. Log. Q., 2005)

The proof-theoretic analysis of transfinitely iterated quasi least fixed points. - Dieter Probst (J. Symb. Log., 2006)

On contraction and the modal fragment. - Kai Brünnler; Dieter Probst; Thomas Studer (Math. Log. Q., 2008)

Admissible closures of polynomial time computable arithmetic. - Dieter Probst; Thomas Strahm (Arch. Math. Log., 2011)

The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories. - Gerhard Jäger; Dieter Probst (Ann. Pure Appl. Log., 2011)

The provably terminating operations of the subsystem PETJ of explicit mathematics. - Dieter Probst (Ann. Pure Appl. Log., 2011)