2 citations · 2 across the 3 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2017
Finitistic Properties of High Complexity
Dmytro Taranovsky
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, w…
math.LO2006★ 2 cited
Constructive Mathematical Truth
Dmytro Taranovsky
We define constructive truth for arithmetic and for intuitionistic analysis, and investigate its properties. We also prove that the set of constructively true (first order) arithme…