![]() |
| 1995 | ||
|---|---|---|
| 6 | EE | Rudolf Berghammer, Birgit Elbl, Ulf R. Schmerl: Formalizing Dijkstra's Predicate Transformer wp in Weak Second-Order Logic. Theor. Comput. Sci. 146(1&2): 185-197 (1995) |
| 1992 | ||
| 5 | Rudolf Berghammer, Birgit Elbl, Ulf R. Schmerl: Proving Total Correctness of Programs in Weak Second-Order Logic. REX Workshop 1992: 51-72 | |
| 1991 | ||
| 4 | Ulf R. Schmerl: A Cut-Elimination Procedure Designed for Evaluating Proofs as Programs. CSL 1991: 316-325 | |
| 1988 | ||
| 3 | Ulf R. Schmerl: Resolution on Formula-Trees. Acta Inf. 25(4): 425-438 (1988) | |
| 1987 | ||
| 2 | Ulf R. Schmerl: Resolution on Formula-Trees. GWAI 1987: 211-220 | |
| 1985 | ||
| 1 | Ulf R. Schmerl: Critères d'indépendence d'équations diophantiennes de fragments de l'alrithmétique. Logic Colloquium 1985: 303- | |
| 1 | Rudolf Berghammer | [5] [6] |
| 2 | Birgit Elbl | [5] [6] |