Author of the publication

A comparison of well-known ordinal notation systems for epsilon0.

. Ann. Pure Appl. Log., 147 (1-2): 48-70 (2007)

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

Binary Trees and (Maximal) Order Types.. CiE, volume 4497 of Lecture Notes in Computer Science, page 465-473. Springer, (2007)Mechanizing Metatheory Without Typing Contexts., , , and . J. Autom. Reason., 52 (2): 215-239 (2014)Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers., , , and . J. Comb. Theory, Ser. A, 115 (6): 1036-1055 (2008)Sharp thresholds for hypergraph regressive Ramsey numbers., , and . J. Comb. Theory, Ser. A, 118 (2): 558-585 (2011)Formally verifiable features in embedded vehicular security systems., , , , , and . VNC, page 1-7. IEEE, (2009)A comparison of well-known ordinal notation systems for epsilon0.. Ann. Pure Appl. Log., 147 (1-2): 48-70 (2007)GMeta: A Generic Formal Metatheory Framework for First-Order Representations., , , and . ESOP, volume 7211 of Lecture Notes in Computer Science, page 436-455. Springer, (2012)Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem.. CiE, volume 5635 of Lecture Notes in Computer Science, page 310-323. Springer, (2009)