Author of the publication

Proofs of Termination of Rewrite Systems for Polytime Functions.

, and . FSTTCS, volume 3821 of Lecture Notes in Computer Science, page 529-540. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Proof Theory of Weak compactness.. J. Math. Log., 13 (1): 1350003 (2013)A Slow Growing Analogue to Buchholz' Proof.. Ann. Pure Appl. Log., 54 (2): 101-120 (1991)Proof theory for theories of ordinals - I: recursively Mahlo ordinals.. Ann. Pure Appl. Log., 122 (1-3): 1-85 (2003)A new function algebra of EXPTIME functions by safe nested recursion, and . CoRR, (2006)Nested PLS.. Arch. Math. Log., 50 (3-4): 395-409 (2011)Epsilon substitution method for Π02-FIX.. J. Symb. Log., 71 (4): 1155-1188 (2006)A new function algebra of EXPTIME functions by safe nested recursion., and . ACM Trans. Comput. Log., 10 (4): 24:1-24:19 (2009)Proof-theoretic strengths of the well-ordering principles.. Arch. Math. Log., 59 (3-4): 257-275 (2020)Epsilon substitution method for theories of jump hierarchies.. Arch. Math. Log., 41 (2): 123-153 (2002)Wellfoundedness proof with the maximal distinguished set.. Arch. Math. Log., 62 (3-4): 333-357 (May 2023)