Export 3 results:
Filters: Author is Monika Seisenberger  [Clear All Filters]
In Press
Steila, S.: A combinatorial bound for a restricted form of the Termination Theorem. In: Schuster, P., Seisenberger, M., and Weiermann, A. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Springer (In Press).