A version of the ∑1-reflection principle for CFA provable in PRA. - Peter Päppinghaus (Arch. Math. Log., 1980)

A Result on Implications of sigma;1-Sentences and Its Application to Normal Form Theorems. - Jean-Yves Girard 001; Peter Päppinghaus (J. Symb. Log., 1981)

Extensible algorithms. - Hans Georg Carstens; Peter Päppinghaus (Logic and Machines, 1983)

Recursive coloration of countable graphs. - Hans Georg Carstens; Peter Päppinghaus (Ann. Pure Appl. Log., 1983)

Pi2-models of extensions of Kripke-Platek set theory. - Peter Päppinghaus (Logic Colloquium, 1985)

Rekursion über Dilatoren und die Bachmann-Hierarchie. - Peter Päppinghaus (Arch. Math. Log., 1989)

Ptykes in GödelsT und Definierbarkeit von Ordinalzahlen. - Peter Päppinghaus (Arch. Math. Log., 1989)

On the Logic of UNITY. - Peter Päppinghaus (Theor. Comput. Sci., 1995)

Report on a Practical Application of ASMs in Software Design. - Egon Börger; Peter Päppinghaus; Joachim Schmid 001 (Abstract State Machines, 2000)