Related papers: Bi-interpretation in weak set theories

We show that first-order logic can be translated into a very simple and weak logic, and thus set theory can be formalized in this weak logic. This weak logical system is equivalent to the equational theory of Boolean algebras with three…

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

We show that the biflatness - in the sense of A. Ya. Helemskii - of the Fourier algebra $A(G)$ of a locally compact group $G$ forces $G$ to either have an abelian subgroup of finite index or to be non-amenable without containing $F_2$, the…

We prove the following surprising result: there exist a 1-counter B\"uchi automaton and a 2-tape B\"uchi automaton such that the \omega-language of the first and the infinitary rational relation of the second in one model of ZFC are…

We give examples of (i) a simple theory with a formula (with parameters) which does not fork over the empty set but has mu measure 0 for every automorphism invariant Keisler measure mu, and (ii) a definable group G in a simple theory such…

We have recently showed that it is possible to deal with collections of indistinguishable elementary particles (in the context of quantum mechanics) in a set-theoretical framework by using hidden variables, in a sense. In the present paper…

We describe an "interpretability illusion" that arises when analyzing the BERT model. Activations of individual neurons in the network may spuriously appear to encode a single, simple concept, when in fact they are encoding something far…

In order for machine learning to be deployed and trusted in many applications, it is crucial to be able to reliably explain why the machine learning algorithm makes certain predictions. For example, if an algorithm classifies a given…

Neural networks have greatly boosted performance in computer vision by learning powerful representations of input data. The drawback of end-to-end training for maximal overall performance are black-box models whose hidden representations…

It is well known that ZFC, despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the…

We continue our investigation =of Shelah's interpretability orders $\trianglelefteq^*_\kappa$ as well as the new orders $\trianglelefteq^\times_\kappa$. In particular, we give streamlined proofs of the existence of minimal unstable,…

Explaining autonomous and intelligent systems is critical in order to improve trust in their decisions. Counterfactuals have emerged as one of the most compelling forms of explanation. They address ``why not'' questions by revealing how…

In this paper, we propose a self-interpretable model SITE with transformation-equivariant interpretations. We focus on the robustness and self-consistency of the interpretations of geometric transformations. Apart from the transformation…

While non-contextual hidden-variable theories are proved to be impossible, contextual ones are possible. In a contextual hidden-variable theory, an observable is called a beable if the hidden-variable assigns its value in a given…

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…

For a countable, weakly minimal theory, we show that the Schroeder-Bernstein property (any two elementarily bi-embeddable models are isomorphic) is equivalent to both a condition on orbits of rank 1 types and the property that the theory…

We make explicit the correspondence between syntax and syntactic categories for coherent first-order logic, providing a categorical characterization of bi-interpretability. This is done by creating a biequivalence between a bicategory of…

We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…

The article addresses some open questions about the relations between the topological weak mixing property and the transitivity of the map $f\times f^2 \times...\times f^m$, where $f\colon X\ra X$ is a topological dynamical system on a…

We improve on and generalize a 1960 result of Maltsev. For a field $F$, we denote by $H(F)$ the Heisenberg group with entries in $F$. Maltsev showed that there is a copy of $F$ defined in $H(F)$, using existential formulas with an arbitrary…