Related papers: Logic Blog 2020

In this paper, we present a typed lambda calculus ${\bf SILL}(\lambda)_{\Sigma}$, a type-theoretic version of intuitionistic linear logic with subexponentials, that is, we have many resource comonadic modalities with some interconnections…

In this paper, we introduce a weak form of amenability on topological semigroups that we call $\varphi$-amenability, where $\varphi$ is a character on a topological semigroup. Some basic properties of this new notion are obtained and by…

Let G be a reductive algebraic group over a field of prime characteristic. One can associate to G (or subgroups thereof) its Lie algebra, its Frobenius kernels, and the finite Chevalley group of points over a finite field. The…

This text surveys classical and recent results in the field of amenability of groups, from a combinatorial standpoint. It has served as the support of courses at the University of G\"ottingen and the \'Ecole Normale Sup\'erieure. The goals…

Let $S_\infty$ denote the topological group of permutations of the natural numbers. We study the complexity of the isomorphism relation on classes of closed subgroups $S_\infty$ in the setting of Borel reducibility between equivalence…

We extend the convergence law for sparse random graphs proven by Lynch to arbitrary relational languages. We consider a finite relational vocabulary $\sigma$ and a first order theory $T$ for $\sigma$ composed of symmetry and…

A recent line of work in mechanistic interpretability has focused on reverse-engineering the computation performed by neural networks trained on the binary operation of finite groups. We investigate the internals of one-hidden-layer neural…

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…

We introduce a new family of temporal logics designed to finely balance the trade-off between expressivity and complexity. Their key feature is the possibility of defining operators of a new kind that we call transformation operators. Some…

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…

We bound the Borel cardinality of the isomorphism relation for nuclear simple separable C*-algebras: It is turbulent, yet Borel reducible to the action of the automorphism group of the Cuntz algebra O_2 on its closed subsets. The same…

The purpose of this article is to connect the notion of the amenability of a discrete group with a new form of structural Ramsey theory. The Ramsey theoretic reformulation of amenability constitutes a considerable weakening of the Folner…

We motivate and study the class $\mathcal{C}$ of countable groups $G$ such that the conjugacy relation between minimal actions of $G$ on $\mathbb{R}$ by orientation-preserving homeomorphisms is smooth -- that is, admits a Borel transversal.…

We analyze the saliency of neural networks and employ interpretable machine learning models to predict whether the Kronecker coefficients of the symmetric group are zero or not. Our models use triples of partitions as input features, as…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Given a group $G$ acting faithfully on a set $S$, one gets a simple group denoted $SV_G$, called a twisted Brin--Thompson group. In this paper we drop the faithfulness assumption, and get an abstract version of a twisted Brin--Thompson…

We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…

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"…

This small text was written for the AMS Notices. It is a survey of integrality properties of complex local systems, where I tried to single out one example which is not entirely explicit in the literature. The focus is on the obstruction it…

A topological group $G$ is called extremely amenable if every continuous action of $G$ on a compact space has a fixed point. This concept is linked with geometry of high dimensions (concentration of measure). We show that a von Neumann…