Categoricity in hyperarithmetical degrees

We obtain, under certain assumptions, necessary and sufficient conditions for a recursive structure to be Δ⁰_α-categorical. This is done using the author's α-systems to construct suitable Δ⁰_α+1 functions. We show how these results may be applied, for example, to superatomic Boolean algebras.     

Homomorphisms and amalgamation

We prove that for each finite core graph G, the class of all graphs admitting a homomorphism into G is a pseudo-amalgamation class, in the sense of Fraı̈ssé. This fact gives rise to a countably infinite universal pseudo-homogeneous graph which shares some of the properties of the infinite random graph. Our methods apply simultaneously to G-colourings in several classes of relational structures, such as the classes of directed graphs or hypergraphs.     

Categoricity of computable infinitary theories

Computable structures of Scott rank are an important boundary case for structural complexity. While every countable structure is determined, up to isomorphism, by a sentence of , this sentence may not be computable. We give examples, in several familiar classes of structures, of computable structures with Scott rank whose computable infinitary theories are each -categorical. General conditions are given, covering many known methods for constructing computable structures with Scott rank , which guarantee that the resulting structure is a model of an -categorical computable infinitary theory. Work on this paper began at the Workshop on Model Theory and Computable Structure Theory at University of Florida Gainesville, in February, 2007. The authors are grateful to the organizers of this workshop. They are also grateful for financial support from National Science Foundation grants DMS DMS 05-32644, DMS 05-5484. The second author is also grateful for the support of grants RFBR 08-01-00336 and NSc-335.2008.1.     

Semidirect product with an order-computable pseudovariety and tameness

The semidirect product of pseudovarieties of semigroups with an order-computable pseudovariety is investigated. The essential tool is the natural representation of the corresponding relatively free profinite semigroups and how it transforms implicit signatures. Several results concerning the behavior of the operation with respect to various kinds of tameness properties are obtained as applications.     

Failure of tameness for local cohomology

We give an example that shows that not all local cohomology modules are tame in the sense of Brodmann and Hellus.     

Modularity results for interpolation,amalgamation and superamalgamation

Wolter in [38] proved that the Craig interpolation property transfers to fusion of normal modal logics. It is well-known [21] that for such logics Craig interpolation corresponds to an algebraic property called superamalgamability. In this paper, we develop model-theoretic techniques at the level of first-order theories in order to obtain general combination results transferring quantifier-free interpolation to unions of theories over non-disjoint signatures. Such results, once applied to equational theories sharing a common Boolean reduct, can be used to prove that superamalgamability is modular also in the non-normal case. We also state that, in this non-normal context, superamalgamability corresponds to a strong form of interpolation that we call “comprehensive interpolation property” (which consequently transfers to fusions).     

Positivity and tameness in rank 2 cluster algebras

We study the relationship between the positivity property in a rank 2 cluster algebra, and the property of such an algebra to be tame. More precisely, we show that a rank 2 cluster algebra has a basis of indecomposable positive elements if and only if it is of finite or affine type. This statement disagrees with a conjecture by Fock and Goncharov.     

Categoricity in homogeneous complete metric spaces

We introduce a new approach to the model theory of metric structures by defining the notion of a metric abstract elementary class (MAEC) closely resembling the notion of an abstract elementary class. Further we define the framework of a homogeneous MAEC were we additionally assume the existence of arbitrarily large models, joint embedding, amalgamation, homogeneity and a property which we call the perturbation property. We also assume that the Löwenheim-Skolem number, which in this setting refers to the density character of the set instead of the cardinality, is ${\aleph_0}$ . In these settings we prove an analogue of Morley’s categoricity transfer theorem. We also give concrete examples of homogeneous MAECs.