arXiv subjects
Publications and source records attributed to Levon Haykazyan.
Harold Simmons introduced a pre-nucleus and its associated nucleus that measure the subfitness of a frame in Simmons [2010]. In this paper we continue the study if this pre-nucleus. We answer the questions posed in Simmons [2010].
We characterise the existentially closed models of the theory of exponential fields. They do not form an elementary class, but can be studied using positive logic. We find the amalgamation bases and characterise the types over them. We define a notion of independence and show that independent systems of higher dimension can also be amalgamated. We extend some notions from classification theory to positive logic and position the category of existentially closed exponential fields in the stability hierarchy as NSOP$_1$ but TP$_2$.
We introduce a notion of the space of types in positive model theory based on Stone duality for distributive lattices. We show that this space closely mirrors the Stone space of types in the full first-order model theory with negation (Tarskian model theory). We use this to generalise some classical results on countable models from the Tarskian setting to positive model theory.
The correspondence between definable connected groupoids in a theory $T$ and internal generalised imaginary sorts of $T$, established by Hrushovski in ["Groupoids, imaginaries and internal covers," Turkish Journal of Mathematics, 2012], is here extended in two ways: First, it is shown that the correspondence is in fact an equivalence of categories, with respect to appropriate notions of morphism. Secondly, the equivalence of categories is shown to vary uniformly in definable families, with respect to an appropriate relativisation of these categories. Some elaboration on Hrushovki's original constructions are also included.
It is well known that strongly minimal groups are commutative. Whether this is true for various generalisations of strong minimality has been asked in several different settings (see Hyttinen [2002], Maesono [2007], Pillay and Tanović [2011]). In this note we show that the answer is positive for groups with locally modular homogeneous pregeometries.
Quasiminimal structures play an important role in non-elementary categoricity. In this paper we explore possibilities of constructing quasiminimal models of a given first-order theory. We present several constructions with increasing control of the properties of the outcome using increasingly stronger assumptions on the theory. We also establish an upper bound on the Hanf number of the existence of arbitrarily large quasiminimal models.
There are many different semantics for general logic programs (i.e. programs that use negation in the bodies of clauses). Most of these semantics are Turing complete (in a sense that can be made precise), implying that they are undecidable. To obtain decidability one needs to put additional restrictions on programs and queries. In logic programming it is natural to put restrictions on the underlying first-order language. In this note we show the decidability of the Clark's completion semantics for monadic general programs and queries. To appear in Theory and Practice of Logic Programming (TPLP)
Quasiminimal pregeometry classes were introduces by Zilber [2005a] to isolate the model theoretical core of several interesting examples. He proves that a quasiminimal pregeometry class satisfying an additional axiom, called excellence, is categorical in all uncountable cardinalities. Recently Bays et al. [2014] showed that excellence follows from the rest of axioms. In this paper we present a direct proof of the categoricity result without using excellence.