Claims a realizability barrier prevents Heyting Arithmetic from uniformly extracting prime witnesses, making Goldbach-type theorems constructively unrealizable; the barrier fails because primality is decidable by bounded search.
Title resolution pending
1 Pith paper cite this work, alongside 104 external citations. Polarity classification is still indexing.
1
Pith paper citing it
104
external citations · OpenAlex
fields
math.LO 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
An Intuitionistic Glance at Primes
Claims a realizability barrier prevents Heyting Arithmetic from uniformly extracting prime witnesses, making Goldbach-type theorems constructively unrealizable; the barrier fails because primality is decidable by bounded search.