逻辑

We define a special version of the ultralimit, called the skewed ultralimit. Using this tool, we show that the set of ultrafilter types in the $C$-equivalence class of a Ramsey ultrafilter $\mathfrak u\in \beta\omega$ with the Rudin-Keisler…

For $\kappa$ a regular uncountable cardinal, the higher Baire and Cantor spaces ${}^\kappa\kappa$ and ${}^\kappa2$ (endowed with the ${<}\kappa$-box topology) have been relatively well-studied, but less is known about the case where…

Using nonstandard analysis, an intuitive and very short proof of the Radon-Nikodym theorem is provided

We analyze the intermediate models of the strongly compact Prikry forcing. We exhibit a simple combinatorial property which, for a given supercompact cardinal $\kappa$, characterize the projections of all projections of the strongly compact…

For ultrafilters u,v on N, the operation u/v is introduced and formalised which acts as quotient-like structures when v strongly divides u.Central to our study is the characterization of self-divisible ultrafilters in connection with the…

We show that over the weak base theory $\mathrm{RCA}_0^*$, cohesive Ramsey's theorem for pairs $\mathrm{CRT}^2_2$ implies exponential closure of the definable cut $\mathrm{I}^0_1$, which is the intersection of all $\Sigma^0_1$-definable…

We study the question, what computational power is sufficient to perform constructions using either Laver or Hechler forcing. As a result, we obtain a separation between three relativised non-lowness classes that are the…

We show that the composition of omega-series by surreal numbers, or more generally by elements of any confluent field of transseries, is monotonic in its second argument. In particular, omega-series and LE-series interpreted as functions…

We define a pairing map $\pi_{\mathsf{CL}} : \mathbb{N}^2\to\mathbb{N}$ that encodes $x$ and $y$ into two disjoint bands of Zeckendorf indices separated by a delimiter computed from $x$. The construction is "carryless" by design: the…

A Ramsey-like theorem is a statement of the form ``For every 2-coloring of $[\mathbb{N}]^2$, there exists an infinite set~$H \subseteq \mathbb{N}$ such that $[H]^2$ avoids some pattern''. We prove that none of these statements are…

We show that there is an additive $F_\sigma$ subgroup $A$ of $\mathbb{R}$ and $x \in \mathbb{R}$ such that $\mathrm{dim_H} (A) = \frac{1}{2}$ and $A + x A =\mathbb{R}$. However, if $A \subseteq \mathbb{R}$ is a subring of $\mathbb{R}$ and…

This paper proposes an approach to information-based logics using many-logic modal structures (MLMS). These structures can express accessibility relations between worlds with different underlying logics by anchoring them to a base lattice,…

We construct an abstract elementary class $K_1$ of torsion-free abelian groups such that $K_1$ is not $(<\aleph_0)$-tame but is $\aleph_0$-tame. This answers a question of [BoVa17]. Furthermore, for every regular uncountable cardinal $\mu$…

Hilbert algebras are the implicative subreducts of Heyting algebras. It is shown that having depth at most n is an equational condition in Hilbert algebras. This generalizes an analogous well-known result in the setting of Heyting algebras.

Let $T$ be a theory which is t-minimal, meaning that with respect to some definable topology, a unary definable set $D \subseteq M$ has non-empty interior iff it is infinite. If $K$ is a definable field in $T$, then $K$ is finite or "large"…

We show that it is consistent relative to the existence of suitable large cardinals that for any countable-to-one coloring $c: [\omega_2]^2\to \omega_2$, there exists a closed subset $A\subseteq \omega_2$ of order type $\omega_1$ such that…

Order dimension theory measures the complexity of partially ordered sets by quantifying how far they are from being linearly ordered. In this paper we study classical bounding results for order dimension within the framework of reverse…

We aim to construct a formal theory of affordances seen as ternary relations. Beginning with a characterization of affordances proposed by James J. Gibson, and utilizing the tools provided by Zdzis{\l}aw Pawlak's information systems and…

This paper is an extended version of our work in \cite{Ca2025}. We extend the concept of effective reducibility between statements of set theory with ordinal Turing machines (OTMs) explored in \cite{Ca2018} for $\Pi_{2}$-statements to…

Taking symmetric extensions can be considered as a generalisation of forcing, which produces a richer multiverse of models with and without the axiom of choice. We can study the structure of this multiverse using modal logic. In particular,…