相关论文: A Study of Abstract Elementary Classes in the cont…
We study classes of graded structures satisfying the properties of amalgamation, joint embedding and hereditariness. Given appropriate conditions, we can build a graded analogue of the Fraisse limit. Some examples such as the class of all…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
We give a presentation theorem for continuous first-order logic and Metric Abstract Elementary classes in terms of $L_{\omega_1, \omega}$ and Abstract Elementary Classes, respectively. This presentation is accomplished by analyzing dense…
We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…
Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of…
Graphs are a useful abstraction of image content. Not only can graphs represent details about individual objects in a scene but they can capture the interactions between pairs of objects. We present a method for training a convolutional…
Let K be an Abstract Elementary Class. Under the asusmptions that K has a nicely behaved forking-like notion, regular types and existence of some prime models we establish a decomposition theorem for such classes. The decomposition implies…
We prove a version of a small index property theorem for strong amalgamation classes. Our result builds on an earlier theorem by Lascar and Shelah (in their case, for saturated models of uncountable first-order theories). We then study…
We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank…
For a fixed natural number $n \geq 1$, the Hart-Shelah example is an abstract elementary class (AEC) with amalgamation that is categorical exactly in the infinite cardinals less than or equal to $\aleph_n$. We investigate recently-isolated…
This paper continues the study of superstability in abstract elementary classes (AECs) satisfying the amalgamation property. In particular, we consider the definition of $\mu$-superstability which is based on the local character…
Tame abstract elementary classes are a broad nonelementary framework for model theory that encompasses several examples of interest. In recent years, progress toward developing a classification theory for them have been made. Abstract…
We introduce the framework of AECats (abstract elementary categories), generalising both the category of models of some first-order theory and the category of subsets of models. Any AEC and any compact abstract theory ("cat", as introduced…
We study versions of limit models adapted to the context of *metric abstract elementary classes*. Under categoricity and superstability-like assumptions, we generalize some theorems from [GrVaVi]. We prove criteria for existence and…
We study the bi-embeddability and elementary bi-embeddability relation on graphs under Borel reducibility and investigate the degree spectra realized by this relations. We first give a Borel reduction from embeddability on graphs to…
Abstract argumentation frameworks (AFs) are one of the most studied formalisms in AI. In this work, we introduce a certain subclass of AFs which we call compact. Given an extension-based semantics, the corresponding compact AFs are…
We survey commutative and non-commutative analogs of uniform algebras in the Archimedean settings and also offer some non-Archimedean examples. Constraints on the development of non-complex uniform algebras are also discussed.
Attribute exploration has been investigated in several studies, with particular emphasis on the algorithmic aspects of this knowledge acquisition method. In its basic version the method itself is rather simple and transparent. But when…
This paper is a contribution to "neo-stability" type of result for abstract elementary classes. Under certain set theoretic assumptions, we propose a definition and a characterization of NIP in AECs. The class of AECs with NIP properly…