逻辑

We study $\omega$-categorical $MS$-measurable structures. Our main result is that a class of $\omega$-categorical Hrushovski constructions, supersimple of finite $SU$-rank is not $MS$-measurable. These results complement the work of Evans…

We find a natural $L_{\omega_1,\omega}$-axiomatisation $\Sigma$ of a structure on the upper half-plane $\mathbb{H}$ as the covering space of modular curves. The main theorem states that $\Sigma$ has a unique model in every uncountable…

We construct a large family of normal $\kappa$-complete $\mathbb{R}_\kappa$-embeddable non-special $\kappa^+$-Aronszajn trees which have no club isomorphic subtrees using an instance of the proxy principle of Brodsky-Rinot.

A subresiduated lattice ordered commutative monoid (or srl-monoid for short) is a pair $(\textbf{A},Q)$ where $\textbf{A}=(A,\wedge,\vee,\cdot,e)$ is an algebra of type $(2,2,2,0)$ such that $(A,\wedge,\vee)$ is a lattice, $(A,\cdot,e)$ is…

Let $\kappa$ be an inaccessible cardinal, $\mathfrak{U}$ be a universal algebra, and $\sim$ be the equivalence relation on $\mathfrak{U}^{\kappa}$ of eventual equality. From mild assumptions on $\kappa$ we give general constructions of…

In this paper, we investigate the relationship between the Tukey order and PCF theory, as applied to sets of regular cardinals. We show that it is consistent that for all sets $A$ of regular cardinals that the Tukey spectrum of $A$, denoted…

Partial combinatory algebras are algebraic structures that serve as generalized models of computation. In this paper, we study embeddings of pcas. In particular, we systematize the embeddings between relativizations of Kleene's models, of…

Prawitz conjectured that the proof-theoretically valid logic is intuitionistic logic. Recent work on proof-theoretic validity has disproven this. In fact, it has been shown that proof-theoretic validity is not even closed under…

We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…

We have a quick look at various finite model properties for residuated semigroups. In particular, we solve Problem 19.17 from Relation Algebras by Games by Hirsch and Hodkinson.

Every partial applicative structure gives rise to an indexed binary relation, that is a contravariant functor from the category of sets to the category of sets endowed with binary relations and maps preserving them. In this paper we…

Two nonzero recursively enumerable (r.e.) degrees $\mathbf{a}$ and $\mathbf{b}$ form a strong minimal pair if $\mathbf{a} \wedge \mathbf{b}=\mathbf{0}$ and $\mathbf{b}\vee \mathbf{x}\geq \mathbf{a}$ for any nonzero r.e. degree…

Vop\v{e}nka's Alternative Set Theory can be viewed both as an evolution and as a revolution: it is based on his previous experience with nonstandard universes, inspired by Skolem's construction of a nonstandard model of arithmetic, and its…

We investigate the non-elementary computational complexity of a family of substructural logics without contraction. With the aid of the technique pioneered by Lazi\'c and Schmitz (2015), we show that the deducibility problem for full Lambek…

Let $K$ be a field. The \'etale open topology on the $K$-points $V(K)$ of a $K$-variety $V$ was introduced in our previous work. The \'etale open topology is non-discrete if and only if $K$ is large. If $K$ is separably, real, $p$-adically…

We study H-structures associated to SU-rank 1 measurable structures. We prove that the SU-rank of the expansion is continuous and that it is uniformly definable in terms of the parameters of the formulas. We also introduce notions of…

We obtain some new results on the topology of unary definable sets in densely ordered Abelian groups of burden groups of burden 2. In the special case in which the structure has dp-rank 2, we show that the existence of an infinite definable…

If an automorphism f of a structure M is such that fix(f^k) = fix(f) for all positive k, then M|fix(f) is a substructure of M. The possible isomorphism types of such M|fix(f) are characterized when M is countable and arithmetically…

In arXiv:2208.12944 it is shown that an ordinal $\sup_{N<\omega}\psi_{\Omega_{1}}(\varepsilon_{\Omega_{\mathbb{S}+N}+1})$ is an upper bound for the proof-theoretic ordinal of a set theory ${\sf KP}\ell^{r}+(M\prec_{\Sigma_{1}}V)$. In this…

We adapt a continuous logic axiomatization of tracial von Neumann algebras due to Farah, Hart and Sherman in order to prove a metatheorem for this class of structures in the style of proof mining, a research program that aims to obtain the…