The prime number theorem is PRA-provable

DOI10.1016/S0304-3975(00)00116-XzbMath0974.03048WikidataQ55967658 ScholiaQ55967658MaRDI QIDQ5941260

O. Sudac

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

analytical number theoryprimitive recursive arithmeticrecursive analysis

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Cites Work

• What can be done with PRA?
• Two Applications of Logic to Mathematics
• Computability in Analysis and Physics
• Analysis in the Computable Number Field
• Definability and decision problems in arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The prime number theorem is PRA-provable