We prove from the existence of a Mahlo cardinal the consistency of the statement that 2ω = ω3 holds and every stationary subset of ${\omega _2}\mathop \cap \nolimits {\rm{cof}}\left( \omega \right)$ reflects to an ordinal less than ω2 with cofinality ω1.

We show that for each computable ordinal $\alpha > 0$ it is possible to find in each Martin-Löf random ${\rm{\Delta }}_2^0 $ degree a sequence R of Cantor-Bendixson rank α, while ensuring that the sequences that inductively witness R’s rank are all Martin-Löf random with respect to a single countably supported and computable measure. This is a strengthening for random degrees of a recent result of Downey, Wu, and Yang, and can be understood as a randomized version of it.

For the Heyting Arithmetic HA, $HA^{\text{*}} $ is defined [14, 15] as the theory $\left\{ {A|HA \vdash A^\square } \right\}$, where $A^\square $ is called the box translation of A (Definition 2.4). We characterize the ${\text{\Sigma }}_1 $-provability logic of $HA^{\text{*}} $ as a modal theory $iH_\sigma ^{\text{*}} $ (Definition 3.17).

Using a nonLaver modification of Uri Abraham’s minimal $\Delta _3^1$ collapse function, we define a generic extension $L[a]$ by a real a, in which, for a given $n \ge 3$, $\left\{ a \right\}$ is a lightface $\Pi _n^1 $ singleton, a effectively codes a cofinal map $\omega \to \omega _1^L $ minimal over L, while every $\Sigma _n^1 $ set $X \subseteq \omega $ is still constructible.

The variety of Brouwerian semilattices is amalgamable and locally finite; hence, by well-known results [19], it has a model completion (whose models are the existentially closed structures). In this article, we supply a finite and rather simple axiomatization of the model completion.

In Team Semantics, a dependency notion is strongly first order if every sentence of the logic obtained by adding the corresponding atoms to First-Order Logic is equivalent to some first-order sentence. In this work it is shown that all nontrivial dependency atoms that are strongly first order, downwards closed, and relativizable (in the sense that the relativizations of the corresponding atoms with respect to some unary predicate are expressible in terms of them) are definable in terms of constancy atoms.

Additionally, it is shown that any strongly first-order dependency is safe for any family of downwards closed dependencies, in the sense that every sentence of the logic obtained by adding to First-Order Logic both the strongly first-order dependency and the downwards closed dependencies is equivalent to some sentence of the logic obtained by adding only the downwards closed dependencies.

We prove that infinite definably simple locally finite groups of finite centraliser dimension are simple groups of Lie type over locally finite fields. Then, we identify conditions on automorphisms of a stable group that make it resemble the Frobenius maps, and allow us to classify definably simple stable groups in the specific case when they admit such automorphisms.

It is proved that there is a formula $\pi \left( {h,x} \right)$ in the first-order language of group theory such that each component and each non-abelian minimal normal subgroup of a finite group G is definable by $\pi \left( {h,x} \right)$ for a suitable element h of G; in other words, each such subgroup has the form $\left\{ {x|x\pi \left( {h,x} \right)} \right\}$ for some h. A number of consequences for infinite models of the theory of finite groups are described.

We will show it is consistent with GCH that there is a minimal non-σ-scattered linear order which does not contain any real or Aronszajn type. In particular the assumption PFA+ in the main result of [5] is necessary, and there are other obstructions than real and Aronszajn types to the sharpness of Laver’s theorem in [8].

In this article, we prove that if a countable non-${\aleph _0}$-categorical NSOP1 theory with nonforking existence has finitely many countable models, then there is a finite tuple whose own preweight is ω. This result is an extension of a theorem of the author on any supersimple theory.

Woodin and Vopěnka cardinals are established notions in the large cardinal hierarchy and it is known that Vopěnka cardinals are the Woodin analogue for supercompactness. Here we give the definition of Woodin for strong compactness cardinals, the Woodinised version of strong compactness, and we prove an analogue of Magidor’s identity crisis theorem for the first strongly compact cardinal.

$ISP$ cannot hold at the first or second successor of a singular strong limit of countable cofinality; on the other hand, we force a failure of “strong ${\rm{SCH}}$” across a cardinal where $ITP$ holds. We also show that $ITP$ does not imply that there are stationary many internally unbounded models.

In this article, we study an analogue of tt-reducibility for points in computable metric spaces. We characterize the notion of the metric tt-degree in the context of first-level Borel isomorphism. Then, we study this concept from the perspectives of effective topological dimension theory and of effective fractal dimension theory.

We study the notion of tightly stationary sets which was introduced by Foreman and Magidor in [8]. We obtain two consistency results showing that certain sequences of regular cardinals ${\langle {\kappa _n}\rangle _{n < \omega }}$ can have the property that in some generic extension, every ground-model sequence of fixed-cofinality stationary sets ${S_n} \subseteq {\kappa _n}$ is tightly stationary. The results are obtained using variations of the short-extenders forcing method.

We consider maximal almost disjoint families of block subspaces of countable vector spaces, focusing on questions of their size and definability. We prove that the minimum infinite cardinality of such a family cannot be decided in ZFC and that the “spectrum” of cardinalities of mad families of subspaces can be made arbitrarily large, in analogy to results for mad families on ω. We apply the author’s local Ramsey theory for vector spaces [32] to give partial results concerning their definability.

A union ultrafilter is an ultrafilter over the finite subsets of ω that has a base of sets of the form ${\text{FU}}\left( X \right)$, where X is an infinite pairwise disjoint family and ${\text{FU}}(X) = \left\{ {\bigcup {F|F} \in [X]^{ < \omega } \setminus \{ \emptyset \} } \right\}$. The existence of these ultrafilters is not provable from the $ZFC$ axioms, but is known to follow from the assumption that ${\text{cov}}\left( \mathcal{M} \right) = \mathfrak{c}$. In this article we obtain various models of $ZFC$ that satisfy the existence of union ultrafilters while at the same time ${\text{cov}}\left( \mathcal{M} \right) = \mathfrak{c}$.

We obtain an equivalent implicit characterization of Lp Banach spaces that is amenable to a logical treatment. Using that, we obtain an axiomatization for such spaces into a higher order logical system, the kind of which is used in proof mining, a research program that aims to obtain the hidden computational content of mathematical proofs using tools from mathematical logic. As an aside, we obtain a concrete way of formalizing Lp spaces in positive-bounded logic. The axiomatization is followed by a corresponding metatheorem in the style of proof mining. We illustrate its use with the derivation for this class of spaces of the standard modulus of uniform convexity.

We study the first-order theory of polynomial rings over a GCD domain and of the ring of formal entire functions over a non-Archimedean field in the language $\{ 1, + , \bot \}$. We show that these structures interpret the first-order theory of the semi-ring of natural numbers. Moreover, this interpretation depends only on the characteristic of the original ring, and thus we obtain uniform undecidability results for these polynomial and entire functions rings of a fixed characteristic. This work enhances results of Raphael Robinson on essential undecidability of some polynomial or formal power series rings in languages that contain no symbols related to the polynomial or power series ring structure itself.

In this paper, we study finitely axiomatizable conservative extensions of a theory U in the case where U is recursively enumerable and not finitely axiomatizable. Stanisław Krajewski posed the question whether there are minimal conservative extensions of this sort. We answer this question negatively.

Consider a finite expansion of the signature of U that contains at least one predicate symbol of arity ≥ 2. We show that, for any finite extension α of U in the expanded language that is conservative over U, there is a conservative extension β of U in the expanded language, such that $\alpha \vdash \beta$ and $\beta \not \vdash \alpha$. The result is preserved when we consider either extensions or model-conservative extensions of U instead of conservative extensions. Moreover, the result is preserved when we replace $\dashv$ as ordering on the finitely axiomatized extensions in the expanded language by a relevant kind of interpretability, to wit interpretability that identically translates the symbols of the U-language.

We show that the result fails when we consider an expansion with only unary predicate symbols for conservative extensions of U ordered by interpretability that preserves the symbols of U.

We study the theory Tm,n of existentially closed incidence structures omitting the complete incidence structure Km,n, which can also be viewed as existentially closed Km,n-free bipartite graphs. In the case m = n = 2, this is the theory of existentially closed projective planes. We give an $\forall \exists$-axiomatization of Tm,n, show that Tm,n does not have a countable saturated model when m, n ≥ 2, and show that the existence of a prime model for T2,2 is equivalent to a longstanding open question about finite projective planes. Finally, we analyze model theoretic notions of complexity for Tm,n. We show that Tm,n is NSOP1, but not simple when m, n ≥ 2, and we show that Tm,n has weak elimination of imaginaries but not full elimination of imaginaries. These results rely on combinatorial characterizations of various notions of independence, including algebraic independence, Kim independence, and forking independence.