Browse by Person
![]() | Up a level |
Hähnle, Reiner ; Murray, Neil ; Rosenthal, Erik
eds.: Fermüller, Christian ; Egly, Uwe (2002)
Unit Preference for Ordered Resolution
and for Connection Graph Resolution.
Conference or Workshop Item
Egly, Uwe ; Schmitt, S. (1999)
On intuitionistic proof transformations, their complexity, and application to constructive program synthesis.
In: Fundamenta Informaticae, 39 (1-2)
doi: 10.3233/FI-1999-391204
Article
Egly, Uwe ; Schmitt, S. (1998)
Intuitionistic proof transformations and their application to constructive program synthesis.
Conference or Workshop Item
Egly, Uwe (1996)
On the practical value of different definitional translations to normal form.
Conference or Workshop Item
Egly, Uwe (1996)
On the practical value of different definitional translations to normal form.
Conference or Workshop Item
Egly, Uwe (1995)
Super-polynomial speed-ups in proof length by new tautologies.
Conference or Workshop Item
Egly, Uwe ; Rath, (1995)
The halting problem: an automatically generated proof.
In: AAR-newsletter. 30 (1995), S. 10-16
Article
Egly, Uwe (1994)
On methods of function introduction and related concepts.
TU Darmstadt
Ph.D. Thesis