SearcharxivSearch

arXiv · 2408.00102

Multidimensional asymptotic classes

Abstract

We develop a general framework (multidimensional asymptotic classes, or m.a.c.s) for handling classes of finite first order structures with a strong uniformity condition on cardinalities of definable sets: The condition asserts that definable families given by a formula \phi(x,y) should take on a fixed number n_\phi of approximate sizes in any M in the class, with those sizes varying with M. The prototype is the class of all finite fields, where the uniformity is given by a theorem of Chatzidakis, van den Dries and Macintyre. It inspired the development of asymptotic classes of finite structures, which this new framework extends. The underlying theory of m.a.c.s is developed, including preservation under bi-interpretability, and a proof that for the m.a.c. condition to hold it suffices to consider formulas \phi(x,y) with x a single variable. Many examples of m.a.c.s are given, including 2-sorted structures (F,V) where V is a vector space over a finite field F possibly equipped with a bilinear form, and an example arising from representations of quivers of finite representation type. We also give examples and structural results for multidimensional exact classes (m.e.c.s), where the definable sets take a fixed number of precisely specified cardinalities, which again vary with M. We also develop a notion of infinite generalised measurable structure, whereby definable sets are assigned values in an ordered semiring. We show that any infinite ultraproduct of a m.a.c. is generalised measurable, that values can be taken in an ordered ring if the m.a.c. is a m.e.c., and explore model-theoretic consequences of generalised measurability. Such a structure cannot have the strict order property, and stability-theoretic properties can be read off from the measures in the semiring.

Explore related subjects

Keep this discovery

BibTeXRIS

Sylvy Anscombe, Dugald Macpherson, Charles Steinhorn, Daniel Wolf. 2024-07-31. Multidimensional asymptotic classes. https://arxiv.org/abs/2408.00102

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO