相关论文: Minimal types in super-dependent theories

In this article, we study feature attributions of Machine Learning (ML) models originating from linear game values and coalitional values defined as operators on appropriate functional spaces. The main focus is on random games based on the…

Superstring models describing curved 4-dimensional magnetic flux tube backgrounds are exactly solvable in terms of free fields. We first consider the simplest model of this type (corresponding to `Kaluza-Klein' Melvin background). Its 2d…

We construct a model complete and o-minimal expansion of the field of real numbers such that, for any planar analytic vector field X and any isolated, non-resonant hyperbolic singularity p of X, a transition map for X at p is definable in…

We prove the Zil'ber Trichotomy Principle for all 1-dimensional structures which are definable in o-minimal ones. In particular, we show that any stable 1-dimensional structure is necessarily locally modular. The main tool is a theory for…

Shifts of finite type and the notion of shadowing, or pseudo-orbit tracing, are powerful tools in the study of dynamical systems. In this paper we prove that there is a deep and fundamental relationship between these two concepts. Let $X$…

Let X be a separated scheme of finite type over an algebraically closed field k and let m be a natural number. By an explicit geometric construction using torsors we construct a pairing between the first mod m Suslin homology and the first…

We give an axiomatization of the class ECF of exponentially closed fields, which includes the pseudo-exponential fields previously introduced by the second author, and show that it is superstable over its interpretation of arithmetic.…

The physical motivations and the basic construction rules for Type I strings and M-theory compactifications are reviewed in light of the recent developments. The first part contains the basic theoretical ingredients needed for building…

We show that a simply connected stable plane with connected lines is isomorphic to an open subplane of a classical projective plane (i.e., a plane over the real or complex numbers, the quaternions or the octonions) if it has that property…

In threshold-linear networks (TLNs), a fixed point is called minimal if no proper subset of its support is also a fixed point. Curto et al (Advances in Applied Mathematics, 2024) conjectured that every stable fixed point of any TLN must be…

For a complete, stable theory $T$ we construct, in a reasonably canonical way, a related stable theory $T^*$ which has higher independent amalgamation properties over the algebraic closure of the empty-set. The theory $T^*$ is an algebraic…

Let R be an associative ring with possible extra structure. R is said to be weakly small if there are countably many 1-types over any finite subset of R. It is locally P if the algebraic closure of any finite subset of R has property P. It…

A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…

Emerging network scenarios require the development of solid large-scale situated systems. Unfortunately, the diffusion/aggregation computational processes therein often introduce a source of complexity that hampers predictability of the…

This paper identifies a new class of shape invariant models. These models are based on extensions of conventional quantum mechanics that satisfy a string-motivated minimal length uncertainty relation. An important feature of our…

Every o-minimal expansion R-tilde of the real field has an o-minimal expansion P(R-tilde) in which the solutions to Pfaffian equations with definable C^1 coefficients are definable.

We characterise the existentially closed models of the theory of exponential fields. They do not form an elementary class, but can be studied using positive logic. We find the amalgamation bases and characterise the types over them. We…

We study two notions of being well-structured for classes of graphs that are inspired by classic model theory. A class of graphs $C$ is monadically stable if it is impossible to define arbitrarily long linear orders in vertex-colored graphs…

A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…

We study the coherence and conservativity of extensions of dependent type theories by additional strict equalities. By considering notions of congruences and quotients of models of type theory, we reconstruct Hofmann's proof of the…