Positional graphs and conditional structure of weakly null sequences

We prove that, unless assuming additional set theoretical axioms, there are no reflexive spaces without unconditional sequences of the density continuum. We show that for every integer n$n$ there are normalized weakly-null sequences of length _ωn${\omega }_n$ without unconditional subsequences. This together with a result of Dodos et al. (2011) [7] shows that _ωω${\omega }_{\omega }$ is the minimal cardinal κ$\kappa$ that could possibly have the property that every weakly null κ$\kappa$-sequence has an infinite unconditional basic subsequence. We also prove that for every cardinal number κ$\kappa$ which is smaller than the first ω$\omega$-Erd?s cardinal there is a normalized weakly-null sequence without subsymmetric subsequences. Finally, we prove that mixed Tsirelson spaces of uncountable densities must always contain isomorphic copies of either _c0$c_0$ or _?p${?}_p$, with p≥1$p\ge 1$.     

Consistency,optimality, and incompleteness

Assume that the problem _P0$P_0$ is not solvable in polynomial time. Let T   be a first-order theory containing a sufficiently rich part of true arithmetic. We characterize T∪{_ConT}$T\cup \{{\mathit{Con}}_T\}$ as the minimal extension of T   proving for some algorithm that it decides _P0$P_0$ as fast as any algorithm B$\mathbb{B}$ with the property that T   proves that B$\mathbb{B}$ decides _P0$P_0$. Here, _ConT${\mathit{Con}}_T$ claims the consistency of T. As a byproduct, we obtain a version of Gödel?s Second Incompleteness Theorem. Moreover, we characterize problems with an optimal algorithm in terms of arithmetical theories.     

The distribution of ITRM-recognizable reals

Infinite Time Register Machines (ITRM's) are a well-established machine model for infinitary computations. Their computational strength relative to oracles is understood, see e.g. ,  and . We consider the notion of recognizability, which was first formulated for Infinite Time Turing Machines in [6] and applied to ITRM's in [3]. A real x is ITRM-recognizable iff there is an ITRM-program P   such that P^y$P^y$ stops with output 1 iff y=x$y=x$, and otherwise stops with output 0. In [3], it is shown that the recognizable reals are not contained in the ITRM-computable reals. Here, we investigate in detail how the ITRM  -recognizable reals are distributed along the canonical well-ordering _<L${<}_L$ of Gödel's constructible hierarchy L  . In particular, we prove that the recognizable reals have gaps in _<L${<}_L$, that there is no universal ITRM in terms of recognizability and consider a relativized notion of recognizability.     

A model of Cummings and Foreman revisited

This paper concerns the model of Cummings and Foreman where from ω   supercompact cardinals they obtain the tree property at each _ℵn${\mathrm{\aleph }}_n$ for 2≤n<ω$2\le n<\omega$. We prove some structural facts about this model. We show that the combinatorics at _ℵω+1${\mathrm{\aleph }}_{\omega +1}$ in this model depend strongly on the properties of _ω1${\omega }_1$ in the ground model. From different ground models for the Cummings–Foreman iteration we can obtain either _ℵω+1∈I[_ℵω+1]${\mathrm{\aleph }}_{\omega +1}\in I[{\mathrm{\aleph }}_{\omega +1}]$ and every stationary subset of _ℵω+1${\mathrm{\aleph }}_{\omega +1}$ reflects or there are a bad scale at _ℵω${\mathrm{\aleph }}_{\omega }$ and a non-reflecting stationary subset of _ℵω+1∩cof(_ω1)${\mathrm{\aleph }}_{\omega +1}\cap \mathrm{cof}({\omega }_1)$. We also prove that regardless of the ground model a strong generalization of the tree property holds at each _ℵn${\mathrm{\aleph }}_n$ for n≥2$n\ge 2$.