逻辑

We provide a geometric condition which characterises when the Principle of Dependent Choice holds in a Fraenkel--Mostowski--Specker permutation model. This condition is a slight weakening of requiring the filter of groups to be closed under…

Galeotti, Khomskii and V\"a\"an\"aanen recently introduced the notion of the upward L\"owenheim-Skolem-Tarski number for a logic, strengthening the classical notion of a Hanf number. A cardinal $\kappa$ is the \emph{upward…

We study the principle phi implies box phi, known as `Strength' or `the Completeness Principle', over the constructive version of L\"ob's Logic. We consider this principle both for the modal language with the necessity operator and for the…

For a free filter $F$ on $\omega$, let $N_F=\omega\cup\{p_F\}$, where $p_F\not\in\omega$, be equipped with the following topology: every element of $\omega$ is isolated whereas all open neighborhoods of $p_F$ are of the form $A\cup\{p_F\}$…

Given an o-minimal expansion $\mathbb{R}_{\mathcal{A}}$ of the real ordered field, generated by a generalized quasianalytic class $\mathcal{A}$, we construct an explicit truncation closed ordered differential field embedding of the Hardy…

Definable stationary sets, and specifically, ordinal definable ones, play a significant role in the study of canonical inner models of set theory and the class HOD of hereditarily ordinal definable sets. Fixing a certain notion of…

Existentially closed groups are, informally, groups that contain solutions to every consistent finite system of equations and inequations. They were introduced in 1951 in an algebraic context and subsequent research elucidated deep…

We present an overview of results on the question of whether the non-stationary ideal of an uncountable regular cardinal $\kappa$ can be defined by a $\Pi_1$-formula using parameters of hereditary cardinality at most $\kappa$. These results…

We survey the effective foundations for analysis with infinitesimals developed by Hrbacek and Katz in 2021, and detail some applications. Theories SPOT and SCOT are conservative over respectively ZF and ZF+ADC. The range of applications of…

We show how to construct, via forcing, splitting families than are preserved by a certain type of finite support iterations. As an application, we construct a model where 15 classical characteristics of the continuum are pairwise different,…

We study $\mathbb{R}_{\textrm{an},\exp}$-definable functions $f:\mathbb{R}\to \mathbb{R}$ that take integer values at all sufficiently large positive integers. If $|f(x)|= O\big(2^{(1+10^{-5})x}\big)$, then we find polynomials $P_1, P_2$…

Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as…

Cluckers and Lipshitz have shown that real closed fields equipped with real analytic structure are o-minimal. This generalizes the well-known subanalytic structure $\mathbb{R}_{\mathrm{an}}$ on the real numbers. We extend this line of…

A left-computable number $x$ is called regainingly approximable if there is a computable increasing sequence $(x_n)_n$ of rational numbers converging to $x$ such that $x - x_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$; and it is…

To counter a general belief that all the paradoxes stem from a kind of circularity (or involve some self--reference, or use a diagonal argument) Stephen Yablo designed a paradox in 1993 that seemingly avoided self--reference. We turn…

The traditional Arrow--Sen Social Choice Theory $\bf{TSCT}$ is a mathematical theory built apparently on higher--order formal language. In this paper, we propose a reformulation and reclassification of the $\bf{TSCT}$ axioms in order to…

The derived functors $\lim^n$ of the inverse limit are widely studied for their topological applications, among which are some repercussions on the additivity of strong homology. Set theory has proven useful in dealing with these functors,…

We define LE-ALC, a generalization of the description logic ALC based on the propositional logic of general (i.e. not necessarily distributive) lattices, and semantically interpreted on relational structures based on formal contexts from…

The algebraic dimension of a Polish permutation group $Q\leq \mathrm{Sym}(\mathbb{N})$ is the smallest $n\in\omega$, so that for all $A\subseteq \mathbb{N}$ of size $n+1$, the orbit of every $a\in A$ under the pointwise stabilizer of…

We introduce the notion of strong $p$-semi-regularity and show that if $p$ is a regular type which is not locally modular then any $p$-semi-regular type is strongly $p$-semi-regular. Moreover, for any such $p$-semi-regular type, "domination…