Dynamic Topological Logic ( $\mathcal{DTL}$ ) is a modal framework for reasoning about dynamical systems, that is, pairs 〈X, f〉 where X is a topological space and f: X → X a continuous function. In this paper we consider the case where X is a metric space. We first show that any formula which can be satisfied on an arbitrary dynamic topological system can be satisfied on one based on a metric space; in fact, (...) this space can be taken to be countable and have no isolated points. Since any metric space with these properties is homeomorphic to the set of rational numbers, it follows that any satisfiable formula can be satisfied on a system based on $\mathbb{Q}$ . We then show that the situation changes when considering complete metric spaces, by exhibiting a formula which is not valid in general but is valid on the class of systems based on a complete metric space. While we do not attempt to give a full characterization of the set of valid formulas on this class we do give a relative completeness result; any formula which is satisfiable on a dynamical system based on a complete metric space is also satisfied on one based on the Cantor space. (shrink)

Using the category of metric spaces as a template, we develop a metric analogue of the categorical semantics of classical/intuitionistic logic, and show that the natural notion of predicate in this “continuous semantics” is equivalent to the a priori separate notion of predicate in continuous logic, a logic which is independently well-studied by model theorists and which finds various applications. We show this equivalence by exhibiting the real interval $[0,1]$ in the category of metric (...) spaces as a “continuous subobject classifier” giving a correspondence not only between the two notions of predicate, but also between the natural notion of quantification in the continuous semantics and the existing notion of quantification in continuous logic.Along the way, we formulate what it means for a given category to behave like the category of metric spaces, and afterwards show that any such category supports the aforementioned continuous semantics. As an application, we show that categories of presheaves of metric spaces are examples of such, and in fact even possess continuous subobject classifiers. (shrink)

In [14], we studied the computational behaviour of various first-order and modal languages interpreted in metric or weaker distance spaces. [13] gave an axiomatisation of an expressive and decidable metric logic. The main result of this paper is in showing that the technique of representing metric spaces by means of Kripke frames can be extended to cover the modal (hybrid) language that is expressively complete over metric spaces for the (undecidable) two-variable fragment of first-order (...) class='Hi'>logic with binary pred-icates interpreting the metric. The frame conditions needed correspond rather directly with a Boolean modal logic that is, again, of the same expressivity as the two-variable fragment. We use this representation to derive an axiomatisation of the modal hybrid variant of the two-variable fragment, discuss the compactness property in distance logics, and derive some results on (the failure of) interpolation in distance logics of various expressive power. (shrink)

It is a classic result (McKinsey & Tarski, 1944; Rasiowa & Sikorski, 1963) that if we interpret modal diamond as topological closure, then the modal logic of any dense-in-itself metric space is the well-known modal system S4. In this paper, as a natural follow-up, we study the modal logic of an arbitrary metric space. Our main result establishes that modal logics arising from metric spaces form the following chain which is order-isomorphic (with respect (...) to the ⊃ relation) to the ordinalω+ 3:$S4.Gr{z_1} \supset S4.Gr{z_2} \supset S4.Gr{z_3} \supset \cdots \,S4.Grz \supset S4.1 \supset S4.$It follows that the modal logic of an arbitrary metric space is finitely axiomatizable, has the finite model property, and hence is decidable. (shrink)

It is shown that for compact metric spaces the following statements are pairwise equivalent: “X is Loeb”, “X is separable”, “X has a we ordered dense subset”, “X is second countable”, and “X has a dense set G = ∪{Gn : n ∈ ω}, ∣Gn∣ < ω, with limn→∞ diam = 0”. Further, it is shown that the statement: “Compact metric spaces are weakly Loeb” is not provable in ZF0 , the Zermelo-Fraenkel set theory without the axiom of (...) regularity, and that the countable axiom of choice for families of finite sets CACfin does not imply the statement “Compact metric spaces are separable”. (shrink)

We study conditions for a topological space to be metrizable, properties of metrizable spaces, and the role the axiom of choice plays in these matters.

The axiom of multiple choice implies that metric spaces are paracompact but the reverse implication cannot be proved in set theory without the axiom of choice.

Computability theoretic aspects of Polish metric spaces are studied by adapting notions and methods of computable structure theory. In this dissertation, we mainly investigate index sets and classification problems for computably presentable Polish metric spaces. We find the complexity of a number of index sets, isomorphism problems, and embedding problems for computably presentable metric spaces. We also provide several computable structure theory results related to some classical Polish metric spaces such as the Urysohn space $\mathbb (...) {U}$, the Cantor space $2^{\mathbb {N}}$, the Baire space $\mathbb {N}^{\mathbb {N}}$, and spaces of continuous functions.Abstract prepared by Teerawat Thewmorakot.E-mail: [email protected]. (shrink)

Fix an integer $r \ge 3$. We consider metric spaces on n points such that the distance between any two points lies in $\left\{ {1, \ldots,r} \right\}$. Our main result describes their approximate structure for large n. As a consequence, we show that the number of these metric spaces is $\left\lceil {{{r + 1} \over 2}} \right\rceil ^{\left + o\left}.$Related results in the continuous setting have recently been proved by Kozma, Meyerovitch, Peled, and Samotij [34]. When r is (...) even, our structural characterization is more precise and implies that almost all such metric spaces have all distances at least $r/2$. As an easy consequence, when r is even, we improve the error term above from $o\left$ to $o\left$, and also show a labeled first-order 0-1 law in the language ${\cal L}_r $, consisting of r binary relations, one for each element of $[r]$. In particular, we show the almost sure theory T is the theory of the Fraïssé limit of the class of all finite simple complete edge-colored graphs with edge colors in $\left\{ {r/2, \ldots,r} \right\}$.Our work can be viewed as an extension of a long line of research in extremal combinatorics to the colored setting, as well as an addition to the collection of known structures that admit logical 0-1 laws. (shrink)

§ 1. Introduction. In this communication we present some recent results on the classification of Polish metric spaces up to isometry and on the isometry groups of Polish metric spaces. A Polish metric space is a complete separable metric space.Our first goal is to determine the exact complexity of the classification problem of general Polish metric spaces up to isometry. This work was motivated by a paper of Vershik [1998], where he remarks : (...) “The classification of Polish spaces up to isometry is an enormous task. More precisely, this classification is not ‘smooth’ in the modern terminology.” Our Theorem 2.1 below quantifies precisely the enormity of this task.After doing this, we turn to special classes of Polish metric spaces and investigate the classification problems associated with them. Note that these classification problems are in principle no more complicated than the general one above. However, the determination of their exact complexity is not necessarily easier.The investigation of the classification problems naturally leads to some interesting results on the groups of isometries of Polish metric spaces. We shall also present these results below.The rest of this section is devoted to an introduction of some basic ideas of a theory of complexity for classification problems, which will help to put our results in perspective. Detailed expositions of this general theory can be found, e.g., in Hjorth [2000], Kechris [1999], [2001]. (shrink)

We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for some languages and spaces, no standard modal deductive system is strongly complete.

We give a systematic technical exposition of the foundations of the theory of computably compact metric spaces. We discover several new characterizations of computable compactness and apply these characterizations to prove new results in computable analysis and effective topology. We also apply the technique of computable compactness to give new and less combinatorially involved proofs of known results from the literature. Some of these results do not have computable compactness or compact spaces in their statements, and thus these applications (...) are not necessarily direct or expected. (shrink)

We show that metric spaces and continuous functions between them are domain representable using the category of Scott-Ershov domains. A notion of effectivity for metric spaces is thereby inherited from effective domain theory. It is shown that a separable metric space with an effective metric can be represented by an effective domain. For a class of spaces, including the Euclidean spaces, the usual notions of effectivity are obtained. The Banach fixed point theorem is a consequence (...) of the least fixed point theorem for domains. A notion of semieffective domains is introduced and used to give a new proof of Ceitin's theorem. (shrink)

We introduce a new Turing machine based concept of time complexity for functions on computable metric spaces. It generalizes the ordinary complexity of word functions and the complexity of real functions studied by Ko [19] et al. Although this definition of TIME as the maximum of a generally infinite family of numbers looks straightforward, at first glance, examples for which this maximum exists seem to be very rare. It is the main purpose of this paper to prove that, nevertheless, (...) the definition has a large number of important applications. Using the framework of TTE [40], we introduce computable metric spaces and computability on the compact subsets. We prove that every computable metric space has a c-proper c-admissible representation. We prove that Turing machine time complexity of a function computable relative to c-admissible c-proper representations has a computable bound on every computable compact subset. We prove that computably compact computable metric spaces have concise c-proper c-admissible representations and show by examples that many canonical representations are of this kind. Finally, we compare our definition with a similar one by Labhalla et al. [22]. Several examples illustrate the concepts. By these results natural and realistic definitions of computational complexity are now available for a variety of numerical problems such as image processing, integration, continuous Fourier transform or wave propagation. (shrink)

Continuous functions on the unit interval are relatively tame from the logical and computational point of view. A similar behaviour is exhibited by continuous functions on compact metric spaces equipped with a countable dense subset. It is then a natural question what happens if we omit the latter ‘extra data’, i.e., work with ‘unrepresented’ compact metric spaces. In this paper, we study basic third-order statements about continuous functions on such unrepresented compact metric spaces in Kohlenbach’s higher-order Reverse (...) Mathematics. We establish that some (very specific) statements are classified in the (second-order) Big Five of Reverse Mathematics, while most variations/generalisations are not provable from the latter, and much stronger systems. Thus, continuous functions on unrepresented metric spaces are ‘wild’, though ‘more tame’ than (slightly) discontinuous functions on the reals. (shrink)

We study Polish spaces for which a set of possible distances $A \subseteq R^+$ is fixed in advance. We determine, depending on the properties of A, the complexity of the collection of all Polish metric spaces with distances in A, obtaining also example of sets in some Wadge classes where not many natural examples are known. Moreover we describe the properties that A must have in order that all Polish spaces with distances in that set belong to a given (...) class, such as zero-dimensional, locally compact, etc. These results lead us to give a fairly complete description of the complexity, with respect to Borel reducibility and again depending on the properties of A, of the relations of isometry and isometric embeddability between these Polish spaces. (shrink)

In this paper we develop a method for finding, under general conditions, explicit and highly uniform rates of convergence for the Picard iteration sequences for selfmaps on bounded metric spaces from ineffective proofs of convergence to a unique fixed point. We are able to extract full rates of convergence by extending the use of a logical metatheorem recently proved by Kohlenbach. In recent case studies we were able to find such explicit rates of convergence in two concrete cases. Our (...) novel method now provides an explanation in logical terms for these findings. This amounts, loosely speaking, to general conditions under which we in this specific setting can transform a ∀∃∀-sentence into a ∀∃-sentence via an argument involving product spaces. This reduction in logical complexity allows us to use the existing machinery to extract quantitative bounds of the sort we need. (shrink)

We show that the countable axiom of choice CAC strictly implies the statements “Lindelöf metric spaces are second countable” “Lindelöf metric spaces are separable”. We also show that CAC is equivalent to the statement: “If is a Lindelöf topological space with respect to the base ℬ, then is Lindelöf”.

In the realm of metric spaces the role of choice principles is investigated.

If is a Polish metric space of dimension 0, then by Wadge’s lemma, no more than two Borel subsets of X are incomparable with respect to continuous reducibility. In contrast, our main result shows that for any metric space of positive dimension, there are uncountably many Borel subsets of that are pairwise incomparable with respect to continuous reducibility. In general, the reducibility that is given by the collection of continuous functions on a topological space \\) (...) is called the Wadge quasi-order for \\). As an application of the main result, we show that this quasi-order, restricted to the Borel subsets of a Polish space \\), is a well-quasiorder if and only if \\) has dimension 0. Moreover, we give further examples of applications of the construction of graph colorings that is used in the proofs. (shrink)

In this paper we will consider two possible definitions of projective subsets of a separable metric space X. A set A subset of or equal to X is Σ11 iff there exists a complete separable metric space Y and Borel set B subset of or equal to X × Y such that A = {x ε X : there existsy ε Y ε B}. Except for the fact that X may not be completely metrizable, this is (...) the classical definition of analytic set and hence has many equivalent definitions, for example, A is Σ11 iff A is relatively analytic in X, i.e., A is the restriction to X of an analytic set in the completion of X. Another definition of projective we denote by ΣX1 or abstract projective subset of X. A set of A subset of or equal to X is ΣX1 iff there exists an n ε ω and a Borel set B subset of or equal to X × Xn such that A = {x ε X:there existsy ε Xn ε B}. These sets ca n be far more pathological. While the family of sets Σ11 is closed under countable intersections and countable unions, there is a consistent example of a separable metric space X where ΣX1 is not closed under countable intersections or countable unions. This takes place in the Cohen real model. Assuming CH, there exists a separable metric space X such that every Σ11 set is Borel in X but there exists a Σ11 set which is not Borel in X2. The space X2 has Borel subsets of arbitrarily large rank while X has bounded Borel rank. This space is a Luzin set and the technique used here is Steel forcing with tagged trees. We give examples of spaces X illustrating the relationship between Σ11 and ΣX1 and give some consistent examples partially answering an abstract projective hierarchy problem of Ulam. (shrink)

If [Formula: see text] is a proper Polish metric space and [Formula: see text] is any countable dense submetric space of [Formula: see text], then the Scott rank of [Formula: see text] in the natural first-order language of metric spaces is countable and in fact at most [Formula: see text], where [Formula: see text] is the Church–Kleene ordinal of [Formula: see text] which is the least ordinal with no presentation on [Formula: see text] computable from [Formula: (...) see text]. If [Formula: see text] is a rigid Polish metric space and [Formula: see text] is any countable dense submetric space, then the Scott rank of [Formula: see text] is countable and in fact less than [Formula: see text]. (shrink)

We introduce a new approach to the model theory of metric structures by defining the notion of a metric abstract elementary class (MAEC) closely resembling the notion of an abstract elementary class. Further we define the framework of a homogeneous MAEC were we additionally assume the existence of arbitrarily large models, joint embedding, amalgamation, homogeneity and a property which we call the perturbation property. We also assume that the Löwenheim-Skolem number, which in this setting refers to the density (...) character of the set instead of the cardinality, is ${\aleph_0}$ . In these settings we prove an analogue of Morley’s categoricity transfer theorem. We also give concrete examples of homogeneous MAECs. (shrink)

In the realm of Lindelöf metric spaces the following results are obtained in : (i) If is a Lindelöf metric space then it is both densely Lindelöf and almost Lindelöf. In addition, under the countable axiom of choice, the three notions coincide. (ii) The statement “every separable metric space is almost Lindelöf” implies that every infinite subset of has a countably infinite subset). (iii) The statement “every almost Lindelöf metric space is quasi totally (...) bounded implies. (iv) The proposition “every quasi totally bounded metric space is separable” lies, in the deductive hierarchy of choice principles, strictly between the countable union theorem and. Likewise, the statement “every pre‐Lindelöf (or Lindelöf) metric space is separable” lies strictly between and. (shrink)

In the topological semantics for modal logic, S4 is well-known to be complete for the rational line, for the real line, and for Cantor space: these are special cases of S4’s completeness for any dense-in-itself metric space. The construction used to prove completeness can be slightly amended to show that S4 is not only complete, but also strongly complete, for the rational line. But no similarly easy amendment is available for the real line or for Cantor (...) space and the question of strong completeness for these spaces has remained open, together with the more general question of strong completeness for any dense-in-itself metric space. In this paper, we prove that S4 is strongly complete for any dense-in-itself metric space. (shrink)

The localic completion of a metric space induces a canonical notion of continuous map between metric spaces. It is shown that these maps are continuous in the sense of Bishop constructive mathematics, i.e., uniformly continuous near every compact image.

We study within the framework of Zermelo-Fraenkel set theory ZF the role that the axiom of choice plays in the theory of Lindelöf metric spaces. We show that in ZF the weak choice principles: Every Lindelöf metric space is separable and Every Lindelöf metric space is second countable are equivalent. We also prove that a Lindelöf metric space is hereditarily separable iff it is hereditarily Lindelöf iff it hold as well the axiom of (...) choice restricted to countable sets and to topologies of Lindelöf metric spaces as the countable union theorem restricted to Lindelöf metric spaces. (shrink)

Although classically every open subspace of a locally compact space is also locally compact, constructively this is not generally true. This paper provides a locally compact remetrization for an open set in a compact metric space and constructs a one-point compactification. MSC: 54D45, 03F60, 03F65.

We develop the general theory of topometric spaces, i.e., topological spaces equipped with a well-behaved lower semi-continuous metric. Spaces of global and local types in continuous logic are the motivating examples for the study of such spaces. In particular, we develop Cantor-Bendixson analysis of topometric spaces, which can serve as a basis for the study of local stability (extending the ad hoc development in Ben Yaacov I and Usvyatsov A, Continuous first order logic and local stability. Trans (...) Am Math Soc, in press), as well as of global ${\aleph_0}$ -stability. We conclude with a study of perturbation systems (see Ben Yaacov I, On perturbations of continuous structures, submitted) in the formalism of topometric spaces. In particular, we show how the abstract development applies to ${\aleph_0}$ -stability up to perturbation. (shrink)

The notion of strong measure zero is studied in the context of Polish groups and general separable metric spaces. An extension of a theorem of Galvin, Mycielski and Solovay is given, whereas the theorem is shown to fail for the Baer–Specker group Zω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathbb{Z}^{\omega}}}$$\end{document}. The uniformity number of the ideal of strong measure zero subsets of a separable metric space is examined, providing solutions to several problems of Miller and (...) Steprāns :52–59, 2006). (shrink)

We propose a logic for reasoning about metric spaces with the induced topologies. It combines the 'qualitative' interior and closure operators with 'quantitative' operators 'somewhere in the sphere of radius r.' including or excluding the boundary. We supply the logic with both the intended metric space semantics and a natural relational semantics, and show that the latter (i) provides finite partial representations of (in general) infinite metric models and (ii) reduces the standard '∈-definitions' of (...) closure and interior to simple constraints on relations. These features of the relational semantics suggest a finite axiomatisation of the logic and provide means to prove its EXPTIME-completeness (even if the rational numerical parameters are coded in binary). An extension with metric variables satisfying linear rational (in)equalities is proved to be decidable as well. Our logic can be regarded as a 'well-behaved' common denominator of logical systems constructed in temporal, spatial, and similarity-based quantitative and qualitative representation and reasoning. Interpreted on the real line (with its Euclidean metric), it is a natural fragment of decidable temporal logics for specification and verification of real-time systems. On the real plane, it is closely related to quantitative and qualitative formalisms for spatial representation and reasoning, but this time the logic becomes undecidable. (shrink)

This paper is a follow up of the author’s programme of characterizing Ramsey classes of structures by a combination of model theory and combinatorics. This relates the classification programme for countable homogeneous structures to the proof techniques of the structural Ramsey theory. Here we consider the classes of topological and metric spaces which recently were studied in the context of extremally amenable groups and of the Urysohn space. We show that Ramsey classes are essentially classes of finite objects (...) only. While for Ramsey classes of topological spaces we achieve a full characterization, for metric spaces this seems to be at present an intractable problem. (shrink)

We present a proof of a Ramsey-type theorem for infinite metric spaces due to Matoušek. Then we show that for every K>1 every uncountable Polish space has a perfect subset that K-bi-Lipschitz embeds into the real line. Finally we study decompositions of infinite separable metric spaces into subsets that, for some K>1, K-bi-Lipschitz embed into the real line.