Related papers: Definable Coherent Ultrapowers and Elementary Exte…
We characterize the equality between ultradifferentiable function classes defined in terms of abstractly given weight matrices and in terms of the corresponding matrix of associated weight functions by using new growth indices. These…
Tensor products of ultrafilters have special combinatorial features closely related to Ramsey's Theorem, making them useful tools in applications. Here we first review their fundamental properties and isolate some new ones, including a…
We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains. The programs in our class use uninterpreted functions and relations, and abide by a…
A union ultrafilter is an ultrafilter over the finite subsets of $\omega$ that has a base of sets of the form $\mathrm{FU}(X)$, where $X$ is an infinite pairwise disjoint family and $\mathrm{FU}(X)=\{\bigcup…
A classical result of topological algebra states that any compact left topological semigroup has an idempotent. We refine this by showing that any compact left topological left semiring has a common, i.e. additive and multiplicative…
We prove that if S is a commutative semigroup with well founded universal semilattice or a solvable inverse semigroup with well founded semilattice of idempotents, then every strongly productive ultrafilter on S is idempotent. Moreover we…
Large cardinals arising from the existence of arbitrarily long end elementary extension chains over models of set theory are studied here. In particular, we show that the large cardinals obtained that way (`Unfoldable cardinals') behave as…
Let U be a monster model and let D be a subset of U. Let (U,D) denote theexpansion of U with a new predicate for D. Write e(D) for the collection of all subsets C of U such that (U,C) is elementary equivalent to (U,D). We prove that if e(D)…
This paper contributes to the theory of large cardinals beyond the Kunen inconsistency, or choiceless large cardinal axioms, in the context where the Axiom of Choice is not assumed. The first part of the paper investigates a periodicity…
Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings…
Our results in this paper increase the model-theoretic precision of a widely used method for building ultrafilters, and so advance the general problem of constructing ultrafilters whose ultrapowers have a precise degree of saturation. We…
The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…
Given an o-minimal structure ${\mathcal M}$ with a group operation, we show that for a properly convex subset $U$, the theory of the expanded structure ${\mathcal M}'=({\mathcal M},U)$ has definable Skolem functions precisely when…
We introduce the notion of additive filter and present a new proof of the existence of idempotent ultrafilters on N without any use of Zorn's Lemma, and where one only assumes the Ultrafilter Theorem for the continuum.
We extend the notion of exact completion on a weakly lex category to elementary doctrines. We show how any such doctrine admits an elementary quotient completion, which freely adds effective quotients and extensional equality. We note that…
Suppose that ${\mathcal M}$ is a model of PA and ${\mathcal N}$ is a countably generated elementary end extension of ${\mathcal M}$. Let ${\mathfrak X}$ be the set of subsets of M that are coded by ${\mathcal N}$. Then ${\mathcal M}$ has a…
We prove that the cohomology groups of a definably compact set over an o-minimal expansion of a group are finitely generated and invariant under elementary extensions and expansions of the language. We also study the cohomology of the…
We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…
Counterfactual explanations (CEs) are a practical tool for demonstrating why machine learning classifiers make particular decisions. For CEs to be useful, it is important that they are easy for users to interpret. Existing methods for…
In this paper, we study definably compact semigroups in o-minimal structures, aiming to extend the theory of definable groups to a broader algebraic setting. We show that any definably compact semigroup contains idempotents and admits a…