逻辑

We give a method of producing a Polish module over an arbitrary subring of $\mathbb Q$ from an ideal of subsets of $\mathbb N$ and a sequence in $\mathbb N$. The method allows us to construct two Polish $\mathbb Q$-vector spaces, $U$ and…

We introduce reflection properties of cardinals in which the attributes that reflect are expressible by infinitary formulas whose lengths can be strictly larger than the cardinal under consideration. This kind of generalized reflection…

This is an overview of a formalisation project in the proof assistant Isabelle/HOL of a number of research results in infinitary combinatorics and set theory (more specifically in ordinal partition relations) by Erd\H{o}s--Milner, Specker,…

This paper aims at discussing the importance of Leibniz Law to getting models for Paraconsistent Set Theories.

We introduce a new topological generalization of the $\sigma$-projective hierarchy, not limited to Polish spaces. Earlier attempts have replaced $^{\omega}\omega$ by $^{\kappa}\kappa$, for $\kappa$ regular uncountable, or replaced countable…

Motivated by reconstruction results by Rubin, we introduce a new reconstruction notion for permutation groups, transformation monoids and clones, called automatic action compatibility, which entails automatic homeomorphicity. We further…

We consider finitary relations (also known as crosses) that are definable via finite disjunctions of unary relations, i.e. subsets, taken from a fixed finite parameter set $\Gamma$. We prove that whenever $\Gamma$ contains at least one…

Computability theory is a discipline in the intersection of computer science and mathematical logic where the fundamental question is: given two mathematical objects X and Y, does X compute Y in principle? In case X and Y are real numbers,…

The notion of a \textbf{$\boldsymbol{\mathcal{C}}$-filtered} object, where $\mathcal{C}$ is some (typically small) collection of objects in a Grothendieck category, has become ubiquitous since the solution of the Flat Cover Conjecture…

Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…

In the present article, we extend the fragment of inductive formulas for the hybrid language L(@) in [8] including a McKinsey-like formula, and show that every formula in the extended class has a first-order correspondent, by modifying the…

In Keisler and Sun (2004), the authors raise several open problems on Loeb equivalences between various internal probability spaces. We provide counter-examples for the first two open problems. Moreover, we reduce the third open problem to…

We show that under the Bounded Proper Forcing Axiom and an anti-large cardinal assumption, there is a $\mathbf{\Pi}^1_2$ MAD family.

We show that there is a Borel graph on a standard Borel space of Borel chromatic number three that admits a Borel homomorphism to every analytic graph on a standard Borel space of Borel chromatic number at least three. Moreover, we…

We show that if all collections of infinite subsets of $\N$ have the Ramsey property, then there are no infinite maximal almost disjoint (mad) families. This solves a long-standing problem going back to Mathias \cite{mathias}. The proof…

We show that there is an effectively closed maximal eventually different family of functions in spaces of the form $\prod_n F(n)$ for $F\colon \mathbb{N} \to \mathbb{N}\cup\{\mathbb{N}\}$ and give an exact criterion for when there exists an…

We show there is a closed (in fact effectively closed, i.e., $\Pi^0_1$) eventually different family (working in ZF or less).

Let $\mathcal R$ be a $\Sigma^1_1$ binary relation, and recall that a set $A$ is $\mathcal R$-discrete if no two elements of $A$ are related by $\mathcal R$. We show that in the Sacks and Miller forcing extensions of $L$ there is a…

We prove that it is consistent (relative to a Mahlo cardinal) that all projective sets of reals are Lebesgue measurable, but there is a $\Delta^1_3$ set without the Baire property. The complexity of the set which provides a counterexample…

We first show that the projection image of a discrete definable set is again discrete for an arbitrary definably complete locally o-minimal structure. This fact together with the results in a previous paper implies tame dimension theory and…