DOIAbstract
AbstractWe prove a dichotomy theorem for minimal structures and use it to prove that the number of non-isomorphic countable elementary extensions of an arbitrary countable, infinite first-order structure is infinite
AbstractWe prove a dichotomy theorem for minimal structures and use it to prove that the number of non-isomorphic countable elementary extensions of an arbitrary countable, infinite first-order structure is infinite
AbstractConsidering an arbitrary relational structure on an infinite groundset, we analyze the impli...
Abstract. We study the history and recent developments in non-elementary classes. We discuss the rol...
AbstractAn elementary proof is presented of an asymptotic estimate for the number (up to isomorphism...
AbstractWe prove a dichotomy theorem for minimal structures and use it to prove that the number of n...
Abstract. An infinite first-order structure is minimal if its each definable subset is either finite...
A b s t r a c t. We investigate minimal first-order structures and consider interpretability and def...
Abstract. We partially describe minimal, first-order structures which have a strong form of the stri...
We prove that there exists a structure M whose monadic second order theory is decidable, and such th...
We prove that there exists a structure M whose monadic second order theory is decidable, and such th...
We investigate minimal rst-order structures and consider interpretability and denability of ordering...
AbstractLet T be a complete, countable, first-order theory having infinite models. We introduce type...
We generalize a result of Bateman and Erdős concerning partitions, thereby answering a question of ...
Rapport interne LACL 2007-06Given any infinite structure M with a decidable first-order theory, we g...
AbstractIf k is a fixed positive integer, G is a graph with n vertices,υ1, υ2∈G then the property dG...
We prove that first order logic is strictly weaker than fixed point logic over every infinite classe...
AbstractConsidering an arbitrary relational structure on an infinite groundset, we analyze the impli...
Abstract. We study the history and recent developments in non-elementary classes. We discuss the rol...
AbstractAn elementary proof is presented of an asymptotic estimate for the number (up to isomorphism...
AbstractWe prove a dichotomy theorem for minimal structures and use it to prove that the number of n...
Abstract. An infinite first-order structure is minimal if its each definable subset is either finite...
A b s t r a c t. We investigate minimal first-order structures and consider interpretability and def...
Abstract. We partially describe minimal, first-order structures which have a strong form of the stri...
We prove that there exists a structure M whose monadic second order theory is decidable, and such th...
We prove that there exists a structure M whose monadic second order theory is decidable, and such th...
We investigate minimal rst-order structures and consider interpretability and denability of ordering...
AbstractLet T be a complete, countable, first-order theory having infinite models. We introduce type...
We generalize a result of Bateman and Erdős concerning partitions, thereby answering a question of ...
Rapport interne LACL 2007-06Given any infinite structure M with a decidable first-order theory, we g...
AbstractIf k is a fixed positive integer, G is a graph with n vertices,υ1, υ2∈G then the property dG...
We prove that first order logic is strictly weaker than fixed point logic over every infinite classe...
AbstractConsidering an arbitrary relational structure on an infinite groundset, we analyze the impli...
Abstract. We study the history and recent developments in non-elementary classes. We discuss the rol...
AbstractAn elementary proof is presented of an asymptotic estimate for the number (up to isomorphism...
Add to ORKG