逻辑

We extend the results of arXiv:1808.01509 on nonamalgamable forcing extensions to families of posets with wide projections. We also use a different coding method to obtain nonamalgamable extensions by filter-based Mathias forcing.

We study model-complete fields that avoid a given quasi-project variety $V$. There is a close connection between hyperbolicity of $V$ and the existence of the model companion for the theory of characteristic-zero fields avoiding rational…

We introduce the notion of echeloned spaces - an order-theoretic abstraction of metric spaces. The first step is to characterize metrizable echeloned spaces. It turns out that morphisms between metrizable echeloned spaces are uniformly…

If $C$ is a curve over $\mathbb{Q}$ with genus at least $2$ and $C(\mathbb{Q})$ is empty, then the class of fields $K$ of characteristic 0 such that $C(K) = \varnothing$ has a model companion, which we call $C\mathrm{XF}$. The theory…

We prove that superclub implies $\mathfrak{s}=\aleph_1$. More generally, superclub at a successor of a weakly compact cardinal implies $\mathfrak{s}_\kappa=\kappa^+$. Based on this statement, we separate tiltan from superclub at a successor…

We prove that the lattice of ideals of an arbitrary $L$-algebra is distributive. As a consequence, a spectral theory applies with no restriction. We also study the spectrum (i.e. the set of prime ideals) of $L$-algebras and characterize…

Using creature technology, we construct families of Suslin ccc non-sweet forcing notions $\mathbb Q$ such that $ZFC$ is equiconsistent with $ZF+$"every set of reals equals a Borel set modulo the $(\leq \aleph_1)$-closure of the null ideal…

We introduce an elementary class of linearly ordered groups, called growth order groups, encompassing certain groups under composition of formal series (e.g. transseries) as well as certain groups $\mathcal{G}_{\mathcal{M}}$ of infinitely…

We describe a construction of a model of second order arithmetic in which (boldface) $\bm{\Pi^1_n}$-determinacy holds, but (lightface) $\Pi^1_{n+2}$-$\mathsf{DC}$ fails, thus showing that no projective level of determinacy implies full…

Five-valued Nelson algebras are those satisfying the condition: $((x\to z)\to y)\to(((y \to x)\to y)\to y)=1$. We give alternative equations defining these algebras, and determine the structure and number of elements of the free five-valued…

Deconstructibility is an often-used sufficient condition on a class $\mathcal{C}$ of modules that allows one to carry out homological algebra \emph{relative to $\mathcal{C}$}. The principle \textbf{Maximum Deconstructibility (MD)} asserts…

In this work we propose a notion of genus in the context of Zariski geometries and we obtain natural generalizations of the Riemann--Hurwitz Theorem and the Hurwitz Theorem in the context of very ample Zariski geometries. As a corollary, we…

In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…

We characterize several large cardinal notions by model-theoretic properties of extensions of first-order logic. We show that $\Pi_n$-strong cardinals, and, as a corollary, ``Ord is Woodin" and weak Vop\v{e}nka's Principle, are…

This paper studies when an arithmetical equivalence relation $E$ can be realized as the connectedness relation of a graph $G$ which is simpler to define than $E$. Several examples of such equivalence relations are established. In…

We use Kan injectivity to axiomatise concepts in the 2-category of topoi. We showcase the expressivity of this language through many examples, and we establish some aspects of the formal theory of Kan extension in this 2-category (pointwise…

Motivated by recent work of Boney, Dimopoulos, Gitman and Magidor, we characterize the existence of weak compactness cardinals for all abstract logics through combinatorial properties of the class of ordinals. This analysis is then used to…

We show that (i) the standard fine structural properties for premice follow from normal iterability (whereas the classical proof relies on iterability for stacks of normal trees), and (ii) every mouse which is finitely generated above its…

A categorial grammar assigns one of several syntactic categories to each symbol of the alphabet, and the category of a string is then deduced from the categories assigned to its symbols using two simple reduction rules. This paper…

Let $\Lambda\subseteq\mathbb{R}^n$ be a lattice and let $Z\subseteq\mathbb{R}^{m+n}$ be a definable family in an o-minimal expansion of the real field, $\overline{\mathbb{R}}$. A result of Barroero and Widmer gives sharp estimates for the…