Formalizing an analytic proof of the prime number theorem
type: Item
instance of: scholarly article
title: Formalizing an analytic proof of the prime number theorem
zbMATH Open document ID: 1185.68624
author: Yanyan Li
published in: Journal of Automated Reasoning
publication date: 2010-01-25T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 11A41
zbMATH DE Number: 5662153
zbMATH Keywords: analytic proof
zbMATH Keywords: prime number theorem
zbMATH Keywords: computer formalization
describes a project that uses: HOL Light
describes a project that uses: ML
describes a project that uses: HOL
MaRDI profile type: Publication
full work available at URL: s10817-009-9145-6
OpenAlex ID: W1984801909
Wikidata QID: Q56059244
cites work: PRIMES is in P
cites work: Q4332931
cites work: The free will theorem
cites work: Q5287513
cites work: Edinburgh LCF. A mechanized logic of computation
cites work: Q4231030
cites work: Theorem Proving in Higher Order Logics
cites work: Towards Self-verification of HOL Light
cites work: Q4752704
cites work: Q4780264
cites work: Analytic Number Theory
cites work: Obvious inferences
cites work: Q3126398
cites work: Primality Proving with Elliptic Curves
cites work: Is ZF a hack? Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
cites work: A Fascinating Country in the World of Computing
cites work: Newman's Short Proof of the Prime Number Theorem
DOI: 10.1007/S10817-009-9145-6
DBLP publication ID: journals/jar/Harrison09
description: scientific article