Peter Päppinghaus

According to our database, Peter Päppinghaus authored at least 9 papers between 1980 and 2000.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2000

Report on a Practical Application of ASMs in Software Design.

Egon Börger, Peter Päppinghaus, Joachim Schmid

Proceedings of the Abstract State Machines, 2000

1995

On the Logic of UNITY.

Peter Päppinghaus

Theor. Comput. Sci., 1995

1989

Ptykes in Gödels<i>T</i> und Definierbarkeit von Ordinalzahlen.

Peter Päppinghaus

Arch. Math. Log., 1989

Rekursion über Dilatoren und die Bachmann-Hierarchie.

Peter Päppinghaus

Arch. Math. Log., 1989

1985

Pi₂-models of extensions of Kripke-Platek set theory.

Peter Päppinghaus

Proceedings of the Logic Colloquium '85, Orsay, France, 1985

1983

Recursive coloration of countable graphs.

Hans Georg Carstens, Peter Päppinghaus

Ann. Pure Appl. Log., 1983

Extensible algorithms.

Hans Georg Carstens, Peter Päppinghaus

Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983

1981

A Result on Implications of sigma;₁-Sentences and Its Application to Normal Form Theorems.

Jean-Yves Girard, Peter Päppinghaus

J. Symb. Log., 1981

1980

A version of the ∑₁-reflection principle for CFA provable in PRA.

Peter Päppinghaus

Arch. Math. Log., 1980