Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("WEIERMANN, A")

Results 1 to 2 of 2

  • Page / 1
Export

Selection :

  • and

Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengthsWEIERMANN, A.Theoretical computer science. 1995, Vol 139, Num 1-2, pp 355-362, issn 0304-3975Article

Bounds for the closure ordinals of essentially monotonic increasing functionsWEIERMANN, A.The Journal of symbolic logic. 1993, Vol 58, Num 2, pp 664-671, issn 0022-4812Conference Paper

  • Page / 1