What can be done with PRA?

DOI10.1007/BF01693981zbMath0449.03055OpenAlexW2094469821MaRDI QIDQ1147134

Grigori Mints

Publication date: 1980

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01693981

zbMATH Keywords

primitive recursive arithmeticsecond-order arithmeticKönig's lemmacontinuity of effective operatorsprime distribution law

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Cut-elimination and normal-form theorems (03F05) Second- and higher-order arithmetic and fragments (03F35) Connections of number theory and logic (11U99)

Related Items (1)

The prime number theorem is PRA-provable

Cites Work

• Mathematical significance of consistency proofs
• On the Interpretation of Non-Finitist Proofs--Part I
• Unnamed Item
• Unnamed Item

This page was built for publication: What can be done with PRA?