We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound on definable countable ordinals in Zermelo-Fraenkel set theory ZF.

This paper is devoted to o-minimalism, the study of the first-order properties of o-minimal structures. The main protagonists are the pseudo-o-minimal structures, that is to say, the models of the theory of all o-minimal L-structures, but we start with a more in-depth analysis of the well-known fragment DCTC (Definable Completeness/Type Completeness), and show how it already admits many of the properties of o-minimal structures: dimension theory, monotonicity, Hardy structures, and quasi-cell decomposition, provided one replaces finiteness by discreteness in all of these. Failure of cell decomposition leads to the related notion of a eukaryote structure, and we give a criterium for a pseudo-o-minimal structure to be eukaryote.

To any pseudo-o-minimal structure, we can associate its Grothendieck ring, which in the non-o-minimal case is a nontrivial invariant. To study this invariant, we identify a third o-minimalistic property, the Discrete Pigeonhole Principle, which in turn allows us to define discretely valued Euler characteristics. As an application, we study certain analytic subsets, called Taylor sets.

We give a uniform construction of free pseudospaces of dimension n extending work in [1]. This yields examples of ω-stable theories which are n-ample, but not n + 1-ample. The prime models of these theories are buildings associated to certain right-angled Coxeter groups.

Assuming ω supercompact cardinals we force to obtain a model where the tree property holds both at אω+1, and at אn for all 2 ≤ n < ω. A model with the former was obtained by Magidor–Shelah from a large cardinal assumption above a huge cardinal, and recently by Sinapova from ω supercompact cardinals. A model with the latter was obtained by Cummings–Foreman from ω supercompact cardinals. Our model, where the two hold simultaneously, is another step toward the goal of obtaining the tree property on increasingly large intervals of successor cardinals.

We give a model-theoretic account for several results regarding sequences of random variables appearing in Berkes and Rosenthal [12]. In order to do this,

• • We study and compare three notions of convergence of types in a stable theory: logic convergence, i.e., formula by formula, metric convergence (both already well studied) and convergence of canonical bases. In particular, we characterise א0-categorical stable theories in which the last two agree.

• • We characterise sequences that admit almost indiscernible sub-sequences.

• • We apply these tools to the theory of atomless random variables (ARV). We characterise types and notions of convergence of types as conditional distributions and weak/strong convergence thereof, and obtain, among other things, the Main Theorem of Berkes and Rosenthal.

Glivenko’s theorem states that an arbitrary propositional formula is classically provable if and only if its double negation is intuitionistically provable. The result does not extend to full first-order predicate logic, but does extend to first-order predicate logic without the universal quantifier. A recent paper by Zdanowski shows that Glivenko’s theorem also holds for second-order propositional logic without the universal quantifier. We prove that Glivenko’s theorem extends to some versions of simple type theory without the universal quantifier. Moreover, we prove that Kuroda’s negative translation, which is known to embed classical first-order logic into intuitionistic first-order logic, extends to the same versions of simple type theory. We also prove that the Glivenko property fails for simple type theory once a weak form of functional extensionality is included.

We study the long-standing open problem of giving $\forall {\rm{\Sigma }}_1^b$ separations for fragments of bounded arithmetic in the relativized setting. Rather than considering the usual fragments defined by the amount of induction they allow, we study Jeřábek’s theories for approximate counting and their subtheories. We show that the $\forall {\rm{\Sigma }}_1^b$ Herbrandized ordering principle is unprovable in a fragment of bounded arithmetic that includes the injective weak pigeonhole principle for polynomial time functions, and also in a fragment that includes the surjective weak pigeonhole principle for FPNP functions. We further give new propositional translations, in terms of random resolution refutations, for the consequences of $T_2^1$ augmented with the surjective weak pigeonhole principle for polynomial time functions.

We show the existence of noncomputable oracles which are low for Demuth randomness, answering a question in [15] (also Problem 5.5.19 in [34]). We fully characterize lowness for Demuth randomness using an appropriate notion of traceability. Central to this characterization is a partial relativization of Demuth randomness, which may be more natural than the fully relativized version. We also show that an oracle is low for weak Demuth randomness if and only if it is computable.

Let κ be the cardinality of some saturated model of Peano Arithmetic. There is a set of ${2^{{\aleph _0}}}$ saturated models of PA, each having cardinality κ, such that whenever M and N are two distinct models from this set, then Aut(${\cal M}$) ≇ Aut ($${\cal N}$$).

In the first part we show a counterexample to a conjecture by Shelah regarding the existence of indiscernible sequences in dependent theories (up to the first inaccessible cardinal). In the second part we discuss generic pairs, and give an example where the pair is not dependent. Then we define the notion of directionality which deals with counting the number of coheirs of a type and we give examples of the different possibilities. Then we discuss nonsplintering, an interesting notion that appears in the work of Rami Grossberg, Andrés Villaveces and Monica VanDieren, and we show that it is not trivial (in the sense that it can be different than splitting) whenever the directionality of the theory is not small. In the appendix we study dense types in RCF.

Péter Gács showed (Gács 1974) that for everyn there exists a bit string x of lengthn whose plain complexityC(x) has almost maximal conditional complexityrelative to x, i.e., $C\left( {C\left( x \right)|x} \right) \ge {\rm{log}}n - {\rm{log}}^{\left( 2 \right)} n - O\left( 1 \right)$ (Here ${\rm{log}}^{\left( 2 \right)} i = {\rm{loglog}}i$.) Following Elena Kalinina (Kalinina 2011), we provide a simplegame-based proof of this result; modifying her argument, we get a better (andtight) bound ${\rm{log}}n - O\left( 1 \right)$ We also show the same bound for prefix-free complexity.

Robert Solovay showed (Solovay 1975) that infinitely many stringsx have maximal plain complexity but not maximal prefixcomplexity (among the strings of the same length): for some cthere exist infinitely many x such that $|x| - C\left( x \right) \le c$ and $|x| + K\left( {|x|} \right) - K\left( x \right) \ge {\rm{log}}^{\left( 2 \right)} |x| - c{\rm{log}}^{\left( 3 \right)} |x|$ In fact, the results of Solovay and Gács are closelyrelated. Using the result above, we provide a short proof forSolovay’s result. We also generalize it by showing that for somec and for all n there are stringsx of length n with $n - C\left( x \right) \le c$ and $n + K\left( n \right) - K\left( x \right) \ge K\left( {K\left( n \right)|n} \right) - 3K\left( {K\left( {K\left( n \right)|n} \right)|n} \right) - c.$ We also prove a close upper bound $K\left( {K\left( n \right)|n} \right) + O\left( 1 \right)$

Finally, we provide a direct game proof for Joseph Miller’sgeneralization (Miller 2006) of the same Solovay’s theorem: if aco-enumerable set (a set with c.e. complement) contains for every length astring of this length, then it contains infinitely many stringsx such that$|x| + K\left( {|x|} \right) - K\left( x \right) \ge {\rm{log}}^{\left( 2 \right)} |x| - O\left( {{\rm{log}}^{\left( 3 \right)} |x|} \right).$

We show that no nontrivial principal ideal of the enumeration degrees is linearly ordered: in fact, below every nonzero enumeration degree one can embed every countable partial order. The result can be relativized above any total degree: if a,b are enumeration degrees, with a total, and a < b, then in the degree interval (a,b), one can embed every countable partial order.

Following the topic of the book Canonical Ramsey Theory on Polish Spaces by V. Kanovei, M. Sabok, and J. Zapletal we study Borel equivalences on Laver trees. We prove that equivalence relations Borel reducible to an equivalence relation on 2ω given by some FσP-ideal on ω can be canonized to the full equivalence relation or to the identity relation.

This has several consequences, e.g., Silver type dichotomy for the Laver ideal and equivalences Borel reducible to equivalence relations given by FσP-ideals.