Related papers: Recognizable sets and Woodin cardinals: Computatio…
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…
We introduce a model of infinitary computation which enhances the infinite time Turing machine model slightly but in a natural way by giving the machines the capability of detecting cardinal stages of computation. The computational strength…
Infinite time Turing machine models with tape length $\alpha$, denoted $T_\alpha$, strengthen the machines of Hamkins and Kidder [HL00] with tape length $\omega$. A new phenomenon is that for some countable ordinals $\alpha$, some cells…
Definable stationary sets, and specifically, ordinal definable ones, play a significant role in the study of canonical inner models of set theory and the class HOD of hereditarily ordinal definable sets. Fixing a certain notion of…
Given an uncountable cardinal $\kappa$, we consider the question of whether subsets of the power set of $\kappa$ that are usually constructed with the help of the Axiom of Choice are definable by $\Sigma_1$-formulas that only use the…
We introduce a notion of realizability with ordinal Turing machines based on recognizability rather than computability, i.e., the ability to uniquely identify an object. We show that the arising concept of $r$-realizabilty has the property…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
We study $\Sigma_1(\omega_1)$-definable sets (i.e. sets that are equal to the collection of all sets satisfying a certain $\Sigma_1$-formula with parameter $\omega_1$) in the presence of large cardinals. Our results show that the existence…
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the…
Exploring further the properties of ITRM-recognizable reals, we provide a detailed analysis of recognizable reals and their distribution in G\"odels constructible universe L. In particular, we show that, for unresetting infinite time…
We extend Solovay's theorem about definable subsets of the Baire space to the generalized Baire space ${}^\lambda\lambda$, where $\lambda$ is an uncountable cardinal with $\lambda^{<\lambda}=\lambda$. In the first main theorem, we show that…
We study connections between definability in generalized descriptive set theory and large cardinals, under ZFC. We show that if $\kappa$ is a limit of measurables then there is no wellorder of a subset of $P(\kappa)$ of length…
For exponentially closed ordinals $\alpha$, we consider recognizability of constructible subsets of $\alpha$ for $\alpha$-(w)ITRMs and their distribution in the constructible hierarchy. In particular, for $\alpha$-ITRMs, we show that, there…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
We analyze the hereditarily ordinal definable sets $\operatorname{HOD}$ in $M_n(x)[g]$ for a Turing cone of reals $x$, where $M_n(x)$ is the canonical inner model with $n$ Woodin cardinals build over $x$ and $g$ is generic over $M_n(x)$ for…
Infinite time Turing machines with only one tape are in many respects fully as powerful as their multi-tape cousins. In particular, the two models of machine give rise to the same class of decidable sets, the same degree structure and, at…
This paper analyzes infinitary nondeterministic computability theory. The main result is D $\ne$ ND $\cap$ coND where D is the class of sets decidable by infinite time Turing machines and ND is the class of sets recognizable by a…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
We study clockability for Ordinal Turing Machines (OTMs). In particular, we show that, in contrast to the situation for ITTMs, admissible ordinals can be OTM-clockable, that $\Sigma_{2}$-admissible ordinals are never OTM-clockable and that…
We study partition properties for uncountable regular cardinals that arise by restricting partition properties defining large cardinal notions to classes of simply definable colourings. We show that both large cardinal assumptions and…