Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.

We introduce the framework of AECats (abstract elementary categories), generalizing both the category of models of some first-order theory and the category of subsets of models. Any AEC and any compact abstract theory (“cat”, as introduced by Ben-Yaacov) forms an AECat. In particular, we find applications in positive logic and continuous logic: the category of (subsets of) models of a positive or continuous theory is an AECat. The Kim–Pillay theorem for first-order logic characterizes simple theories by the properties dividing independence has. We prove a version of the Kim–Pillay theorem for AECats with the amalgamation property, generalizing the first-order version and existing versions for positive logic.

We determine the consistency strength of determinacy for projective games of length ω2. Our main theorem is that $\Pi _{n + 1}^1 $-determinacy for games of length ω2 implies the existence of a model of set theory with ω + n Woodin cardinals. In a first step, we show that this hypothesis implies that there is a countable set of reals A such that Mn (A), the canonical inner model for n Woodin cardinals constructed over A, satisfies $$A = R$$ and the Axiom of Determinacy. Then we argue how to obtain a model with ω + n Woodin cardinal from this.

We also show how the proof can be adapted to investigate the consistency strength of determinacy for games of length ω2 with payoff in $^R R\Pi _1^1 $ or with σ-projective payoff.

A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality is a strengthening of stability. We show the equationality of the theory of proper extensions of algebraically closed fields and of the theory of separably closed fields of arbitrary imperfection degree.

We provide a finite basis for the class of Borel functions that are not in the first Baire class, as well as the class of Borel functions that are not $\sigma $ -continuous with closed witnesses.

It is known that there exists a first-order sentence that holds in a finite group if and only if the group is soluble. Here it is shown that the corresponding statements with ‘solubility’ replaced by ‘nilpotence’ and ‘perfectness’, among others, are false.

These facts present difficulties for the study of pseudofinite groups. However, a very weak form of Frattini’s theorem on the nilpotence of the Frattini subgroup of a finite group is proved for pseudofinite groups.

Let ${\cal T}$ be any of the three canonical truth theories CT− (compositional truth without extra induction), FS− (Friedman–Sheard truth without extra induction), or KF− (Kripke–Feferman truth without extra induction), where the base theory of ${\cal T}$ is PA (Peano arithmetic). We establish the following theorem, which implies that ${\cal T}$ has no more than polynomial speed-up over PA.

Theorem.${\cal T}$is feasibly reducible to PA, in the sense that there is a polynomial time computable function f such that for every${\cal T}$-proof π of an arithmetical sentence ϕ, f (π) is a PA-proof of ϕ.

In this note, we construct a distal expansion for the structure $$\left( {; + , < ,H} \right)$$, where $H \subseteq $ is a dense $Q$-vector space basis of $R$ (a so-called Hamel basis). Our construction is also an expansion of the dense pair $\left( {; + , < ,} \right)$ and has full quantifier elimination in a natural language.

In set theory without the Axiom of Choice, we consider Ingleton’s axiom which is the ultrametric counterpart of the Hahn–Banach axiom. We show that in ZFA, i.e., in the set theory without the Axiom of Choice weakened to allow “atoms,” Ingleton’s axiom does not imply the Axiom of Choice (this solves in ZFA a question raised by van Rooij, [27]). We also prove that in ZFA, the “multiple choice” axiom implies the Krein–Milman axiom. We deduce that, in ZFA, the conjunction of the Hahn–Banach, Ingleton and Krein–Milman axioms does not imply the Axiom of Choice.

Duparc introduced a two-player game for a function f between zero-dimensional Polish spaces in which Player II has a winning strategy iff f is of Baire class 1. We generalize this result by defining a game for an arbitrary function f : X → Y between arbitrary Polish spaces such that Player II has a winning strategy in this game iff f is of Baire class 1. Using the strategy of Player II, we reprove a result concerning first return recoverable functions.

In the first part of the article, we show that if $\omega \le \kappa < \lambda$ are cardinals, ${\kappa ^{ < \kappa }} = \kappa$, and λ is weakly compact, then in $V\left[M {\left( {\kappa ,\lambda } \right)} \right]$ the tree property at $$\lambda = \left( {\kappa ^{ + + } } \right)^{V\left[ {\left( {\kappa ,\lambda } \right)} \right]} $$ is indestructible under all ${\kappa ^ + }$-cc forcing notions which live in $V\left[ {{\rm{Add}}\left( {\kappa ,\lambda } \right)} \right]$, where ${\rm{Add}}\left( {\kappa ,\lambda } \right)$ is the Cohen forcing for adding λ-many subsets of κ and $\left( {\kappa ,\lambda } \right)$ is the standard Mitchell forcing for obtaining the tree property at $\lambda = \left( {\kappa ^{ + + } } \right)^{V\left[ {\left( {\kappa ,\lambda } \right)} \right]} $. This result has direct applications to Prikry-type forcing notions and generalized cardinal invariants. In the second part, we assume that λ is supercompact and generalize the construction and obtain a model ${V^{\rm{*}}}$, a generic extension of V, in which the tree property at ${\left( {{\kappa ^{ + + }}} \right)^{{V^{\rm{*}}}}}$ is indestructible under all ${\kappa ^ + }$-cc forcing notions living in $V\left[ {{\rm{Add}}\left( {\kappa ,\lambda } \right)} \right]$, and in addition under all forcing notions living in ${V^{\rm{*}}}$ which are ${\kappa ^ + }$-closed and “liftable” in a prescribed sense (such as ${\kappa ^{ + + }}$-directed closed forcings or well-met forcings which are ${\kappa ^{ + + }}$-closed with the greatest lower bounds).

We prove that the continuous function${\rm{\hat \Omega }}:2^\omega \to $ that is defined via$X \mapsto \mathop \sum \limits_n 2^{ - K\left( {Xn} \right)} $ for all $X \in {2^\omega }$ is differentiable exactly at the Martin-Löf random reals with the derivative having value 0; that it is nowhere monotonic; and that $\mathop \smallint \nolimits _0^1{\rm{\hat{\Omega }}}\left( X \right)\,{\rm{d}}X$ is a left-c.e. $wtt$-complete real having effective Hausdorff dimension ${1 / 2}$.

We further investigate the algorithmic properties of ${\rm{\hat{\Omega }}}$. For example, we show that the maximal value of ${\rm{\hat{\Omega }}}$ must be random, the minimal value must be Turing complete, and that ${\rm{\hat{\Omega }}}\left( X \right) \oplus X{ \ge _T}\emptyset \prime$ for every X. We also obtain some machine-dependent results, including that for every $\varepsilon > 0$, there is a universal machine V such that ${{\rm{\hat{\Omega }}}_V}$ maps every real X having effective Hausdorff dimension greater than ε to a real of effective Hausdorff dimension 0 with the property that $X{ \le _{tt}}{{\rm{\hat{\Omega }}}_V}\left( X \right)$; and that there is a real X and a universal machine V such that ${{\rm{\Omega }}_V}\left( X \right)$ is rational.

We show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal α there exists an ordinal β such that $1 + \beta \cdot \left( {\beta + \alpha } \right)$ (ordinal arithmetic) admits an almost order preserving collapse into β. Arithmetical comprehension is equivalent to a statement of the same form, with $\beta \cdot \alpha$ at the place of $\beta \cdot \left( {\beta + \alpha } \right)$. We will also characterize the principles that any set is contained in a countable coded ω-model of arithmetical transfinite recursion and arithmetical comprehension, respectively.

We show that there is a minimal pair in the nonuniform generic degrees, and hence also in the uniform generic degrees. This fact contrasts with Igusa’s result that there are no minimal pairs for relative generic computability and answers a basic structural question mentioned in several papers in the area.