Related papers: NSOP$_1$-like independence in AECats

This paper analyzes independence concepts for sets of probability measures associated with directed acyclic graphs. The paper shows that epistemic independence and the standard Markov condition violate desirable separation properties. The…

We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…

Life continuously changes its own components and states at each moment through interaction with the external world, while maintaining its own individuality in a cyclical manner. Such a property, known as "autonomy," has been formulated…

Independence logic cannot be effectively axiomatized. However, first-order consequences of independence logic sentences can be axiomatized. In this article we give an explicit axiomatization and prove that it is complete in this sense. The…

We identify a canonical structure J associated to any first-order theory, the {\it space of definability patterns}. It generalizes the imaginary algebraic closure in a stable theory, and the hyperimaginary bounded closure in simple…

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…

For all n > 0 there is a homomorphism from the smooth concordance group of knots in dimension 2n + 1 to an algebraically defined group called the rational algebraic concordance group. This algebraic concordance group splits as a direct sum…

Lyapunov's theorem provides a foundational characterization of stable equilibrium points in dynamical systems. In this paper, we develop a framework for stability for F-coalgebras. We give two definitions for a categorical setting in which…

We prove in this note a stabilized version of a conjecture on $\A^1$-connectedness. For the stabilized version of this conjecture, we introduce the notion of stable $\A^1$-connectedness, which is can be seen as the stabilization of…

This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of set theory consists in establishing a refined version of Friedman's theorem on…

We show that in the category of preordered sets, there is a natural notion of pretorsion theory, in which the partially ordered sets are the torsion-free objects and the sets endowed with an equivalence relation are the torsion objects.…

By Fagin's Theorem, NP contains precisely those problems that can be described by formulas starting with an existential second-order quantifier, followed by only first-order quantifiers (ESO formulas). Subsequent research refined this…

In [Appl. Comput. Harmon. Anal., 46(3):664-673, 2019], O. Christensen and M. Hasannasab observed that assuming the existence of an operator $T$ sending $e_n$ to $e_{n+1}$ for all $n \in \mathbb{N}$ (where $(e_n)_{n \in \mathbb{N}}$ is a…

Local consistency arises in diverse areas, including Bayesian statistics, relational databases, and quantum foundations, and so does the notion of functional dependence. We adopt a general approach to study logical inference in a setting…

In the literature there are two different notions of lovely pairs of a theory T, according to whether T is simple or geometric. We introduce a notion of lovely pairs for an independence relation, which generalizes both the simple and the…

A theory is NIP (resp. stable) if and only if every formula with parameters in two single variables is NIP (resp. does not have the order property).

This is the third in a series math.AG/0312190, math.AG/0503029, math.AG/0410268 on configurations in an abelian category A. Given a finite partially ordered set (I,<), an (I,<)-configuration (\sigma,\iota,\pi) is a finite collection of…

The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…

We study the generalization of the G/G/1 queue obtained by relaxing the assumption of independence between inter-arrival times and service requirements. The analysis is carried out for the class of multivariate matrix exponential…

We introduce notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the first is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary…