Related papers: An NIP-like Notion in Abstract Elementary Classes
Was paper 839 in the author's list until winter 2023 when it was divided into three. Part I: We would like to generalize imaginary elements, weight of ortp$(a,M,N), {\mathbf P}$-weight, ${\mathbf P}$-simple types, etc. from [She90, Ch.…
Given a cover $\mathbb{U}$ of a family of smooth complex algebraic varieties, we associate with it a class $\mathcal{U},$ containing $\mathbb{U}$, of structures locally definable in an o-minimal expansion of the reals. We prove that the…
We show that the family of nest algebras with $r$ non-zero nest projections is stable, in the sense that an approximate containment of one such algebra within another is close to an exact containment. We use this result to give a local…
We introduce a new device in the study of abstract elementary classes (AECs): Galois Morleyization, which consists in expanding the models of the class with a relation for every Galois type of length less than a fixed cardinal $\kappa$. We…
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 investigate the entity alignment (EA) problem with unlabeled dangling cases, meaning that partial entities have no counterparts in the other knowledge graph (KG), and this type of entity remains unlabeled. To address this challenge, we…
We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for isomorphism types that we call structural logic: we prove that AECs with intersections correspond…
We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a…
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 characterize, in a purely algebraic manner, certain linear forms, called stable, on a Lie algebra. As an application, we determine the index of a Borel subalgebra of a semi-simple Lie algebra. Finally, we give an example of a parabolic…
We study generically stable measures in the local, NIP context. We show that in this setting, a measure is generically stable if and only if it admits a natural finite approximation.
Parabolic subalgebras $\frak{p}$ of semisimple Lie algebras define a $\Bbb{Z}$-grading of the Lie algebra. If there exists a nilpotent element in the first graded part of $\frak{g}$ on which the adjoint group of $\frak{p}$ acts with a dense…
Let K be an algebraically bounded structure and T be its theory. If T is model complete, then the theory of K endowed with a derivation, denoted by $T^{\delta}$, has a model completion. Additionally, we prove that if the theory T is…
Forking is a central notion of model theory, generalizing linear independence in vector spaces and algebraic independence in fields. We develop the theory of forking in abstract, category-theoretic terms, for reasons both practical (we…
We presents an independence relation on sets, one can define dimension by it, assuming that we have an abstract elementary class with a forking notion that satisfies the axioms of a good frame minus stability.
The relation between (a fragment of) assumption-based argumentation (ABA) and logic programs (LPs) under stable model semantics is well-studied. However, for obtaining this relation, the ABA framework needs to be restricted to being flat,…
Implicit neural networks, a.k.a., deep equilibrium networks, are a class of implicit-depth learning models where function evaluation is performed by solving a fixed point equation. They generalize classic feedforward models and are…
In this paper, we study a stability transfer theorem in d-tame Metric Abstract Elementary classes, in a similar way as in [BaKuVa], but using superstability-like assumptions which involves a new independence notion (Tame Independence)…
Monadic stability and the more general monadic dependence (or NIP) are tameness conditions for classes of logical structures, studied in the 80's in Shelah's classification program in model theory. They recently emerged in algorithmic and…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…