相关论文: The strict order property and generic automorphism…

We bound the number of fixed points of an automorphism of a real curve in terms of the genus and the number of connected components of the real part of the curve. Using this bound, we derive some consequences concerning the maximum order of…

We give an example of a countable theory T such that for every cardinal lambda >= aleph_2 there is a fully indiscernible set A of power lambda such that the principal types are dense over A, yet there is no atomic model of T over A. In…

We prove in most cases that a general smooth complete intersection in the projective space has no non-trivial automorphisms.

This paper develops a categorical framework to clarify the relationship between the completeness and compactness theorems in classical first-order logic. Rather than claiming that different model constructions yield naturally isomorphic…

Consider a smooth connected algebraic group $G$ acting on a normal projective variety $X$ with an open dense orbit. We show that Aut($X$) is a linear algebraic group if so is $G$; for an arbitrary $G$, the group of components of Aut($X$) is…

Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…

We prove that given a fixed finite tree $P$, almost all trees contain $P$ as a subtree. Moreover, the inclusion can be made so that it induces an embedding of the corresponding (quantum) automorphism groups, thereby providing generic…

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

We generalise the result of Tent and Ziegler to homogeneous structures that have a stationary independence relation without the symmetry axiom. We apply our result to prove simplicity of the automorphism group of some asymmetric examples…

In this note, we consider models in $\mathbb C^2$. The purpose of this note is twofold. We first show a characterization of models in $\mathbb C^2$ by their noncompact automorphism groups. Then we give an explicit description for…

The inner automorphisms of a group G can be characterized within the category of groups without reference to group elements: they are precisely those automorphisms of G that can be extended, in a functorial manner, to all groups H given…

We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

In this paper we investigate some properties of first order theories which prevent them from having universal models under certain cardinal arithmetic assumptions. Our results give a new syntactical condition, oak property, which is a…

We show that, for each finite algebra A, either it has symmetric term operations of all arities or else some finite algebra in the variety generated by A has two automorphisms without a common fixed point. We also show this two-automorphism…

Let $T$ be a staircase rank-one construction with parameters $r_j \sim j^d$, $0<d<0.2$, then its spectrum does not have the group property, and the symmetric tensor product $T\odot T$ has simple spectrum.

We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…

Let Dtt denote the set of truth-table degrees. A bijection p from Dtt to Dtt is an automorphism if for all truth-table degrees x and y we have x <=tt y if and only if p(x) <=tt p(y). We say an automorphism p is fixed on some cone if there…

This paper builds on no-go theorems to the effect that quantum theory is inconsistent with observations being absolute; that is, unique and non-relative. Unlike the existing no-go results, the one introduced here is based on a…

The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…

We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the…