On Goodman realizability
Emanuele Frittaion
CMAFCIO, Universidade de Lisboa
Abstract: Goodman's theorem (after Nicholas D. Goodman) asserts that adding the axiom of choice to intuitionistic arithmetic in all finite types yields a system which is conservative over Heyting arithmetic. This is in contrast with classical arithmetic in all finite types. In fact, the combination of choice with classical logic results in a system as strong as full second-order arithmetic.