Peter Päppinghaus

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2000
Report on a Practical Application of ASMs in Software Design.
Proceedings of the Abstract State Machines, 2000

1995
On the Logic of UNITY.
Theor. Comput. Sci., 1995

1989
Ptykes in Gödels<i>T</i> und Definierbarkeit von Ordinalzahlen.
Arch. Math. Log., 1989

Rekursion über Dilatoren und die Bachmann-Hierarchie.
Arch. Math. Log., 1989

1985
Pi<sub>2</sub>-models of extensions of Kripke-Platek set theory.
Proceedings of the Logic Colloquium '85, Orsay, France, 1985

1983
Recursive coloration of countable graphs.
Ann. Pure Appl. Log., 1983

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

1981
A Result on Implications of sigma;<sub>1</sub>-Sentences and Its Application to Normal Form Theorems.
J. Symb. Log., 1981

1980
A version of the ∑<sub>1</sub>-reflection principle for CFA provable in PRA.
Arch. Math. Log., 1980


  Loading...