We examine the sequences A that are low for dimension, i.e. those for which the effective dimension relative to A is the same as the unrelativized effective dimension. Lowness for dimension is a weakening of lowness for randomness, a central notion in effective randomness. By considering analogues of characterizations of lowness for randomness, we show that lowness for dimension can be characterized in several ways. It is equivalent to lowishness for randomness, namely, that every Martin-Löf (...) random sequence has effective dimension 1 relative to A, and lowishness for K, namely, that the limit of KA/K is 1. We show that there is a perfect [Formula: see text]-class of low for dimension sequences. Since there are only countably many low for random sequences, many more sequences are low for dimension. Finally, we prove that every low for dimension is jump-traceable in order nε, for any ε > 0. (shrink)

It is shown that there exist subsets A and B of the real line which are recursively constructible such that A has a nonrecursive Hausdorff dimension and B has a recursive Hausdorff dimension but has a finite, nonrecursive Hausdorff measure. It is also shown that there exists a polynomial-time computable curve on the two-dimensional plane that has a nonrecursive Hausdorff dimension between 1 and 2. Computability of Julia sets of computable functions on the (...) real line is investigated. It is shown that there exists a polynomial-time computable function f on the real line whose Julia set is not recurisvely approximable. (shrink)

This paper seeks to build on the extensive connections that have arisen between automata theory, combinatorics on words, fractal geometry, and model theory. Results in this paper establish a characterization for the behavior of the fractal geometry of “k-automatic” sets, subsets of $[0,1]^d$ that are recognized by Büchi automata. The primary tools for building this characterization include the entropy of a regular language and the digraph structure of an automaton. Via an analysis of the strongly connected components of such a (...) structure, we give an algorithmic description of the box-counting dimension, Hausdorff dimension, and Hausdorff measure of the corresponding subset of the unit box. Applications to definability in model-theoretic expansions of the real additive group are laid out as well. (shrink)

Classical fractal dimensions have recently been effectivized by characterizing them in terms of real-valued functions called gales, and imposing computability and complexity constraints on these gales. This paper surveys these developments and their applications in algorithmic information theory and computational complexity theory.

In the context of Kolmogorov's algorithmic approach to the foundations of probability, Martin‐Löf defined the concept of an individual random sequence using the concept of a constructive measure 1 set. Alternate characterizations use constructive martingales and measures of impossibility. We prove a direct conversion of a constructive martingale into a measure of impossibility and vice versa such that their success sets, for a suitably defined class of computable probability measures, are equal. The direct conversion is then generalized to give a (...) new characterization of constructive dimensions, in particular, the constructive Hausdorff dimension, the constructive packing dimension, and their generalizations, the constructive scaled dimension and the constructive scaled strong dimension (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

Different summarized shape indices, like mean shape index (MSI) and area weighted mean shape index (AWMSI) can change over multiple size scales. This variation is important to describe scale heterogeneity of landscapes, but the exact mathematical form of the dependence is rarely known. In this paper, the use of fractal geometry (by the perimeter and area Hausdorff dimensions) made us able to describe the scale dependence of these indices. Moreover, we showed how fractal dimensions can be deducted from existing (...) MSI and AWMSI data. In this way, the equality of a multiscale tabulated MSI and AWMSI dataset and two scale-invariant fractal dimensions has been demonstrated. (shrink)

Recently, the Dimension Problem for effective Hausdorff dimension was solved by J. Miller in [14], where the author constructs a Turing degree of non-integral Hausdorff dimension. In this article we settle the Dimension Problem for effective packing dimension by constructing a real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one (on the other hand, it is known via [10, 3, 7] that every (...) real of strictly positive effective Hausdorff dimension computes reals whose effective packing dimensions are arbitrarily close to, but not necessarily equal to, one). (shrink)

We prove various results connected together by the common thread of computability theory.First, we investigate a new notion of algorithmic dimension, the inescapable dimension, which lies between the effective Hausdorff and packing dimensions. We also study its generalizations, obtaining an embedding of the Turing degrees into notions of dimension.We then investigate a new notion of computability theoretic immunity that arose in the course of the previous study, that of a set of natural numbers with no co-enumerable (...) subsets. We demonstrate how this notion of $\Pi ^0_1$ -immunity is connected to other immunity notions, and construct $\Pi ^0_1$ -immune reals throughout the high/low and Ershov hierarchies. We also study those degrees that cannot compute or cannot co-enumerate a $\Pi ^0_1$ -immune set.Finally, we discuss a recently discovered truth-table reduction for transforming a Kolmogorov–Loveland random input into a Martin-Löf random output by exploiting the fact that at least one half of such a KL-random is itself ML-random. We show that there is no better algorithm relying on this fact, in the sense that there is no positive, linear, or bounded truth-table reduction which does this. We also generalize these results to the problem of outputting randomness from infinitely many inputs, only some of which are random.Abstract prepared by David J. Webb.E-mail: [email protected]: https://arxiv.org/pdf/2209.05659.pdf. (shrink)

This paper continues the study of the metric topology on $2^{\mathbb {N}}$ that was introduced by S. Binns. This topology is induced by a directional metric where the distance from $Y\in2^{\mathbb {N}}$ to $X\in2^{\mathbb {N}}$ is given by \[\limsup_{n}\frac{C(X\upharpoonright n|Y\upharpoonright n)}{n}.\] This definition is closely related to the notions of effective Hausdorff and packing dimensions. Here we establish that this is a path-connected topology on $2^{\mathbb {N}}$ and that under it the functions $X\mapsto\operatorname{dim}_{\mathcal{H}}X$ and $X\mapsto\operatorname{dim}_{p}X$ are continuous. We also (...) investigate the scalar multiplication operation that was introduced by Binns. The multiplication of a real $X\in2^{\mathbb {N}}$ by an element $\alpha\in[0,1]$ represents a dilution of the information in $X$ by a factor of $\alpha$ . Our main result is to show that every regular real is the dilution of a real of Hausdorff dimension 1. That is, that the information in every regular real can be maximally compressed. (shrink)

Strong Turing Determinacy, or ${\mathrm {sTD}}$, is the statement that for every set A of reals, if $\forall x\exists y\geq _T x (y\in A)$, then there is a pointed set $P\subseteq A$. We prove the following consequences of Turing Determinacy ( ${\mathrm {TD}}$ ) and ${\mathrm {sTD}}$ over ${\mathrm {ZF}}$ —the Zermelo–Fraenkel axiomatic set theory without the Axiom of Choice: (1) ${\mathrm {ZF}}+{\mathrm {TD}}$ implies $\mathrm {wDC}_{\mathbb {R}}$ —a weaker version of $\mathrm {DC}_{\mathbb {R}}$.(2) ${\mathrm {ZF}}+{\mathrm {sTD}}$ implies that every (...) set of reals is measurable and has Baire property.(3) ${\mathrm {ZF}}+{\mathrm {sTD}}$ implies that every uncountable set of reals has a perfect subset.(4) ${\mathrm {ZF}}+{\mathrm {sTD}}$ implies that for every set of reals A and every $\epsilon>0$ :(a)There is a closed set $F\subseteq A$ such that $\mathrm {Dim_H}(F)\geq \mathrm {Dim_H}(A)-\epsilon $, where $\mathrm {Dim_H}$ is the Hausdorff dimension.(b)There is a closed set $F\subseteq A$ such that $\mathrm {Dim_P}(F)\geq \mathrm {Dim_P}(A)-\epsilon $, where $\mathrm {Dim_P}$ is the packing dimension. (shrink)

An open U ⊆ ℝ is produced such that (ℝ, +, ·, U) defines a Borel isomorph of (ℝ, +, ·, ℕ) but does not define ℕ. It follows that (ℝ, +, ·, U) defines sets in every level of the projective hierarchy but does not define all projective sets. This result is elaborated in various ways that involve geometric measure theory and working over o-minimal expansions of (ℝ, +, ·). In particular, there is a Cantor set E ⊆ ℝ (...) such that (ℝ, +, ·, E) defines a Borel isomorph of (ℝ, +, ·, ℕ) and, for every exponentially bounded o-minimal expansion $\germ{R}$ of (ℝ, +, ·), every subset of ℝ definable in ( $\germ{R}$ , E) either has interior or is Hausdorff null. (shrink)

If is a random sequence, then the sequence is clearly not random; however, seems to be “about half random”. L. Staiger [Kolmogorov complexity and Hausdorff dimension, Inform. and Comput. 103 159–194 and A tight upper bound on Kolmogorov complexity and uniformly optimal prediction, Theory Comput. Syst. 31 215–229] and K. Tadaki [A generalisation of Chaitin’s halting probability Ω and halting self-similar sets, Hokkaido Math. J. 31 219–253] have studied the degree of randomness of sequences or reals by measuring (...) their “degree of compression”. This line of study leads to various definitions of partial randomness. In this paper we explore some relations between these definitions. Among other results we obtain a characterisation of Σ1-dimension in terms of strong Martin-Löf ε-tests , and we show that ε-randomness for ε is different than the classical 1-randomness. (shrink)

We show that if a real x2ω is strongly Hausdorff -random, where h is a dimension function corresponding to a convex order, then it is also random for a continuous probability measure μ such that the μ-measure of the basic open cylinders shrinks according to h. The proof uses a new method to construct measures, based on effective continuous transformations and a basis theorem for -classes applied to closed sets of probability measures. We use the main result to (...) derive a collapse of randomness notions for Hausdorff measures, and to provide a characterization of effective Hausdorff dimension similar to Frostman’s Theorem. (shrink)

It is known that the box dimension of any Martin-Löf random closed set of ${\{0,1\}^\mathbb{N}}$ is ${\log_2(\frac{4}{3})}$ . Barmpalias et al. [J Logic Comput 17(6):1041–1062, 2007] gave one method of producing such random closed sets and then computed the box dimension, and posed several questions regarding other methods of construction. We outline a method using random recursive constructions for computing the Hausdorff dimension of almost every random closed set of ${\{0,1\}^\mathbb{N}}$ , and propose a general method (...) for random closed sets in other spaces. We further find both the appropriate dimensional Hausdorff measure and the exact Hausdorff dimension for such random closed sets. (shrink)

This paper develops a general theory of uniform probability for compact metric spaces. Special cases of uniform probability include Lebesgue measure, the volume element on a Riemannian manifold, Haar measure, and various fractal measures (all suitably normalized). This paper first appeared fall of 1990 in the Journal of Theoretical Probability, vol. 3, no. 4, pp. 611—626. The key words by which this article was indexed were: ε-capacity, weak convergence, uniform probability, Hausdorff dimension, and capacity dimension.

We introduce a notion of description for infinite sequences and their sets, and a corresponding notion of complexity. We show that for strict process machines, complexity of a sequence or of a subset of Cantor space is equal to its effective Hausdorff dimension.

We examine a definition of the mutual information of two reals proposed by Levin in [5]. The mutual information iswhereK is the prefix-free Kolmogorov complexity. A realAis said to have finite self-information ifI is finite. We give a construction for a perfect Π10class of reals with this property, which settles some open questions posed by Hirschfeldt and Weber. The construction produces a perfect set of reals withK≤+KA+f for any given Δ20fwith a particularly nice approximation and for a specific choice of (...) f it can also be used to produce a perfect Π10set of reals that are low for effective Hausdorff dimension and effective packing dimension. The construction can be further adapted to produce a single perfect set of reals that satisfyK≤+KA+f for allfin a ‘nice’ class of Δ20functions which includes all Δ20orders. (shrink)

We prove that the continuous function${\rm{\hat \Omega }}:2^\omega \to $ that is defined via$X \mapsto \mathop \sum \limits_n 2^{ - K\left} $ for all $X \in {2^\omega }$ is differentiable exactly at the Martin-Löf random reals with the derivative having value 0; that it is nowhere monotonic; and that $\mathop \smallint \nolimits _0^1{\rm{\hat{\Omega }}}\left\,{\rm{d}}X$ is a left-c.e. $wtt$-complete real having effective Hausdorff dimension ${1 / 2}$.We further investigate the algorithmic properties of ${\rm{\hat{\Omega }}}$. For example, we show that (...) the maximal value of ${\rm{\hat{\Omega }}}$ must be random, the minimal value must be Turing complete, and that ${\rm{\hat{\Omega }}}\left \oplus X{ \ge _T}\emptyset \prime$ for every X. We also obtain some machine-dependent results, including that for every $\varepsilon > 0$, there is a universal machine V such that ${{\rm{\hat{\Omega }}}_V}$ maps every real X having effective Hausdorff dimension greater than ε to a real of effective Hausdorff dimension 0 with the property that $X{ \le _{tt}}{{\rm{\hat{\Omega }}}_V}\left$; and that there is a real X and a universal machine V such that ${{\rm{\Omega }}_V}\left$ is rational. (shrink)

There exist two main notions of typicality in computability theory, namely, Cohen genericity and randomness. In this article, we introduce a new notion of genericity, called partition genericity, which is at the intersection of these two notions of typicality, and show that many basis theorems apply to partition genericity. More precisely, we prove that every co-hyperimmune set and every Kurtz random is partition generic, and that every partition generic set admits weak infinite subsets, for various notions of weakness. In particular, (...) we answer a question of Kjos-Hanssen and Liu by showing that every Kurtz random admits an infinite subset which does not compute any set of positive effective Hausdorff dimension. Partition genericity is a partition regular notion, so these results imply many existing pigeonhole basis theorems. (shrink)

Let CH be the class of compacta (i.e., compact Hausdorff spaces), with BS the subclass of Boolean spaces. For each ordinal α and pair $\langle K,L\rangle$ of subclasses of CH, we define Lev ≥α K,L), the class of maps of level at least α from spaces in K to spaces in L, in such a way that, for finite α, Lev ≥α (BS,BS) consists of the Stone duals of Boolean lattice embeddings that preserve all prenex first-order formulas of quantifier (...) rank α. Maps of level ≥ 0 are just the continuous surjections, and the maps of level ≥ 1 are the co-existential maps introduced in [8]. Co-elementary maps are of level ≥α for all ordinals α; of course in the Boolean context, the co-elementary maps coincide with the maps of level ≥ω. The results of this paper include: (i) every map of level ≥ω is co-elementary; (ii) the limit maps of an ω-indexed inverse system of maps of level ≥α are also of level ≥α; and (iii) if K is a co-elementary class, k ≥ k (K,K) = Lev ≥ k+1 (K,K), then Lev ≥ k (K,K) = Lev ≥ω (K,K). A space X ∈ K is co-existentially closed in K if Lev ≥ 0 (K, X) = Lev ≥ 1 (K, X). Adapting the technique of "adding roots," by which one builds algebraically closed extensions of fields (and, more generally, existentially closed extensions of models of universal-existential theories), we showed in [8] that every infinite member of a co-inductive co-elementary class (such as CH itself, BS, or the class CON of continua) is a continuous image of a space of the same weight that is co-existentially closed in that class. We show here that every compactum that is co-existentially closed in CON (a co-existentially closed continuum) is both indecomposable and of covering dimension one. (shrink)

This thesis is devoted to the exploration of the complexity of some mathematical problems using the framework of computable analysis and descriptive set theory. We will especially focus on Weihrauch reducibility as a means to compare the uniform computational strength of problems. After a short introduction of the relevant background notions, we investigate the uniform computational content of problems arising from theorems that lie at the higher levels of the reverse mathematics hierarchy.We first analyze the strength of the open and (...) clopen Ramsey theorems. Since there is not a canonical way to phrase these theorems as multi-valued functions, we identify eight different multi-valued functions and study their degree from the point of view of Weihrauch, strong Weihrauch, and arithmetic Weihrauch reducibility.We then discuss some new operators on multi-valued functions and study their algebraic properties and the relations with other previously studied operators on problems. In particular, we study the first-order part and the deterministic part of a problem f, capturing the Weihrauch degree of the strongest multi-valued problem that is reducible to f and that, respectively, has codomain $\mathbb {N}$ or is single-valued.These notions proved to be extremely useful when exploring the Weihrauch degree of the problem $\mathsf {DS}$ of computing descending sequences in ill-founded linear orders. They allow us to show that $\mathsf {DS}$, and the Weihrauch equivalent problem $\mathsf {BS}$ of finding bad sequences through non-well quasi-orders, while being very “hard” to solve, are rather weak in terms of uniform computational strength. We then generalize $\mathsf {DS}$ and $\mathsf {BS}$ by considering $\boldsymbol {\Gamma }$ -presented orders, where $\boldsymbol {\Gamma }$ is a Borel pointclass or $\boldsymbol {\Delta }^1_1$, $\boldsymbol {\Sigma }^1_1$, $\boldsymbol {\Pi }^1_1$. We study the obtained $\mathsf {DS}$ -hierarchy and $\mathsf {BS}$ -hierarchy of problems in comparison with the Baire hierarchy and show that they do not collapse at any finite level.Finally, we work in the context of geometric measure theory and we focus on the characterization, from the point of view of descriptive set theory, of some conditions involving the notions of Hausdorff/Fourier dimension and Salem sets. We first work in the hyperspace $\mathbf {K}$ of compact subsets of $[0,1]$ and show that the closed Salem sets form a $\boldsymbol {\Pi }^0_3$ -complete family. This is done by characterizing the complexity of the family of sets having sufficiently large Hausdorff or Fourier dimension. We also show that the complexity does not change if we increase the dimension of the ambient space and work in $\mathbf {K}$. We also generalize the results by relaxing the compactness of the ambient space and show that the closed Salem sets are still $\boldsymbol {\Pi }^0_3$ -complete when we endow $\mathbf {F}$ with the Fell topology. A similar result holds also for the Vietoris topology.We conclude by analyzing the same notions from the point of view of effective descriptive set theory and Type-2 Theory of Effectivity, and show that the complexities remain the same also in the lightface case. In particular, we show that the family of all the closed Salem sets is $\Pi ^0_3$ -complete. We furthermore characterize the Weihrauch degree of the functions computing Hausdorff and Fourier dimension of closed sets.prepared by Manlio Valenti.E-mail:[email protected]. (shrink)

We study concepts of decidability for subsets of Euclidean spaces ℝk within the framework of approximate computability . A new notion of approximate decidability is proposed and discussed in some detail. It is an effective variant of F. Hausdorff's concept of resolvable sets, and it modifies and generalizes notions of recursivity known from computable analysis, formerly used for open or closed sets only, to more general types of sets. Approximate decidability of sets can equivalently be expressed by computability of (...) the characteristic functions by means of appropriately working oracle Turing machines. The notion fulfills some natural requirements and is hereditary under canonical embeddings of sets into spaces of higher dimensions. However, it is not closed under binary union or intersection of sets. We also show how the framework of resolvability and approximate decidability can be applied to investigate concepts of reducibility for subsets of Euclidean spaces. (shrink)

Consider a randomness notion C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document}. A uniform test in the sense of C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document} is a total computable procedure that each oracle X produces a test relative to X in the sense of C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document}. We say that a binary sequence Y is C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document}-random uniformly relative to (...) X if Y passes all uniform C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document} tests relative to X. Suppose now we have a pair of randomness notions C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document} and D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{D}}$$\end{document} where C⊆D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C} \subseteq \mathcal{D}}$$\end{document}, for instance Martin-Löf randomness and Schnorr randomness. Several authors have characterized classes of the form Low which consist of the oracles X that are so feeble that C⊆DX\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C} \subseteq \mathcal{D}^X}$$\end{document}. Our goal is to do the same when the randomness notion D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{D}}$$\end{document} is relativized uniformly: denote by Low \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\star}$$\end{document} the class of oracles X such that every C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document}-random is uniformly D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{D}}$$\end{document}-random relative to X. We show that X∈Low⋆\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X\in Low ^\star}$$\end{document} if and only if X is c.e. tt-traceable if and only if X is anticomplex if and only if X is Martin-Löf packing measure zero with respect to all computable dimension functions. We also show that X∈Low⋆\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X\in Low^\star}$$\end{document} if and only if X is computably i.o. tt-traceable if and only if X is not totally complex if and only if X is Schnorr Hausdorff measure zero with respect to all computable dimension functions. (shrink)

We introduce the Hausdorff measure for definable sets in an o-minimal structure, and prove the Cauchy—Crofton and co-area formulae for the o-minimal Hausdorff measure. We also prove that every definable set can be partitioned into “basic rectifiable sets”, and that the Whitney arc property holds for basic rectifiable sets.

Nous présentons dans cet article la genèse du projet de l'Édition Hausdorff, ainsi que sa structure organisationnelle ; une discussion suit sur un des aspects centraux de l'œuvre de Hausdorff.

Nous présentons dans cet article la genèse du projet de l'Édition Hausdorff, ainsi que sa structure organisationnelle ; une discussion suit sur un des aspects centraux de l'œuvre de Hausdorff.

A Hausdorff space is called effectively Hausdorff if there exists a function F—called a Hausdorff operator—such that, for every with,, where U and V are disjoint open neighborhoods of x and y, respectively. Among other results, we establish the following in, i.e., in Zermelo–Fraenkel set theory without the Axiom of Choice (): is equivalent to “For every set X, the Cantor cube is effectively Hausdorff”. This enhances the result of Howard, Keremedis, Rubin and Rubin [13] that (...) is equivalent to “Hausdorff spaces are effectively Hausdorff” in. The Boolean Prime Ideal Theorem and the statement “For every infinite set X, the Stone space of the Boolean algebra is effectively Hausdorff” are mutually independent. In particular, the latter statement is not provable in. The Axiom of Choice for non‐empty subsets of () is equivalent to each of “Separable Hausdorff spaces are effectively Hausdorff” and “The Cantor cube is effectively Hausdorff”. The Principle of Dependent Choices in conjunction with the Axiom of Choice for continuum sized families of non‐empty subsets of does not imply the axiom of choice for partitions of. The latter independence result fills the gap in information in Howard and Rubin's book “Consequences of the Axiom of Choice”. The axiom of countable choice for non‐empty subsets of is equivalent to each of “Denumerable Hausdorff spaces are effectively Hausdorff”, “Denumerable T3 spaces are completely normal” and “Denumerable Tychonoff spaces are Urysohn”. (shrink)

Todorčević (Fund Math 150(1):55–66, 1996) shows that there is no Hausdorff gap (A, B) if A is analytic. In this note we extend the result by showing that the assertion “there is no Hausdorff gap (A, B) if A is coanalytic” is equivalent to “there is no Hausdorff gap (A, B) if A is ${{\bf \it{\Sigma}}^{1}_{2}}$ ”, and equivalent to ${\forall r \; (\aleph_1^{L[r]}\,< \aleph_1)}$ . We also consider real-valued games corresponding to Hausdorff gaps, and show (...) that ${\mathsf{AD}_\mathbb{R}}$ for pointclasses Γ implies that there are no Hausdorff gaps (A, B) if ${{\it{A}} \in {\bf \it{\Gamma}}}$. (shrink)

The topological arithmetical hierarchy is the effective version of the Borel hierarchy. Its class Δta 2 is just large enough to include several types of pointsets in Euclidean spaces ℝ k which are fundamental in computable analysis. As a crossbreed of Hausdorff's difference hierarchy in the Borel class ΔB 2 and Ershov's hierarchy in the class Δ0 2 of the arithmetical hierarchy, the Hausdorff-Ershov hierarchy introduced in this paper gives a powerful classification within Δta 2. This is based (...) on suitable characterizations of the sets from Δta 2 which are obtained in a close analogy to those of the ΔB 2 sets as well as those of the Δ0 2 sets. A helpful tool in dealing with resolvable sets is contributed by the technique of depth analysis. On this basis, the hierarchy properties, in particular the strict inclusions between classes of different levels, can be shown by direct constructions of witness sets. The Hausdorff-Ershov hierarchy runs properly over all constructive ordinals, in contrast to Ershov's hierarchy whose denotation-independent version collapses at level ω 2. Also, some new characterizations of concepts of decidability for pointsets in Euclidean spaces are presented. (shrink)

By analyzing how one obtains the Stone space of the reduced product of an indexed collection of Boolean algebras from the Stone spaces of those algebras, we derive a topological construction, the "reduced coproduct", which makes sense for indexed collections of arbitrary Tichonov spaces. When the filter in question is an ultrafilter, we show how the "ultracoproduct" can be obtained from the usual topological ultraproduct via a compactification process in the style of Wallman and Frink. We prove theorems dealing with (...) the topological structure of reduced coproducts (especially ultracoproducts) and show in addition how one may use this construction to gain information about the category of compact Hausdorff spaces. (shrink)

The article investigates the relations between Hausdorff and non-Hausdorff manifolds as objects of general relativity. We show that every non-Hausdorff manifold can be seen as a result of gluing together some Hausdorff manifolds. In the light of this result, we investigate a modal interpretation of a non-Hausdorff differential manifold, according to which it represents a bundle of alternative space-times, all of which are compatible with a given initial data set.

How does consciousness vary across the animal kingdom? Are some animals ‘more conscious’ than others? This article presents a multidimensional framework for understanding interspecies variation in states of consciousness. The framework distinguishes five key dimensions of variation: perceptual richness, evaluative richness, integration at a time, integration across time, and self-consciousness. For each dimension, existing experiments that bear on it are reviewed and future experiments are suggested. By assessing a given species against each dimension, we can construct a consciousness (...) profile for that species. On this framework, there is no single scale along which species can be ranked as more or less conscious. Rather, each species has its own distinctive consciousness profile. (shrink)

I present solutions to several questions of Paul Bankston [2] by means of another version of the ultracoproduct construction, and explain the relation of ultracoproduct of compact Hausdorff spaces to other constructions combining topology, algebra and logic.

We say that a Hausdorff locale is compactly generated if it is the colimit of the diagram of its compact sublocales connected by inclusions. We show that this is the case if and only if the natural map of its frame of opens into the second Lawson dual is an isomorphism. More generally, for any Hausdorff locale, the second dual of the frame of opens gives the frame of opens of the colimit. In order to arrive at this (...) conclusion, we generalize the Hofmann–Mislove–Johnstone theorem and some results regarding the patch construction for stably locally compact locales. (shrink)

Human brain organoids (HBOs) are novel entities that may exhibit unique forms of cognitive potential. What moral status, if any, do they have? Several authors propose that consciousness may hold the answer to this question. Others identify various _kinds of_ consciousness as crucially important for moral consideration, while leaving open the challenge of determining whether HBOs have them. This paper aims to make progress on these questions in two ways. First, it proposes a framework for thinking about the moral status (...) of entities other than paradigmatic persons. This framework identifies four qualities that ground moral status: evaluative stance, self-directedness, agency, and other-directedness. Second, we speculate on ways in which these qualities are relevant to dimensions of conscious experience that have been, or could be, identified in nonhuman animals. We further explore how these approaches could be adapted for use in HBOs, and argue that such studies, or something similar to them, will have to be performed if we wish to have empirical indications that HBOs have consciousness of a morally significant kind. We end by proposing that in our current scientific and epistemic situation, it is too soon to attribute any moral status to HBOs, but that this might change in the future. (shrink)

Some argue that the term “explanation” in science is ambiguous, referring to at least three distinct concepts: a communicative concept, a representational concept, and an ontic concept. Each is defined in a different way with its own sets of norms and goals, and each of which can apply in contexts where the others do not. In this paper, I argue that such a view is false. Instead, I propose that a scientific explanation is a complex entity that can always be (...) analyzed along a communicative dimension, a representational dimension, and an ontic dimension. But all three are always present within scientific explanations. I highlight what such an account looks like, and the potential problems it faces (namely that a single explanation can appear to have incompatible sets of norms and goals that govern it). I propose a solution to this problem and demonstrate how this account can help to dissolve current disputes in philosophy of science regarding debates between epistemic and ontic accounts of mechanistic explanations in the life sciences. (shrink)

Hermeneutics, or the theory of interpretation, is an extremely important branch of epistemology that has, in the past twenty years, been receiving an increasing amount of attention. There is now a fairly extensive body of rather daunting literature in the field, most of it originating in the European phenomenological tradition. Dimensions of the Hermeneutic Circle is intended to give readers who are philosophically sophisticated but not yet conversant with hermeneutics a comprehensive overview of the history and concerns of the discipline. (...) It shows how the development of hermeneutics in the past two centuries coincided with a gradual increase in our appreciation of the subtleties and many variations of the hermeneutic circle. It also makes explicity some of the more important ways in which the hermeneutic circle can be seen to function in the practices of the natural sciences, thus bridging the methodological gap between the Geisteswissenschaften and the natural sciences. The book is illustrated with forty diagrams representing the variation of the hermeneutic circle, further reinforcing the clarity of exposition. It will therefore be appropriate as core text for graduate or senior courses on hermeneutics or literary theory, and as supplementary text for courses in the philosophy of science, historiography, and aesthetics. (shrink)

Value pluralists believe in multiple dimensions of value. What does betterness along a dimension have to do with being better overall? Any systematic answer begins with the Strong Pareto principle: one thing is overall better than another if it is better along one dimension and at least as good along all others. We defend Strong Pareto from recent counterexamples and use our discussion to develop a novel view of dimensions of value, one which puts Strong Pareto on firmer (...) footing. We conclude by defending Dimensionalism, the hypothesis that overall value relations are determined solely by how things compare along value dimensions. These are first steps towards a more systematic value pluralism. (shrink)

In science and philosophy, a relatively demanding notion of understanding is of central interest: an epistemic subject understands a subject matter by means of a theory. This notion can be explicated in a way which resembles JTB analyses of knowledge. The explication requires that the theory answers to the facts, that the subject grasps the theory, that she is committed to the theory and that the theory is justified for her. In this paper, we focus on the justification condition and (...) argue that it can be analyzed with reference to the idea of a reflective equilibrium. (shrink)

Communications and categorizations mark the temporality of the possible sequences of network states, and each event thus produced modifies the space of the network by provoking in individual actors various types of learning that present an extensive and intensive dimension. This chapter examines in detail these types of learning and the mobilizations of the network space involved. Like inter‐individual communication, categorization potentially impacts both dimensions of learning. The chapter first discusses learning from inter‐individual communication, and shows that it is (...) synonymous with bringing innovation in a weak sense to the network. It then discusses learning related to categorization, which we will see is likely to introduce novelty in a strong sense within the network. The increasing efficiency of the individual learning process would thus be tempered by the global cognitive network's degree of redundancy. (shrink)