Related papers: Commensurability and bi-interpretability of groups

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

A combinatorial characterization of measurable filters on a countable set is found. We apply it to the problem of measurability of the intersection of nonmeasurable filters.

We study locally definable abelian groups $\CU$ in various settings and examine conditions under which the quotient of $\CU$ by a discrete subgroup might be definable. This turns out to be related to the existence of the type-definable…

Several researchers have argued that a machine learning system's interpretability should be defined in relation to a specific agent or task: we should not ask if the system is interpretable, but to whom is it interpretable. We describe a…

We shall define a general notion of dimension, and study groups and rings whose interpretable sets carry such a dimensio. In particular, we deduce chain conditions for groups, definability results for fields and domains, and show that…

This paper presents a taxonomy of explainability in Human-Agent Systems. We consider fundamental questions about the Why, Who, What, When and How of explainability. First, we define explainability, and its relationship to the related terms…

Two salient notions of sameness of theories are synonymy, also known as definitional equivalence, and bi-interpretability. Of these two definitional equivalence is the strictest notion. In which cases can we infer synonymy from…

Interpretable machine learning tackles the important problem that humans cannot understand the behaviors of complex machine learning models and how these models arrive at a particular decision. Although many approaches have been proposed, a…

By classifying $S$-maximal amenable subgroups of algebraic groups over a global field of characteristic zero, we obtain a complete classification of maximal amenable subgroups up to commensurability in the respective arithmetic groups.…

In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also…

In this paper we study the commensurability of hyperbolic Coxeter groups of finite covolume, providing three necessary conditions for commensurability. Moreover we tackle different topics around the field of definition of a hyperbolic…

We provide a novel notion of what it means to be interpretable, looking past the usual association with human understanding. Our key insight is that interpretability is not an absolute concept and so we define it relative to a target model,…

We introduce and study several amenability properties for unitary corepresentations and *-representations of algebraic quantum groups, which may be used to characterize amenability or co-amenability of such groups. As a background for this…

This study focuses on exploring the use of local interpretability methods for explaining time series clustering models. Many of the state-of-the-art clustering models are not directly explainable. To provide explanations for these…

We introduce the notion of commability between locally compact groups, namely the equivalence relation generated by cocompact inclusions and quotients by compact normal subgroups. We give a classification of focal hyperbolic locally compact…

We characterize left and right amenable semigroups of polynomials of one complex variable with respect to the composition operation. We also prove a number of results about amenable semigroups of arbitrary rational functions. In particular,…

A semigroup is \emph{amiable} if there is exactly one idempotent in each $\mathcal{R}^*$-class and in each $\mathcal{L}^*$-class. A semigroup is \emph{adequate} if it is amiable and if its idempotents commute. We characterize adequate…

Interpretability and explainability have gained more and more attention in the field of machine learning as they are crucial when it comes to high-stakes decisions and troubleshooting. Since both provide information about predictors and…

We determine all groups definable in Presburger arithmetic, up to a finite index subgroup.

We study infinite groups interpretable in power bounded $T$-convex, $V$-minimal or $p$-adically closed fields. We show that if $G$ is an interpretable definably semisimple group (i.e., has no definable infinite normal abelian subgroups)…