Related papers: Existence of EF-equivalent Non Isomorphic Models

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

We prove several results relating the nonvanishing and the existence of good minimal models of different pairs that have the same underlying variety.

Let $E$ be a number field and $X$ a smooth geometrically connected variety defined over a characteristic $p$ finite field. Given an $n$-dimensional pure $E$-compatible system of semisimple $\lambda$-adic representations of the \'etale…

We consider several ways of decomposing models into parts of bounded size forming a congruence over a base, and show that admitting any such decomposition is equivalent to mutual algebraicity at the level of theories. We also show that a…

We prove that there exists, up to isomorphism, exactly one function field over the finite field of two elements of class number one and genus four. This result, together with the ones of MacRae, Madan, Leitzel, Queen and Stirpe, establishes…

In this paper, we give algorithms for determining the existence of isomorphism between two finite-dimensional Lie algebras and compute such an isomorphism in the affirrmative case. We also provide algorithms for determining algebraic…

We show that supercompactness and strong compactness can be equivalent even as properties of pairs of regular cardinals. Specifically, we show that if V models ZFC + GCH is a given model (which in interesting cases contains instances of…

We define and study a collection of matroid isomorphism games corresponding to various axiomatic characterizations of matroids. These are nonlocal games played between two cooperative players. Each game is played on two matroids, and the…

In this paper, we prove that the Fechner and Stevens laws are equivalent (coincide up to isomorphism). Therefore, the problem does not exist.

Synchronous linear constraint system games are nonlocal games that verify whether or not two players share a solution to a given system of equations. Two algebraic objects associated to these games encode information about the existence of…

We design games for truly concurrent bisimilarities, including strongly truly concurrent bisimilarities and branching truly concurrent bisimilarities, such as pomset bisimilarities, step bisimilarities, history-preserving bisimilarities and…

Game comonads have brought forth a new approach to studying finite model theory categorically. By representing model comparison games semantically as comonads, they allow important logical and combinatorial properties to be exressed in…

We give examples of pairs of isotopic algebras with non-isomorphic congruence lattices. This answers the question of whether all isotopic algebras have isomorphic congruence lattices.

We prove the equality $\cat(\phi)=\cd(\phi)$ for epimorphisms $\phi:\Gamma\to \Lambda$ between torsion-free, finitely generated almost nilpotent groups $\Gamma$ and $\Lambda$. In addition, we prove the equality $\cat(\phi)=\cd(\phi)$ for…

It is well-known that the first order Peano axioms PA have a continuum of non-isomorphic countable models. The question, how close to being isomorphic such countable models can be, seems to be less investigated. A measure of closeness to…

We study limit models in the abstract elementary class of modules with embeddings as algebraic objects. We characterize parametrized noetherian rings using the degree of injectivity of certain limit models. We show that the number of limit…

We establish several strong equivalences of synchronous non-local games, in the sense that the corresponding game algebras are $*$-isomorphic. We first show that the game algebra of any synchronous game on $n$ inputs and $k$ outputs is…

We prove that ample groupoids with sigma-compact unit spaces are equivalent if and only if they are stably isomorphic in an appropriate sense, and relate this to Matui's notion of Kakutani equivalence. We use this result to show that…

In [Sh893], Shelah proves that (on a stationary set of cardinals) an AEC has not too many models or every model has extensions of arbitrary cardinality. We show that, if we assume limited amalgamation, then the second condition holds for a…

In this paper, we explore the 'equivalence principle' (EP): roughly, statements about mathematical objects should be invariant under an appropriate notion of equivalence for the kinds of objects under consideration. In set theoretic…