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)

§ 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 show how to encode, by classical structures, both the objects and the morphisms of the category of complete metric spaces and uniformly continuous maps. The result is a category of, what we call, cognate metric spaces and cognate maps. We show this category relativizes to all models of set theory. We extend this encoding to an encoding of complete metric structures by classical structures. This provide us with a general technique for translating results about (...) infinitary logic on classical structures to the setting of infinitary continuous logic on continuous structures. Our encoding will also allow us to talk about not only the relations between complete metric structures, but also the potential relations between complete metric structures, i.e. those which are satisfied in some larger model of set theory. For example we will show that given any two complete metric structures we can determine if they are potentially isomorphic by looking at any admissible set which contains them both. (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 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)

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)

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.

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)

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 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)

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)

This manuscript investigates fixed point of single-valued Hardy-Roger’s type F -contraction globally as well as locally in a convex b -metric space. The paper, using generalized Mann’s iteration, iterates fixed point of the abovementioned contraction; however, the third axiom of the F -contraction is removed, and thus the mapping F is relaxed. An important approach used in the article is, though a subset closed ball of a complete convex b -metric space is not necessarily (...) class='Hi'>complete, the convergence of the Cauchy sequence is confirmed in the subset closed ball. The results further lead us to some important corollaries, and examples are produced in support of our main theorems. The paper most importantly presents application of our results in finding solution to the integral equations. (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.

§1. Introduction. Asymptotic cones of metric spaces were first invented by Gromov. They are metric spaces which capture the ‘large-scale structure’ of the underlying metric space. Later, van den Dries and Wilkie gave a more general construction of asymptotic cones using ultrapowers. Certain facts about asymptotic cones, like the completeness of the metric space, now follow rather easily from saturation properties of ultrapowers, and in this survey, we want to present two applications of the (...) van den Dries-Wilkie approach. Using ultrapowers we obtain an explicit description of the asymptotic cone of a semisimple Lie group. From this description, using semi-algebraic groups and non-standard methods, we can give a short proof of the Margulis Conjecture. In a second application, we use set theory to answer a question of Gromov.§2. Definitions. The intuitive idea behind Gromov's concept of an asymptotic cone was to look at a given metric space from an ‘infinite distance’, so that large-scale patterns should become visible. In his original definition this was done by gradually scaling down the metric by factors 1/nfornϵ ℕ. In the approach by van den Dries and Wilkie, this idea was captured by ultrapowers. Their construction is more general in the sense that the asymptotic cone exists for any metric space, whereas in Gromov's original definition, the asymptotic cone existed only for a rather restricted class of spaces. (shrink)

This paper studies the metric structure of the space Hr of absolutely summable sequences of real numbers with at most r nonzero terms. Hr is complete, and is located and nowhere dense in the space of all absolutely summable sequences. Totally bounded and compact subspaces of Hr are characterized, and large classes of located, totally bounded, compact, and locally compact subspaces are constructed. The methods used are constructive in the strict sense. MSC: 03F65, 54E50.

Strengthening a theorem of Hjorth this paper gives a new characterization of which Polish groups admit compatible complete left invariant metrics. As a corollary it is proved that any Polish group without a complete left invariant metric has a continuous action on a Polish space whose associated orbit equivalence relation is not essentially countable.

For [Formula: see text], the coarse similarity class of A, denoted by [Formula: see text], is the set of all [Formula: see text] such that the symmetric difference of A and B has asymptotic density 0. There is a natural metric [Formula: see text] on the space [Formula: see text] of coarse similarity classes defined by letting [Formula: see text] be the upper density of the symmetric difference of A and B. We study the metric space (...) of coarse similarity classes under this metric, and show in particular that between any two distinct points in this space there are continuum many geodesic paths. We also study subspaces of the form [Formula: see text] where [Formula: see text] is closed under Turing equivalence, and show that there is a tight connection between topological properties of such a space and computability-theoretic properties of [Formula: see text]. We then define a distance between Turing degrees based on Hausdorff distance in the metric space [Formula: see text]. We adapt a proof of Monin to show that the Hausdorff distances between Turing degrees that occur are exactly 0, [Formula: see text], and 1, and study which of these values occur most frequently in the senses of Lebesgue measure and Baire category. We define a degree a to be attractive if the class of all degrees at distance [Formula: see text] from a has measure 1, and dispersive otherwise. In particular, we study the distribution of attractive and dispersive degrees. We also study some properties of the metric space of Turing degrees under this Hausdorff distance, in particular the question of which countable metric spaces are isometrically embeddable in it, giving a graph-theoretic sufficient condition for embeddability. Motivated by a couple of issues arising in the above work, we also study the computability-theoretic and reverse-mathematical aspects of a Ramsey-theoretic theorem due to Mycielski, which in particular implies that there is a perfect set whose elements are mutually 1-random, as well as a perfect set whose elements are mutually 1-generic. Finally, we study the completeness of [Formula: see text] from the perspectives of computability theory and reverse mathematics. (shrink)

We prove that the set of all Polish groups admitting a compatible complete left-invariant metric (called CLI) is coanalytic non-Borel as a subset of a standard Borel space of all Polish groups. As an application of this result, we show that there does not exist a weakly universal CLI group. This, in particular, answers in the negative a question of H.Becker.

We show that the set of points of an overt closed subspace of a metric completion of a Bishop-locally compact metric space is located. Consequently, if the subspace is, moreover, compact, then its collection of points is Bishop-compact. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

In recent years, model theory has widened its scope to include metric structures by considering real-valued models whose underlying set is a complete metric space. We show that it is possible to carry out this work by giving presentation theorems that translate the two main frameworks into discrete settings. We also translate various notions of classification theory.

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 radiusr’ 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)

Two real-valued deduction schemes are introduced, which agree on $\vdash \triangle$ but not on $\Gamma \vdash \triangle$ , where Δ and ▵ are finite sets of formulae. Using the first scheme we axiomatize real-valued equality so that it induces metrics on the domains of appropriate structures. We use the second scheme to reduce substitutivity of equals to uniform continuity, with respect to the metric equality, of interpretations of predicates in structures. This continuity extends from predicates to arbitrary formulae and (...) the appropriate models have completions resembling analytic completions of metric spaces. We provide inference rules for the two deductions and discuss definability of each of them by means of the other. (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 work concerns constructive aspects of measure theory. By considering metric completions of Boolean algebras – an approach first suggested by Kolmogorov – one can give a very simple construction of e.g. the Lebesgue measure on the unit interval. The integration spaces of Bishop and Cheng turn out to give examples of such Boolean algebras. We analyse next the notion of Borel subsets. We show that the algebra of such subsets can be characterised in a pointfree and constructive way (...) by an initiality condition. We then use our work to define in a purely inductive way the measure of Borel subsets. (shrink)

Under the axiom of choice, every first countable space is a Fréchet-Urysohn space. Although, in its absence even ℝ may fail to be a sequential space.Our goal in this paper is to discuss under which set-theoretic conditions some topological classes, such as the first countable spaces, the metric spaces, or the subspaces of ℝ, are classes of Fréchet-Urysohn or sequential spaces.In this context, it is seen that there are metric spaces which are not sequential spaces. (...) This fact raises the question of knowing if the completion of a metric space exists and it is unique. The answer depends on the definition of completion.Among other results it is shown that: every first countable space is a sequential space if and only if the axiom of countable choice holds, the sequential closure is idempotent in ℝ if and only if the axiom of countable choice holds for families of subsets of ℝ, and every metric space has a unique equation image-completion. (shrink)

This paper gives a formalization of general topology in second-order arithmetic using countably based MF spaces. This formalization is used to study the reverse mathematics of general topology. For each poset P we let MF denote the set of maximal filters on P endowed with the topology generated by {Np | p ∈ P}, where Np = {F ∈ MF | p ∈ F}. We define a countably based MF space to be a space of the form MF (...) for some countable poset P. The class of countably based MF spaces includes all complete separable metric spaces as well as many nonmetrizable spaces. The following reverse mathematics results are obtained. The proposition that every nonempty Gδ subset of a countably based MF space is homeomorphic to a countably based MF space is equivalent to [Formula: see text] over ACA0. The proposition that every uncountable closed subset of a countably based MF space contains a perfect set is equivalent over [Formula: see text] to the proposition that [Formula: see text] is countable for all A ⊆ ℕ. The proposition that every regular countably based MF space is homeomorphic to a complete separable metric space is equivalent to [Formula: see text] over [Formula: see text]. (shrink)

This textbook is designed for an Introduction to Proofs course organized around the themes of number and space. Concepts are illustrated using both geometric and number examples, while frequent analogies and applications help build intuition and context in the humanities, arts, and sciences. Sophisticated mathematical ideas are introduced early and then revisited several times in a spiral structure, allowing students to progressively develop rigorous thinking. Throughout, the presentation is enlivened with whimsical illustrations, apt quotations, and glimpses of mathematical history (...) and culture. Early chapters integrate an introduction to sets, logic, and beginning proof techniques with a first exposure to more advanced mathematical structures. The middle chapters focus on equivalence relations, functions, and induction. Carefully chosen examples elucidate familiar topics, such as natural and rational numbers and angle measurements, as well as new mathematics, such as modular arithmetic and beginning graph theory. The book concludes with a thorough exploration of the cardinalities of finite and infinite sets and, in two optional chapters, brings all the topics together by constructing the real numbers and other complete metric spaces. Designed to foster the mental flexibility and rigorous thinking needed for advanced mathematics, Introduction to Mathematics suits either a lecture-based or flipped classroom. A year of mathematics, statistics, or computer science at the university level is assumed, but the main prerequisite is the willingness to engage in a new challenge. (shrink)

A notion of completeness and completion suitable for use in the absence of countable choice is developed. This encompasses the construction of the real numbers as well as the completion of an arbitrary metric space. The real numbers are characterized as a complete Archimedean Heyting field, a terminal object in the category of Archimedean Heyting fields.

In the topological semantics for modal logic, S4 is well known to be complete for the rational line and for the real line: 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 strongly complete, for the rational line. But no similarly easy amendment is available for the real line. In an earlier paper, we (...) proved a general theorem: S4 is strongly complete for any dense-in-itself metric space. Strong completeness for the real line is a special case. In the current paper, we give a proof of strong completeness tailored to the special case of the real line: the current proof is simpler and more accessible than the proof of the more general result and involves slightly different techniques. We proceed in two steps: first, we show that S4 is strongly complete for the space of finite and infinite binary sequences, equipped with a natural topology; and then we show that there is an interior map from the real line onto this space. (shrink)

We study in a constructive manner some problems of topology related to the set Irr of irrational reals. The constructive approach requires a strong notion of an irrational number; constructively, a real number is irrational if it is clearly different from any rational number. We show that the set Irr is one-to-one with the set Dfc of infinite developments in continued fraction . We define two extensions of Irr, one, called Dfc1, is the set of dfc of rationals and irrationals (...) preserving for each rational one dfc, the other, called Dfc2, is the set of dfc of rationals and irrationals preserving for each rational its two dfc. We introduce six natural distances over Irr wich we denote by dfc0, dfc1, dfc2, d, dmir and dcut. We show that only the four distances dfco, dfc1, d and dmir among the six make Irr a complete metric space. The last distances define in Irr the same topology in a constructive sens. We study further the set Dfc1 in which we show that the irrationals constitute a closed subset. Finally, we make a particular study of the completion Dfc2 of Dfc for the two equivalent metrics dfc2 and dcut. (shrink)

-/- Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) to various natural classes of complete metric structures (such as probability algebras, Hilbert spaces, and Banach spaces). With research in continuous first-order logic preoccupied with studying the model theory of this framework, we find a natural question calls for attention. Is there an interesting set of axioms yielding a completeness result? -/- The (...) primary purpose of this article is to show that a certain, interesting set of axioms does indeed yield a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely) satisfiable if (and only if) it is consistent. From this result it follows that continuous first-order logic also satisfies an approximated form of strong completeness, whereby Σ⊧φ (if and) only if Σ⊢φ ∸2−n for all n < ω. This approximated form of strong completeness asserts that if Σ⊧φ, then proofs from Σ, being finite, can provide arbitrarily better approximations of the truth of φ. -/- Additionally, we consider a different kind of question traditionally arising in model theory—that of decidability. When is the set of all consequences of a theory (in a countable, recursive language) recursive? Say that a complete theory T is decidable if for every sentence φ, the value φ T is a recursive real, and moreover, uniformly computable from φ. If T is incomplete, we say it is decidable if for every sentence φ the real number φ T o is uniformly recursive from φ, where φ T o is the maximal value of φ consistent with T. As in classical first-order logic, it follows from the completeness theorem of continuous first-order logic that if a complete theory admits a recursive (or even recursively enumerable) axiomatization then it is decidable. (shrink)

The Dedekind cuts in an ordered set form a set in the sense of constructive Zermelo—Fraenkel set theory. We deduce this statement from the principle of refinement, which we distill before from the axiom of fullness. Together with exponentiation, refinement is equivalent to fullness. None of the defining properties of an ordering is needed, and only refinement for two—element coverings is used. In particular, the Dedekind reals form a set; whence we have also refined an earlier result by Aczel and (...) Rathjen, who invoked the full form of fullness. To further generalise this, we look at Richman's method to complete an arbitrary metric space without sequences, which he designed to avoid countable choice. The completion of a separable metric space turns out to be a set even if the original space is a proper class; in particular, every complete separable metric space automatically is a set. (shrink)

It has been known for long time that the cosmic sound wave was there since the early epoch of the Universe. Signatures of its existence are abound. However, such an acoustic model of cosmology is rarely developed fully into a complete framework from the notion of space, cancer therapy up to the sky. This paper may be the first attempt towards such a complete description of the Universe based on classical wave equation of sound. It is argued (...) that one can arrive at a consistent description of space, elementary particles, Sachs-Wolfe acoustic theorem, up to a novel approach for cancer therapy, starting from this simple classical wave equation of sound. We also discuss a plausible extension of Acoustic Sachs-Wolfe theorem based on its analogue with Klein-Gordon equation to become Acoustic Sachs-Wolfe-Christianto-Smarandache-Umniyati (ASWoCSU) equation. It is our hope that the new proposed equation can be verified with observation data. But we admit that our model is still in its infancy, more researches are needed to fill all the missing details. (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.

We investigate the Ramsey theory of continuous graph-structures on complete, separable metric spaces and apply the results to the problem of covering a plane by functions. Let the homogeneity number[Formula: see text] of a pair-coloring c:[X]2→2 be the number of c-homogeneous subsets of X needed to cover X. We isolate two continuous pair-colorings on the Cantor space 2ω, c min and c max, which satisfy [Formula: see text] and prove: Theorem. For every Polish space X and (...) every continuous pair-coloringc:[X]2→2with[Formula: see text], [Formula: see text] There is a model of set theory in which[Formula: see text]and[Formula: see text]. The consistency of [Formula: see text] and of [Formula: see text] follows from [20]. We prove that [Formula: see text] is equal to the covering number of 2 by graphs of Lipschitz functions and their reflections on the diagonal. An iteration of an optimal forcing notion associated to c min gives: Theorem. There is a model of set theory in which ℝ2 is coverable byℵ1graphs and reflections of graphs of continuous real functions; ℝ2 is not coverable byℵ1graphs and reflections of graphs of Lipschitz real functions. Figure 1.1 in the introduction summarizes the ZFC results in Part I of the paper. The independence results in Part II show that any two rows in Fig. 1.1 can be separated if one excludes [Formula: see text] from row. (shrink)

Curved multi-dimensional space-times (5D and higher) are constructed by embedding them in one higher-dimensional flat space. The condition that the embedding coordinates have a separable form, plus the demand of an orthogonal resulting space-time, implies that the curved multi-dimensional space-time has 4D de-Sitter subspaces (for constant extra-dimensions) in which the 3D subspace has an accelerated expansion. A complete determination of the curved multi-dimensional spacetime geometry is obtained provided we impose a new type of “equivalence principle”, (...) meaning that there is a geodesic which from the embedding space has a rectliniar motion. According to this new equivalence principle, we can find the extra-dimensions metric components, each curved multi-dimensional spacetime surface’s equation, the energy-momentum tensors and the extra-dimensions as functions of a scalar field. The generic geodesic in each 5D spacetime are studied: they include solutions where particle’s motion along the extra-dimension is periodic and the 3D expansion factor is inflationary (accelerated expansion). Thus, the 3D subspace has an accelerated expansion. (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)

Special relativity has changed the fundamental view on space and time since Einstein introduced it in 1905. It substitutes four dimensional spacetime for the absolute space and time of Newtonian mechanics. It is believed that the validities of Lorentz invariants are fully confirmed empirically for the last one hundred years and therefore its status are canonical underlying all physical principles. However, spacetime metric is a geometric approach on nature when we interpret the natural phenomenon. A geometric flaw (...) on this will be exhibited and the alternative is suggested. The reasonable geometric model of space and time is a three dimensional space which is translating along the time direction. This model legitimately represents the true characteristic of nature. (shrink)

It is folklore that if a continuous function on a complete metric space has approximate roots and in a uniform manner at most one root, then it actually has a root, which of course is uniquely determined. Also in Bishop's constructive mathematics with countable choice, the general setting of the present note, there is a simple method to validate this heuristic principle. The unique solution even becomes a continuous function in the parameters by a mild modification of (...) the uniqueness hypothesis. Moreover, Brouwer's fan theorem for decidable bars turns out to be equivalent to the statement that, for uniformly continuous functions on a compact metric space, the crucial uniform “at most one” condition follows from its non-uniform counterpart. This classification in the spirit of the constructive reverse mathematics, as propagated by Ishihara and others, sharpens an earlier result obtained jointly with Berger and Bridges. (shrink)

This article reviews experimental evidence for a specific sensorimotor function which can be dissociated from higher level representations of space. It attempts to delineate this function on the basis of results obtained by psychophysical experiments performed with brain damaged and healthy subjects. Eye and hand movement control exhibit automatic features, such that they are incompatible with conscious control. In addition, they rely on a reference frame different from the one used by conscious perception. Neuropsychological cases provide a strong support (...) for this specific motor representation of space, which can be spared in patients with lesions of primary sensory systems who have lost conscious perception of visual, tactile or proprioceptive stimuli. Observation of these patients also showed that their motor behavior can be ''attracted'' by a goal only under specific conditions, that is, when the response is immediate and when no cognitive representation of this goal is elaborated at the same time. Beyond the issue of the dissociation between an implicit motor representation and more cognitive processing of spatial information, the issue of the interaction between these two systems is thus a matter of interest. It is suggested that the conscious, cognitive representation of a stimulus can contaminate or override the short-lived motor representation, but no reciprocal influence seem to occur. The interaction observed in patients can also be investigated in normals. The literature provides examples of interaction between sensorimotor and cognitive framing of space, which confirm that immediate action is not mediated by the same system as delayed action, and that elaborating a categorial representation of the action goal prevents the expression of the short-lived sensorimotor representation. It is concluded that action can be controlled by a sensory system which is specialized for on-line processing of relevant goal characteristics. The temporal constraints of this system are such that it can affect the action before a full sensory analysis of this goal has been completed. The performance obtained on the basis of this spatial sensory processing suggests that short-lived motor representations may rather be considered as real ''presentation'' of the action world, which share its metric properties. (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)

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 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)

A metric space is said to be locally non-compact if every neighborhood contains a sequence that is eventually bounded away from every element of the space, hence contains no accumulation point. We show within recursive mathematics that a nonvoid complete metric space is locally non-compact iff it is without isolated points.The result has an interesting consequence in computable analysis: If a complete metric space has a computable witness that it is without (...) isolated points, then every neighborhood contains a computable sequence that is eventually computably bounded away from every computable element of the space. (shrink)