Showing math.LOShow all
2 papers · 1 filter
math.LO2016
The strength of countable saturation
B. van den Berg, E. M. Briseid, P. Safarik
We determine the proof-theoretic strength of the principle of countable saturation in the context of the systems for nonstandard arithmetic introduced in our earlier work.
math.LO2011
A functional interpretation for nonstandard arithmetic
Benno van den Berg, Eyvind Briseid, Pavol Safarik
We introduce constructive and classical systems for nonstandard arithmetic and show how variants of the functional interpretations due to Goedel and Shoenfield can be used to rewri…