相关论文: Toward classifying unstable theories

We say that a theory $T$ is intermediate under effective reducibility if the isomorphism problems among its computable models is neither hyperarithmetic nor on top under effective reducibility. We prove that if an infinitary sentence $T$ is…

We characterize several large cardinal notions by model-theoretic properties of extensions of first-order logic. We show that $\Pi_n$-strong cardinals, and, as a corollary, ``Ord is Woodin" and weak Vop\v{e}nka's Principle, are…

In this paper we study fundamental directional properties of sets under the assumption of condition (SSP) (introduced in a previous paper). We show several transversality theorems in the singular case and an (SSP)-structure preserving…

Artificial Intelligence (AI) has long pursued models, theories, and techniques to imbue machines with human-like general intelligence. Yet even the currently predominant data-driven approaches in AI seem to be lacking humans' unique ability…

The prevalent interpretation of G\"odel's Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of…

An important dividing line in the class of unstable theories is being NSOP$_1$, which is more general than being simple. In NSOP$_1$ theories forking independence may not be as well-behaved as in stable or simple theories, so it is replaced…

We propose a framework for model-theoretic stability and simplicity in an approximate first-order setting and generalize some classical results.

A first-principles theory is developed for the general evolution of a key structural characteristic of planar granular systems - the cell order distribution. The dynamic equations are constructed and solved in closed form for a number of…

Many set theorists point to the linearity phenomenon in the hierarchy of consistency strength, by which natural theories tend to be linearly ordered and indeed well ordered by consistency strength. Why should it be linear? In this paper I…

Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…

We study stable like behaviour in first order theories without the independence property. We introduce generically stable measures, give characterizatiions, and show their ubiquity. We also introduce generic compact domination. We also…

We prove that the stable category associated with the category $\mathsf{PreOrd}(\mathbb C)$ of internal preorders in a pretopos $\mathbb C$ satisfies a universal property. The canonical functor from $\mathsf{PreOrd}(\mathbb C)$ to the…

The purpose of this article is to introduce the concept of invariance and its properties. These properties can be used to check the primality of a number. Combining these properties with the Euler theorem, it is possible to generalize this…

Generalizing Keisler's notion of regularity for ultrafilters, Taylor introduced degrees of regularity for ideals and showed that a countably complete nonregular ideal on $\omega_1$ must be somewhere $\omega_1$-dense. We prove a dichotomy…

We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…

We observe that the definition of Shelah's classical $\mathrm{NSOP}_{n}$ hierarchy for first-order theories, for integers $n \geq 3$, can be restated so that it extends to the case where $n$ is replaced with any real number $r \geq 3$.…

Shelah showed that the existence of free subsets over internally approachable subalgebras follows from the failure of the PCF conjecture on intervals of regular cardinals. We show that a stronger property called the Approachable Bounded…

We give several characterizations of when a complete first-order theory $T$ is monadically NIP, i.e. when expansions of $T$ by arbitrary unary predicates do not have the independence property. The central characterization is a condition on…

We prove that for every simple theory $T$ (or even simple thick compact abstract theory) there is a (unique) compact abstract theory $T^\fP$ whose saturated models are the lovely pairs of $T$. Independence-theoretic results that were proved…

We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself),…