3 problems

Let an OTM be an ordinal Turing machine, and let a gap-starting ordinal be an ordinal at which an interval of ordinals contains no OTM-clockable ordinals. The paper considers wheth…

Let $V$ denote the universe of sets, and let $F:V\rightarrow\{0,1\}$ be OTM-computable, meaning computable by an ordinal Turing machine. For $i\in\{0,1\}$, write $F^{-1}[i]$ for th…

Assume that $V=L$. A forcing notion $mathbb{P}$ is said to add an OTM-parameter-recognizable set if, in a forcing extension, it adds a set recognizable by an ordinal Turing machin…