2017/07/18 by Taranovsky, Dmytro
#03D35 (primary) #03E60 (secondary) #FOS: Mathematics #Logic (math.LO)
paper · doi:10.48550/arxiv.1707.05772
We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order arithmetical truth and beyond. Since the predicates are interpreted using properties of certain natural finite structures, they are arguably finitistic.