We introduce a generalization of sequential compactness using barriers on $\omega $ extending naturally the notion introduced in [W. Kubiś and P. Szeptycki, On a topological Ramsey theorem, Canad. Math. Bull., 66 (2023), 156–165]. We improve results from [C. Corral and O. Guzmán and C. López-Callejas, High dimensional sequential compactness, Fund. Math.] by building spaces that are ${\mathcal {B}}$-sequentially compact but not ${\mathcal {C}}$-sequentially compact when the barriers ${\mathcal {B}}$ and ${\mathcal {C}}$ satisfy certain rank assumption which turns out to be equivalent to a Katětov-order assumption. Such examples are constructed under the assumption ${\mathfrak {b}} ={\mathfrak {c}}$. We also exhibit some classes of spaces that are ${\mathcal {B}}$-sequentially compact for every barrier ${\mathcal {B}}$, including some classical classes of compact spaces from functional analysis, and as a byproduct, we obtain some results on angelic spaces. Finally, we introduce and compute some cardinal invariants naturally associated to barriers.

Let $\mathrm {R}$ be a real closed field. Given a closed and bounded semialgebraic set $A \subset \mathrm {R}^n$ and semialgebraic continuous functions $f,g:A \rightarrow \mathrm {R}$ such that $f^{-1}(0) \subset g^{-1}(0)$, there exist an integer $N> 0$ and $c \in \mathrm {R}$ such that the inequality (Łojasiewicz inequality) $|g(x)|^N \le c \cdot |f(x)|$ holds for all $x \in A$. In this paper, we consider the case when A is defined by a quantifier-free formula with atoms of the form $P = 0, P>0, P \in \mathcal {P}$ for some finite subset of polynomials $\mathcal {P} \subset \mathrm {R}[X_1,\ldots ,X_n]_{\leq d}$, and the graphs of $f,g$ are also defined by quantifier-free formulas with atoms of the form $Q = 0, Q>0, Q \in \mathcal {Q}$, for some finite set $\mathcal {Q} \subset \mathrm {R}[X_1,\ldots ,X_n,Y]_{\leq d}$. We prove that the Łojasiewicz exponent in this case is bounded by $(8 d)^{2(n+7)}$. Our bound depends on d and n but is independent of the combinatorial parameters, namely the cardinalities of $\mathcal {P}$ and $\mathcal {Q}$. The previous best-known upper bound in this generality appeared in P. Solernó, Effective Łojasiewicz Inequalities in Semi-Algebraic Geometry, Applicable Algebra in Engineering, Communication and Computing (1991) and depended on the sum of degrees of the polynomials defining $A,f,g$ and thus implicitly on the cardinalities of $\mathcal {P}$ and $\mathcal {Q}$. As a consequence, we improve the current best error bounds for polynomial systems under some conditions. Finally, we prove a version of Łojasiewicz inequality in polynomially bounded o-minimal structures. We prove the existence of a common upper bound on the Łojasiewicz exponent for certain combinatorially defined infinite (but not necessarily definable) families of pairs of functions. This improves a prior result of Chris Miller (C. Miller, Expansions of the real field with power functions, Ann. Pure Appl. Logic (1994)).

We study generic properties of topological groups in the sense of Baire category.

First, we investigate countably infinite groups. We extend a classical result of B. H. Neumann, H. Simmons and A. Macintyre on algebraically closed groups and the word problem. Recently, I. Goldbring, S. Kunnawalkam Elayavalli, and Y. Lodha proved that every isomorphism class is meager among countably infinite groups. In contrast, it follows from the work of W. Hodges on model-theoretic forcing that there exists a comeager isomorphism class among countably infinite abelian groups. We present a new elementary proof of this result.

Then, we turn to compact metrizable abelian groups. We use Pontryagin duality to show that there is a comeager isomorphism class among compact metrizable abelian groups. We discuss its connections to the countably infinite case.

Finally, we study compact metrizable groups. We prove that the generic compact metrizable group is neither connected nor totally disconnected; also it is neither torsion-free nor a torsion group.

We give a short proof of a theorem of Beleznay asserting that the set $L2$ of reals coding linear orders of the form $I + I$ is complete analytic.

The thesis uses various approaches to explore the algorithmic complexity of families of subsets of natural numbers. One of these approaches involves investigating upper semilattices of computable numberings of a given family and their complexity in different hierarchies. These semilattices, known as Rogers semilattices, can help distinguish different structural properties of families of partial computable functions and computably enumerable sets. As a result, by using Rogers semilattices of computable numberings, we can measure the algorithmic complexity of the corresponding family.

In the first part of thesis, we focus on limitwise monotonic numberings for families of limitwise monotonic sets and define their Rogers semilattices. The chapter investigates global invariants that show differences in the algebraic and elementary properties of the Rogers semilattices of families of sets from arithmetical hierarchy and Rogers semilattices of limitwise monotonic numberings. Such invariants include cardinality, laticeness, and types of isomorphism.

Within the second part of thesis, we explore the different forms of isomorphism exhibited by Rogers semilattices of families of sets in the analytical hierarchy. Additionally, we take into account various set-theoretic assumptions. Our research demonstrates that, when set-theoretic assumption known as Projective Determinacy is assumed, there exist an infinite number of non-isomorphic Rogers semilattices at each $\Sigma _n^1$-level of the analytical hierarchy.

I would also like to acknowledge the Grant of Science Committee of the Ministry of Science and Higher Education of the Republic of Kazakhstan (AP19676989) and the Nazarbayev University Faculty Development Grant (N021220FD3851) for funding this research.

Abstract prepared by Zhansaya Tleuliyeva

zhansaya.tleuliyeva@nu.edu.kz.

URL: http://nur.nu.edu.kz/handle/123456789/7769.

We start by showing how to approximate unitary and bounded self-adjoint operators by operators in finite dimensional spaces. Using ultraproducts we give a precise meaning for the approximation. In this process we see how the spectral measure is obtained as an ultralimit of counting measures that arise naturally from the finite dimensional approximations. Then we see how generalized distributions can be interpreted in the ultraproduct. Finally we study how one can calculate kernels of operators K by calculating them in the finite dimensional approximations and how one needs to interpret Dirac deltas in the ultraproduct in order to get the kernels as propagators $\langle x_{1}|K|x_{0}\rangle $.

Much of the theory of large cardinals beyond a measurable cardinal concerns the structure of elementary embeddings of the universe of sets into inner models. This paper seeks to answer the question of whether the inner model uniquely determines the elementary embedding.

We answer a question of Woodin [3] by showing that “$\mathrm {NS}_{\omega _1}$ is $\omega _1$-dense” holds in a stationary set preserving extension of any universe with a cardinal $\kappa $ which is a limit of ${<}\kappa $-supercompact cardinals. We introduce a new forcing axiom $\mathrm {Q}$-Maximum, prove it consistent from a supercompact limit of supercompact cardinals, and show that it implies the version of Woodin’s $(*)$-axiom for $\mathbb Q_{\mathrm {max}}$. It follows that $\mathrm {Q}$-Maximum implies “$\mathrm {NS}_{\omega _1}$ is $\omega _1$-dense.” Along the way we produce a number of other new instances of Asperó–Schindler’s $\mathrm {MM}^{++}\Rightarrow (*)$ (see [1]).

To force $\mathrm {Q}$-Maximum, we develop a method which allows for iterating $\omega _1$-preserving forcings which may destroy stationary sets, without collapsing $\omega _1$. We isolate a new regularity property for $\omega _1$-preserving forcings called respectfulness which lies at the heart of the resulting iteration theorem.

In the second part, we show that the $\kappa $-mantle, i.e., the intersection of all grounds which extend to V via forcing of size ${<}\kappa $, may fail to be a model of $\mathrm {AC}$ for various types of $\kappa $. Most importantly, it can be arranged that $\kappa $ is a Mahlo cardinal. This answers a question of Usuba [2].

Abstract prepared by Andreas Lietz

E-mail: andreas.lietz@tuwien.ac.at.

URL: https://andreas-lietz.github.io/resources/PDFs/AJourneyGuidedByThe Stars.pdf.

Traditionally, the role of general topology in model theory has been mainly limited to the study of compacta that arise in first-order logic. In this context, the topology tends to be so trivial that it turns into combinatorics, motivating a widespread approach that focuses on the combinatorial component while usually hiding the topological one. This popular combinatorial approach to model theory has proved to be so useful that it has become rare to see more advanced topology in model-theoretic articles. Prof. Franklin D. Tall has led the re-introduction of general topology as a valuable tool to push the boundaries of model theory. Most of this thesis is directly influenced by and builds on this idea.

The first part of the thesis will answer a problem of T. Gowers on the undefinability of pathological Banach spaces such as Tsirelson space. The topological content of this chapter is centred around Grothendieck spaces.

In a similar spirit, the second part will show a new connection between the notion of metastability introduced by T. Tao and the topological concept of pseudocompactness. We shall make use of this connection to show a result of X. Caicedo, E. Dueñez, J. Iovino in a much simplified manner.

The third part of the thesis will carry a higher set-theoretic content as we shall use forcing and descriptive set theory to show that the well-known theorem of M. Morley on the trichotomy concerning the number of models of a first-order countable theory is undecidable if one considers second-order countable theories instead.

The only part that did not originate from model-theoretic questions will be the fourth one. We show that $\operatorname {ZF} + \operatorname {DC} +$“all Turing invariant sets of reals have the perfect set property” implies that all sets of reals have the perfect set property. We also show that this result generalizes to all countable analytic equivalence relations. This result provides evidence in favour of a long-standing conjecture asking whether Turing determinacy implies the axiom of determinacy.

Abstract prepared by Clovis Hamel

E-mail: chamel@math.toronto.edu

We enrich the class of power-constructible functions, introduced in [CCRS23], to a class $\mathcal {C}^{\mathcal {M,F}}$ of algebras of functions which contains all complex powers of subanalytic functions and their parametric Mellin and Fourier transforms, and which is stable under parametric integration. By describing a set of generators of a special prepared form, we deduce information on the asymptotics and on the loci of integrability of the functions of $\mathcal {C}^{\mathcal {M,F}}$. We furthermore identify a subclass $\mathcal {C}^{\mathbb {C},\mathcal {F}}$ of $\mathcal {C}^{\mathcal {M,F}}$, which is the smallest class containing all power-constructible functions and stable under parametric Fourier transforms and right-composition with subanalytic maps. This class is also stable under parametric integration, under taking pointwise and $\text {L}^p$-limits and under parametric Fourier-Plancherel transforms. Finally, we give a full asymptotic expansion in the power-logarithmic scale, uniformly in the parameters, for functions in $\mathcal {C}^{\mathbb {C},\mathcal {F}}$.

Reverse Mathematics (RM) is a program in the foundations of mathematics where the aim is to find the minimal axioms needed to prove a given theorem of ordinary mathematics. Generally, the minimal axioms are equivalent to the theorem at hand, assuming a weak logical system called the base theory. Moreover, many theorems are either provable in the base theory or equivalent to one of four logical systems, together called the Big Five. For instance, the Weierstrass approximation theorem, i.e., that a continuous function can be approximated uniformly by a sequence of polynomials, has been classified in RM as being equivalent to weak König’s lemma, the second Big Five system. In this paper, we study approximation theorems for discontinuous functions via Bernstein polynomials from the literature. We obtain many equivalences between the latter and weak König’s lemma. We also show that slight variations of these approximation theorems fall far outside of the Big Five but fit in the recently developed RM of new ‘big’ systems, namely the uncountability of ${\mathbb R}$, the enumeration principle for countable sets, the pigeon-hole principle for measure, and the Baire category theorem.

Inspired by Adler’s idea on VC minimal theories [1], we introduce VC-minimal complexity. We show that for any $N\in \mathbb {N}^{>0}$, there is $k_N>0$ such that for any finite bipartite graph $(X,Y;E)$ with VC-minimal complexity $< N$, there exist $X'\subseteq X$, $Y'\subseteq Y$ with $|X'|\geq k_N |X|$, $|Y'|\geq k_N |Y|$ such that $X'\times Y' \subseteq E$ or $X'\times Y'\cap E=\emptyset $.

Let ${\mathbb K}$ be an algebraically bounded structure, and let T be its theory. If T is model complete, then the theory of ${\mathbb K}$ endowed with a derivation, denoted by $T^{\delta }$, has a model completion. Additionally, we prove that if the theory T is stable/NIP then the model completion of $T^{\delta }$ is also stable/NIP. Similar results hold for the theory with several derivations, either commuting or non-commuting.

We generalize Hrushovski’s group configuration theorem to the case where the type of the configuration is generically stable, without assuming tameness of the ambient theory. The properties of generically stable types, which we recall in the second section, enable us to adapt the proof known in the stable context.

In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms specifically concerning urelements. We prove that these axioms form a hierarchy over $\text {ZFCU}_{\text {R}}$ (ZFC with urelements formulated with Replacement) in terms of direct implication. The second part of the paper studies forcing over countable transitive models of $\text {ZFU}_{\text {R}}$. We propose a new definition of ${\mathbb P}$-names to address an issue with the existing approach. We then prove the fundamental theorem of forcing with urelements regarding axiom preservation. Moreover, we show that forcing can destroy and recover certain axioms within the previously established hierarchy. Finally, we demonstrate how ground model definability may fail when the ground model contains a proper class of urelements.

We characterize Borel line graphs in terms of 10 forbidden induced subgraphs, namely the nine finite graphs from the classical result of Beineke together with a 10th infinite graph associated with the equivalence relation $\mathbb {E}_0$ on the Cantor space. As a corollary, we prove a partial converse to the Feldman–Moore theorem, which allows us to characterize all locally countable Borel line graphs in terms of their Borel chromatic numbers.

We introduce and study the notion of a generalised Hecke orbit in a Shimura variety. We define a height function on such an orbit and study its properties. We obtain lower bounds for the sizes of Galois orbits of points in a generalised Hecke orbit in terms of this height function, assuming the ‘weakly adelic Mumford–Tate hypothesis’ and prove the generalised André–Pink–Zannier conjecture under this assumption, using Pila–Zannier strategy.

All spaces are assumed to be Tychonoff. Given a realcompact space X, we denote by $\mathsf {Exp}(X)$ the smallest infinite cardinal $\kappa $ such that X is homeomorphic to a closed subspace of $\mathbb {R}^\kappa $. Our main result shows that, given a cardinal $\kappa $, the following conditions are equivalent:

• • There exists a countable crowded space X such that $\mathsf {Exp}(X)=\kappa $.

• • $\mathfrak {p}\leq \kappa \leq \mathfrak {c}$.

$\mathfrak {d}\leq \kappa \leq \mathfrak {c}$

$2^\kappa $

$\kappa $

$\kappa $

$\mathsf {Exp}(X)$

For a space X let $\mathcal {K}(X)$ be the set of compact subsets of X ordered by inclusion. A map $\phi :\mathcal {K}(X) \to \mathcal {K}(Y)$ is a relative Tukey quotient if it carries compact covers to compact covers. When there is such a Tukey quotient write $(X,\mathcal {K}(X)) \ge _T (Y,\mathcal {K}(Y))$, and write $(X,\mathcal {K}(X)) =_T (Y,\mathcal {K}(Y))$ if $(X,\mathcal {K}(X)) \ge _T (Y,\mathcal {K}(Y))$ and vice versa.

We investigate the initial structure of pairs $(X,\mathcal {K}(X))$ under the relative Tukey order, focussing on the case of separable metrizable spaces. Connections are made to Menger spaces.

Applications are given demonstrating the diversity of free topological groups, and related free objects, over separable metrizable spaces. It is shown a topological group G has the countable chain condition if it is either $\sigma $-pseudocompact or for some separable metrizable M, we have $\mathcal {K}(M) \ge _T (G,\mathcal {K}(G))$.

For any $n<\omega $ we construct an infinite $(n+1)$-generated Heyting algebra whose n-generated subalgebras are of cardinality $\leq m_n$ for some positive integer $m_n$. From this we conclude that for every $n<\omega $ there exists a variety of Heyting algebras which contains an infinite $(n+1)$-generated algebra, but which contains only finite n-generated algebras. For the case $n=2$ this provides a negative answer to a question posed by G. Bezhanishvili and R. Grigolia in [4].