Related papers: Homogeneous 1-based structures and interpretabilit…

Let P be a principal bundle with semisimple compact simply connected structure group G over a compact simply connected four-manifold M. In this note we give explicit formulas for the rational homotopy groups and cohomology algebra of the…

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

Abstract grammatical knowledge - of parts of speech and grammatical patterns - is key to the capacity for linguistic generalization in humans. But how abstract is grammatical knowledge in large language models? In the human literature,…

In this paper we explore some properties of H-structures. We describe a construction of H-structures based on one-dimensional asymptotic classes which preserves pseudo-finiteness. That is, the H-structures we construct are ultraproducts of…

We prove that the simplicial cocommutative coalgebra of singular chains on a connected topological space determines the homotopy type rationally and one prime at a time, without imposing any restriction on the fundamental group. In…

Most research on the interpretability of machine learning systems focuses on the development of a more rigorous notion of interpretability. I suggest that a better understanding of the deficiencies of the intuitive notion of…

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

If $L$ is a relational language, an $L$-structure ${\mathbb X}$ is condensable to an $L$-structure ${\mathbb Y}$, we write ${\mathbb X} \preccurlyeq _c {\mathbb Y}$, iff there is a bijective homomorphism (condensation) from ${\mathbb X}$…

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…

This paper presents a substructural logic of sequents with very restricted exchange and weakening rules. It is sound with respect to sequences of measurements of a quantic system. A sound and complete semantics is provided. The semantic…

We define the notions of a free fusion of structures and a weakly stationary independence relation. We apply these notions to prove simplicity for the automorphism groups of order and tournament expansions of homogeneous structures like the…

Mereology in its formal guise is usually couched in a language whose signature contains only one primitive binary predicate symbol representing the part of relation, either the proper or improper one. In this paper, we put forward an…

Smale-Barden manifolds $M$ are classified by their second homology $H_2(M,{\mathbb Z})$ and the Barden invariant $i(M)$. It is an important and dificult question to decide when $M$ admits a Sasakian structure in terms of these data. In this…

We develop a linear response framework for interpretability that treats a neural network as a Bayesian statistical mechanical system. A small perturbation of the data distribution, for example shifting the Pile toward GitHub or legal text,…

We study finite $l$-colourable structures with an underlying pregeometry. The probability measure that is used corresponds to a process of generating such structures (with a given underlying pregeometry) by which colours are first randomly…

Let $K$ be an algebraically closed field. There has been much interest in characterizing multiple structures in $\P^n_K$ defined on a linear subspace of small codimension under additional assumptions (e.g. Cohen-Macaulay). We show that no…

Mekler's construction gives an interpretation of any structure in a finite relational language in a group (nilpotent of class $2$ and exponent $p>2$, but not finitely generated in general). Even though this construction is not a…

A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the existence of homomorphisms from all finite substructures of B to…

We give an algebraic proof of the criterion for hereditary structural completeness of an intermediate logic, or, equivalently, of the primitiveness of a variety of Heyting algebras.