2 citations · 4 across the 10 of their papers we have counts for
Showing 2016 · math.LOShow all
3 papers · 2 filters
math.LO2016
Arithmetic with Limited Exponentiation
Dmytro Taranovsky
We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic (and henc…
math.LO2016
Determinacy and Fast-growing Sequences of Turing Degrees
Dmytro Taranovsky
We discuss sufficiently fast-growing sequences of Turing degrees. The key result is that, assuming sufficient determinacy, if is a formula with one free variable, and S and T a…
math.LO2016
Ordinal Notation
Dmytro Taranovsky
We introduce a framework for ordinal notation systems, present a family of strong yet simple systems, and give many examples of ordinals in these systems. While much of the materia…