Some years ago (see [5], Problem 12.14), we asked if every first order theory having infinite models has a model whose automor-phism group has undecidable theory. In this note, we prove that this is true in a strong form. It will be a consequence of our other theorem that there is a right orderable finitely presented group with insoluble word problem
The concept of model completeness for a first order theory T was first formulated by A. ROBINSON [6]...
We give a model-theoretic treatment of the fundamental results of Kechris-Pestov-Todor\v{c}evi\'{c} ...
AbstractLet T be a complete, countable, first-order theory having infinite models. We introduce type...
AbstractA first order theory T of power λ is called unidimensional if any twoλ+-saturated models of ...
AbstractWe claim that the reduction of Post's Correspondence Problem to the decision problem of a th...
Answering a question of Junker and Ziegler, we construct a countable first order structure which is ...
Abstract. We give necessary and sufficient conditions for the first-order theory of a finitely prese...
The book describes developments on some well-known problems regarding the relationship between order...
Abstract. We give necessary and sufficient conditions for the first-order theory of a finitely prese...
The concept of free as in "free group" is generalized to any first order theory. An interesting clas...
The calculation of the countable model automorphism number for uncountable categorical theories is t...
AbstractA first order theory T of power λ is called unidimensional if any twoλ+-saturated models of ...
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permu...
In this paper we will present a definability theorem for first order logic This theorem is very easy...
The concept of model completeness for a first order theory T was first formulated by A. ROBINSON [6]...
The concept of model completeness for a first order theory T was first formulated by A. ROBINSON [6]...
We give a model-theoretic treatment of the fundamental results of Kechris-Pestov-Todor\v{c}evi\'{c} ...
AbstractLet T be a complete, countable, first-order theory having infinite models. We introduce type...
AbstractA first order theory T of power λ is called unidimensional if any twoλ+-saturated models of ...
AbstractWe claim that the reduction of Post's Correspondence Problem to the decision problem of a th...
Answering a question of Junker and Ziegler, we construct a countable first order structure which is ...
Abstract. We give necessary and sufficient conditions for the first-order theory of a finitely prese...
The book describes developments on some well-known problems regarding the relationship between order...
Abstract. We give necessary and sufficient conditions for the first-order theory of a finitely prese...
The concept of free as in "free group" is generalized to any first order theory. An interesting clas...
The calculation of the countable model automorphism number for uncountable categorical theories is t...
AbstractA first order theory T of power λ is called unidimensional if any twoλ+-saturated models of ...
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permu...
In this paper we will present a definability theorem for first order logic This theorem is very easy...
The concept of model completeness for a first order theory T was first formulated by A. ROBINSON [6]...
The concept of model completeness for a first order theory T was first formulated by A. ROBINSON [6]...
We give a model-theoretic treatment of the fundamental results of Kechris-Pestov-Todor\v{c}evi\'{c} ...
AbstractLet T be a complete, countable, first-order theory having infinite models. We introduce type...