相关论文: When does elementary bi-embeddability imply isomor…

In this paper we consider the normal modal logics of elementary classes defined by first-order formulas of the form $\forall x_0 \exists x_1 \dots \exists x_n \bigwedge x_i R_\lambda x_j$. We prove that many properties of these logics, such…

In this paper, methods of second order and higher order reverse mathematics are applied to versions of a theorem of Banach that extends the Schroeder-Bernstein theorem. Some additional results address statements in higher order arithmetic…

A potentialist system is a first-order Kripke model based on embeddings. I define the notion of bisimulation for these systems, and provide a number of examples. Given a first-order theory $T$, the system $\mathrm{Mod}(T)$ consists of all…

The main purpose of this paper is to present a new and more uniform model-theoretic/combinatorial proof of the theorem ([5]): The randomization $T^{R}$ of a complete first-order theory $T$ with $NIP$ is a (complete) first-order continuous…

We study the Borel-reducibility of isomorphism relations in the generalized Baire space $\kappa^\kappa$. In the main result we show for inaccessible $\kappa$, that if $T$ is a classifiable theory and $T'$ is superstable with the strong…

We continue the study of the theories of Baldwin-Shi hypergraphs from $[5]$. Restricting our attention to when the rank $\delta$ is rational valued, we show that each countable model of the theory of a given Baldwin-Shi hypergraph is…

This note sketches the extension of the basic characterisation theorems as the bisimulation-invariant fragment of first-order logic to modal logic with graded modalities and matching adaptation of bisimulation. We focus on showing…

We show that Zilber's conjecture that complex exponentiation is isomorphic to his pseudo-exponentiation follows from the a priori simpler conjecture that they are elementarily equivalent. An analysis of the first-order types in…

The following properties are preserved under elementary equivalence, among finitely generated groups: being hyperbolic (possibly with torsion), being hyperbolic and cubulable, and being a subgroup of a hyperbolic group. In other words, if a…

If T is an model complete theory with the strict order property, then the theory of the models of T with an automorphism has no model companion.

A group of order $p^n$ ($p$ prime) has an indecomposable polynomial invariant of degree at least $p^{n-1}$ if and only if the group has a cyclic subgroup of index at most $p$ or it is isomorphic to one of two particular groups of small…

We consider profinite groups as 2-sorted first order structures, with a group sort, and a second sort which acts as an index set for a uniformly definable basis of neighbourhoods of the identity. It is shown that if the basis consists of…

Motivated by team semantics and existential second-order logic, we develop a model-theoretic framework for studying second-order objects such as sets and relations. We introduce a notion of abstract elementary team categories that…

The Schr\"{o}der-Bernstein Theorem for sets is well known. The question of whether two subisomorphic algebraic structures are isomorphic to each other, is of interest. An $R$-module $M$ is said to satisfy the Schr\"{o}der-Bernstein (or SB)…

Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two…

The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…

We classify irreducible representations of the special linear groups in positive characteristic with small weight multiplicities with respect to the group rank and give estimates for the maximal weight multiplicities. For the natural…

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…

This paper proves that a plactic monoid of any finite rank will have decidable first order theory. This resolves other open decidability problems about the finite rank plactic monoids, such as the Diophantine problem and identity checking.…

We establish the following theorem of Bernstein type for the first Heisenberg group: Let S be a C^2 connected H-minimal surface which is a graph over some plane P, then S is either a non-characteristic vertical plane, or its generalized…