( en | de | ru )

 

Disambiguation of "Avigad, Jeremy"

Author of the publication

copydeleteadd this publication to your clipboard
A formally verified proof of the prime number theorem.

, , , and . ACM Trans. Comput. Log., 9 (1): 2 (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.

Jeremy Cohen

Jérémy Bluteau

Jeremy Debattista

Jérémy Huart

Jérémy Fix

 

Other publications of authors with the same name

Plausibly hard combinatorial tautologies.. Proof Complexity and Feasible Arithmetics, volume 39 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 1-12. DIMACS/AMS, (1996)ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics., , , , , and . CoRR, (2023)A verified algebraic representation of cairo program execution., , , , and . CPP, page 153-165. ACM, (2022)Homotopy limits in type theory., , and . Math. Struct. Comput. Sci., 25 (5): 1040-1070 (2015)A formally verified proof of the prime number theorem., , , and . ACM Trans. Comput. Log., 9 (1): 2 (2007)The Lean Theorem Prover (System Description)., , , , and . CADE, volume 9195 of Lecture Notes in Computer Science, page 378-388. Springer, (2015)Formalizing O Notation in Isabelle/HOL., and . IJCAR, volume 3097 of Lecture Notes in Computer Science, page 357-371. Springer, (2004)Algorithmic barriers to representing conditional independence., , , , and . LICS, page 1-13. IEEE, (2019)Quantifier elimination for the reals with a predicate for the powers of two, and . CoRR, (2006)Algebraic proofs of cut elimination.. J. Log. Algebraic Methods Program., 49 (1-2): 15-30 (2001)