逻辑
We study compactness and L\"owenheim-Skolem properties of fragments of the class-sized logic $\mathcal{L}_{\infty \infty}$ and of class-sized versions of second-order and sort logics. In these fragments, certain combinations of infinitary…
We introduce an axiomatisation of when a model of the form $L(V_{\kappa+1})^M$ can be considered a ``$\kappa$-Solovay model''; we show a characterisation of $\kappa$-Solovay models; and we prove elementary equivalences between…
Given sets $X,Y$ and a regular cardinal $\mu$, let $\Phi(X,Y,\mu)$ be the statement that for any function $f : X \times Y \to \mu$, there are functions $g_1 : X \to \mu$ and $g_2 : Y \to \mu$ such that or all $(x,y) \in X \times Y$,…
Let $M$ be a Fra\"{i}ss\'{e} structure (a countably infinite ultrahomogeneous structure). We refer to the class of structures embeddable in $M$ as the $\omega$-age of $M$. We consider the following two properties of $M$: we say that $M$ has…
Assuming the consistency of $\mathsf{ZFC}$, we construct a model of set theory in which the boldface $\mathbf{\Sigma}^1_3$-uniformization property holds, yet the lightface $\Sigma^1_4$-uniformization property fails, separating these two…
We show that a non-universal Polish group can induce a complete orbit equivalence relation, which answers a question of Sabok from \cite{OPENPROBLEMS}.
We give two consistent constructions of trees $T$ whose finite power $T^{n+1}$ is sharply different from $T^n$: 1. An $\aleph_1$-tree $T$ whose interval topology $X_T$ is perfectly normal, but $(X_T)^2$ is not even countably metacompact. 2.…
Entangled linear orders were first introduced by Abraham and Shelah. Todor\v{c}evi\'c showed that these linear orders exist under $\mathsf{CH}$. We prove the following results: (1) If $\mathsf{CH}$ holds, then, for every $n > 0$, there is…
We characterize sums of normal ultrafilters after the Magidor iteration (product) of Prikry forcings over a discrete set of measurable cardinals. We apply this to show that the weak Ultrapower Axiom is not equivalent to the Ultrapower…
In this paper we present the first-order logic QLETF+, a quantified version of the logic LETF+, introduced in Coniglio and Rodrigues (Studia Logica 112:561-606, 2024). QLETF+ exhibits several properties that are not always enjoyed by logics…
Carmo and Jones have presented a sequence of candidate axiom systems for conditional obligation between 1997 and 2022. For their most recent system we demonstrate a limited form of deontic explosion: given that a student does not get the…
Given Polish space $\mathcal{Y}$ and a continuous language $L$ we study the corresponding logic $\mathsf{Iso}(\mathcal{Y})$-space $\mathcal{Y}_L$. We build a framework of generalized model theory towards analysis of Borel complexity of…
Potentialism is the view that objects are successively generated in an incompletable process. A strict version of the view adds that truths are successively determined. Strict potentialism can be analyzed using two modalities: one for the…
A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…
This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary…
We study the class of structures that, in a way, generalize various approaches to the contact relation on Boolean algebras.
We construct a class $\hat{K}$ of torsion-free abelian groups such that $\hat{\mathbf{K}}=(\hat{K}, \leq_p)$ is an abstract elementary class with $\operatorname{LS}(\hat{\mathbf{K}})=\aleph_0$ such that: $(\cdot)$ $\hat{\mathbf{K}}$ is not…
We show the simplicity of the automorphism groups of the generic $n$-hypertournament and the semigeneric tournament, and determine the normal subgroups of the automorphism groups of several other ultrahomogeneous oriented graphs. We also…
We continue the work from [8] and make a small -- but significant -- improvement to the definition of $j$-decomposable system. This provides us with a better lifting of elementary embeddings to symmetric extensions. In particular, this…
We prove the linear orders first-order definable in the standard model $(\ZZ;<,+)$ of Presburger arithmetic are exactly those that are $(\ZZ;<,+)$-definably embeddable into the lexicographic ordering on $\ZZ^n$ for some $n$.