Related papers: On Approximate Classification of Theories

In this paper we formulate and prove a general theorem of stability of exactness properties under the pro-completion, which unifies several such theorems in the literature and gives many more. The theorem depends on a formal approach to…

We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…

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…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Motivated by bifurcation of branches of homoclinic orbits of dynamical systems, we consider families of first-order equations on the real line and introduce a generalisation of previous index theorems by Pejsachowicz, and by Hu and…

We study links between first-order formulas and arbitrary properties for families of theories, classes of structures and their isomorphism types. Possibilities for ranks and degrees for formulas and theories with respect to given properties…

In this article we give a classification of the binary, simple, $\omega$-categorical structures with SU-rank 1 and trivial pregeometry. This is done both by showing that they satisfy certain extension properties, but also by noting that…

We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…

The goal of this work is to prove a new sure upper bound in a setting that can be thought of as a simplified function field analogue. This result is comparable to a recent result of the author concerning almost sure upper bound of random…

For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…

A choice of first-order variables for the characteristic problem of the linearized Einstein equations is found which casts the system into manifestly well-posed form. The concept of well-posedness for characteristic problems invoked is that…

We develop a theory for describing composite objects in physics. These can be static objects, such as tables, or things that happen in spacetime (such as a region of spacetime with fields on it regarded as being composed of smaller such…

Quasiminimal structures play an important role in non-elementary categoricity. In this paper we explore possibilities of constructing quasiminimal models of a given first-order theory. We present several constructions with increasing…

Let K be an Abstract Elementary Class. Under the asusmptions that K has a nicely behaved forking-like notion, regular types and existence of some prime models we establish a decomposition theorem for such classes. The decomposition implies…

In this paper we define the closure under weak convergence of the class of p-tempered {\alpha}-stable distributions. We give necessary and sufficient conditions for convergence of sequences in this class. Moreover, we show that any element…

In this short note, we mimic the proof of the simplicity of the theory ACFA of generic difference fields in order to provide a criterion, valid for certain theories of pure fields and fields equipped with operators, which shows that a…

We consider the problem of discretizing evolution operators of linear delay equations with the aim of approximating their spectra, which is useful in investigating the stability properties of (nonlinear) equations via the principle of…

Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…

Quantifier-elimination or model-completeness of the affine part of some classical first order theories are proved.

Following some past advances, we reformulate a large class of linear continuum science equations in the format of the extended abstract theory of composites so that we can apply this theory to better understand and efficiently solve those…