逻辑

Let $C$ be the class of separable-algebraically maximal equi-characteristic Kaplansky fields of a given imperfection degree, admitting an angular component map. We prove that the common theory of the class $C$ resplendently eliminates…

For $N \geq 2$, we study the structure of definable abelian group extensions of the additive group $(\mathbb{R}^N,+)$ by countable abelian (Borel) groups $G$. Given an extension $H$ of $(\mathbb{R}^N,+)$ by $G$, we measure the definability…

A few notes about infinite trees in a descriptive set-theoretic setting.

Let $T$ be a complete, model-complete, geometric dp-minimal $\mathcal{L}$-theory of topological fields of characteristic $0$ and let $T(\partial)$ be the theory of expansions of models of $T$ by a derivation $\partial$. We assume that…

This paper develops a logic based on causal inferences to formally capture the concept of instrumental obligation. We establish a causal deontic model that extends causal models with priority structures, allowing us to represent both the…

We define and study expansion problems on countable structures in the setting of descriptive combinatorics. We consider both expansions on countable Borel equivalence relations and on countable groups, in the Borel, measure and category…

We show that several sets of interest arising from the study of partition regularity and density Ramsey theory of polynomial equations over integral domains are undecidable. In particular, we show that the set of homogeneous polynomials $p…

Librationist set theory \pounds ${}$ is developed. It descends from semantics for truth, initiated by Kripke, and others. # extends \pounds, of Librationist closures of the paradoxes in Logic and Logical Philosophy 21(4), 323-361, 2012.…

We put together Woodin's $\Sigma^2_1$ basis theorem of AD$^+$ and Vop\v{e}nka's theorem to conclude the following: If there is a proper class of Woodin cardinals, then every $(\Sigma^2_1)^{\mbox{uB}}$ statement that is true in $V$ is true…

We compute the type (maximum linearization) of the well partial order of bounded lower sets in $\mathbb{N}^m$, ordered under inclusion, and find it is $\omega^{\omega^{m-1}}$. Moreover we compute the type of the set of all lower sets in…

We study the complexity of locally checkable labeling (LCL) problems on $\mathbb{Z}^n$ from the point of view of descriptive set theory, computability theory, and factors of i.i.d. Our results separate various complexity classes that were…

A computable graph $\mathcal{G}$ is computably categorical relative to a degree $\mathbf{d}$ if and only if for all $\mathbf{d}$-computable copies $\mathcal{B}$ of $\mathcal{G}$, there is a $\mathbf{d}$-computable isomorphism…

We introduce the notion of a tight cofinitary group, which captures forcing indestructibility of maximal cofinitary groups for a long list of partial orders, including Cohen, Sacks, Miller, Miller partition forcing and Shelah's poset for…

Under $\text{CH}$ we construct a partition of Baire space into compact sets, which is indestructible by countably supported iteration and product of Sacks forcing of any length, answering a question of Newelski. Further, we present an…

This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…

We prove a decomposition of definable groups in o-minimal structures generalizing the Jordan-Chevalley decomposition of linear algebraic groups. It follows that any definable linear group G is a semidirect product of its maximal normal…

Jing Zhang proved the consistency of $\binom{\omega_2}{\omega_1}\rightarrow\binom{n}{\omega_1}_\omega$ for every $n\in\omega$ with the negative relation $\binom{\omega_2}{\omega_1}\nrightarrow\binom{\omega}{\omega_1}_\omega$. We reduce the…

There is a way of assigning a realizability notion to each degree of incomputability. In our setting, we make use of Weihrauch degrees (degrees of incomputability/discontinuity of partial multi-valued functions) to obtain Lifschitz-like…

We prove that any ordered field can be extended to one for which every decreasing sequence of bounded closed intervals, of any length, has a nonempty intersection; equivalently, there are no Dedekind cuts with equal cofinality from both…

This paper proves a Kolmogorov-complexity-flavored sufficient condition for a set to be attractive and discusses some consequences of this condition.