Medium distances of probability-fuzzy points and an application to linear programming
According to the Furstenberg-Zimmer structure theorem, every measure-preserving system has a maximal distal factor, and is weak mixing relative to that factor. Furstenberg and Katznelson used this structural analysis of measure-preserving systems to provide a perspicuous proof of Szemerédi’s theorem. Beleznay and Foreman showed that, in general, the transfinite construction of the maximal distal factor of a separable measure-preserving system can extend arbitrarily far into the countable ordinals....
We define an abstract setting suitable for investigating perturbations of metric structures generalizing the notion of a metric abstract elementary class. We show how perturbation of Hilbert spaces with an automorphism and atomic Nakano spaces with bounded exponent fit into this framework, where the perturbations are built into the definition of the class being investigated. Further, assuming homogeneity and some other properties true in the example classes, we develop a notion of independence for...
We describe how properties of metric groups and of unitary representations of metric groups can be presented in continuous logic. In particular we find -axiomatization of amenability. We also show that in the case of locally compact groups some uniform version of the negation of Kazhdan’s property (T) can be viewed as a union of first-order axiomatizable classes. We will see when these properties are preserved under taking elementary substructures.
We describe restricted and extended versions of the logic of approximation which is meant to handle formally the problems of measurement error and of deduction under conditions of uncertainty. We apply the logic to the foundations of social and behavioral inquiry, axiomatizing in it an inexact similarity predicate which behaves like a metric approximation to identity. In the restricted version of the logic we formulate conditions for the imbeddability of similarity models in the real line, and in...
If (X,d) is a metric space then a map f: X → X is defined to be a weak contraction if d(f(x),f(y)) < d(x,y) for all x,y ∈ X, x ≠ y. We determine the simplest non-closed sets X ⊆ ℝⁿ in the sense of descriptive set-theoretic complexity such that every weak contraction f: X → X is constant. In order to do so, we prove that there exists a non-closed set F ⊆ ℝ such that every weak contraction f: F → F is constant. Similarly, there exists a non-closed set G ⊆ ℝ such that every weak contraction...