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.

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)

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)

We study invariant measures on compact Hausdorff spaces using finitary integral logic. For each compact Hausdorff space X and any family equation image of its continuous transformations, we find equivalent conditions for the existence of an equation image-invariant measure on X. We give two proofs of the existence of Haar measure on compact groups.

The investigation of computational properties of discontinuous functions is an important concern in computable analysis. One method to deal with this subject is to consider effective variants of Borel measurable functions. We introduce such a notion of Borel computability for single-valued as well as for multi-valued functions by a direct effectivization of the classical definition. On Baire space the finite levels of the resulting hierarchy of functions can be characterized using a notion of reducibility for functions and corresponding complete functions. (...) We use this classification and an effective version of a Selection Theorem of Bhattacharya-Srivastava in order to prove a generalization of the Representation Theorem of Kreitz-Weihrauch for Borel measurable functions on computable metric spaces: such functions are Borel measurable on a certain finite level, if and only if they admit a realizer on Baire space of the same quality. This Representation Theorem enables us to introduce a realizer reducibility for functions on metric spaces and we can extend the completeness result to this reducibility. Besides being very useful by itself, this reducibility leads to a new and effective proof of the Banach-Hausdorff-Lebesgue Theorem which connects Borel measurable functions with the Baire functions. Hence, for certain metric spaces the class of Borel computable functions on a certain level is exactly the class of functions which can be expressed as a limit of a pointwise convergent and computable sequence of functions of the next lower level. (shrink)

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 study degree-theoretic properties of reals that are not random with respect to any continuous probability measure (NCR). To this end, we introduce a family of generalized Hausdorff measures based on the iterates of the “dissipation” function of a continuous measure and study the effective nullsets given by the corresponding Solovay tests. We introduce two constructions that preserve non-randomness with respect to a given continuous measure. This enables us to prove the existence of NCR reals in (...) a number of Turing degrees. In particular, we show that every \(\Delta ^0_2\) -degree contains an NCR element. (shrink)

Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Zadeh's fuzzy set and Atanassov's intuitionistic fuzzy set. In this paper, we first develop some similarity measures of neutrosophic sets. We will present a method to calculate the distance between neutrosophic sets (NS) on the basis of the Hausdorff distance. Then we will use this distance to generate a new similarity measure to calculate the degree of similarity between NS. Finally we will prove some properties (...) of the proposed similarity measures. (shrink)

On our ordinary representations of space, space is composed of indivisible, dimensionless points; extended regions are understood as infinite sets of points. Region-based theories of space reverse this atomistic picture, by taking as primitive several relations on extended regions, and recovering points as higher-order abstractions from regions. Over the years, such theories have focused almost exclusively on the topological and geometric structure of space. We introduce to region-based theories of space a new primitive binary relation (‘qualitative probability’) that is tied (...) to _measure_. It expresses that one region is _smaller than or equal in size_ to another. Algebraic models of our theory are _separation_ _σ_-_algebras with qualitative probability_: \((\mathbb {B}, \ll, \preceq )\), where \(\mathbb {B}\) is a Boolean _σ_-algebra, ≪ is a separation relation on \(\mathbb {B}\), and ≼ is a qualitative probability on \(\mathbb {B}\). We show that from algebraic models of this kind we can, in an interesting class of cases, recover a compact Hausdorff topology _X_, together with a countably additive measure _μ_ on a _σ_-field of Borel subsets of that topology, and that \((\mathbb {B}, \ll, \preceq )\) is isomorphic to a ‘standard model’ arising out of the pair (_X_, _μ_). It follows from one of our main results that any closed ball in Euclidean space, \(\mathbb {R}^{n}\), together with Lebesgue measure arises in this way from a separation _σ_-algebra with qualitative probability. (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)

Attempts to extend the classical Hausdorff difference hierarchy to the case of partitions of a space to k > 2 subsets lead to non‐equivalent notions. In a hope to identify the “right” extension we consider the extensions appeared in the literature so far: the limit‐, level‐, Boolean and Wadge hierarchies of k ‐partitions. The advantages and disadvantages of the four hierarchies are discussed. The main technical contribution of this paper is a complete characterization of the Wadge degrees of Δ02‐measurable (...) k ‐partitions of the Baire space. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

Suppose that fn is a sequence of nonnegative functions with compact support on a locally compact metric space, that T is a nonnegative linear functional, and that equation imageT fn < T f0. A result of Bishop, foundational to a constructive theory of functional analysis, asserts the existence of a point x such that equation imagefn < f0. This paper extends this result to arbitrary Hausdorff spaces, and gives short proofs using nonstandard analysis. While such arguments used are not (...) themselves constructive, they can illuminate where the difficulty lies in finding the point x. An algorithm for constructing x is then given, with a nonstandard proof that the algorithm converges to a correct value. (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)

By the Galvin–Mycielski–Solovay theorem, a subset X of the line has Borel’s strong measure zero if and only if $M+X\neq \mathbb {R}$ for each meager set M.A set $X\subseteq \mathbb {R}$ is meager-additive if $M+X$ is meager for each meager set M. Recently a theorem on meager-additive sets that perfectly parallels the Galvin–Mycielski–Solovay theorem was proven: A set $X\subseteq \mathbb {R}$ is meager-additive if and only if it has sharp measure zero, a notion akin to strong measure (...) zero.We investigate the validity of this result in Polish groups. We prove, e.g., that a set in a locally compact Polish group admitting an invariant metric is meager-additive if and only if it has sharp measure zero. We derive some consequences and calculate some cardinal invariants. (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)

A qualitative theory of truthlikeness, based on a family of quantitative measures, is developed for hypotheses that are concerned with the values of a finite number of real-valued quantities. Representing hypotheses by subsets of $R^{n}$ , I first show that a straightforward application of the basic ideas of the similarity approach to truthlikeness does not work out for hypotheses with zero n-dimensional Lebesgue measure. However, it is easy to give a counterpart for the average measure preferred by Pavel (...) Tichý and Graham Oddie in terms of Hausdorff measures. The task of finding analogies of the min-sum-measure preferred by Ilkka Niiniluoto is more interesting. I present and discuss analogies of two different types for this measure. (shrink)

Coherence is a key concept in many accounts of epistemic justification within ‘traditional’ analytic epistemology. Within formal epistemology, too, there is a substantial body of research on coherence measures. However, there has been surprisingly little interaction between the two bodies of literature. The reason is that the existing formal literature on coherence measure operates with a notion of belief system that is very different from—what we argue is—a natural Bayesian formalisation of the concept of belief system from traditional epistemology. (...) Therefore, formal epistemology has so far only been concerned with one particular—arguably not even very natural—way of formalising coherence of belief systems; it has by no means refuted the viability of coherentism. In contrast to the existing literature, we formalise belief systems as families of assignments of (conditional) degrees of belief (which may be compatible with several subjective probability measures). Within this framework, we propose a Bayesian formalisation of the thrust of BonJour’s coherence concept in The structure of empirical knowledge (Harvard University Press, Cambridge, 1985), using a combination of Bayesian confirmation theory and basic graph theory. In excursions, we introduce graded notions for both logical and probabilistic consistency of belief systems—the latter being based on certain geometrical structures induced by probabilistic belief systems. For illustration, we reconsider BonJour’s “ravens” challenge (op. cit., p. 95f.). Finally, potential objections to our proposed formal coherence notion are explored. (shrink)

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)

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)

Probability measures can be constructed using the measure-theoretic techniques of Caratheodory and Hausdorff. Under these constructions one obtains first an outer measure over "events" or "propositions." Then, if one restricts this outer measure to the measurable propositions, one finally obtains a classical probability theory. What I argue is that outer measures can also be used to yield the structures of probability theories in quantum mechanics, provided we permit them to range over at least some unmeasurable propositions. (...) I thereby show that nonclassical probability theories can be seen to arise naturally within the framework of possible worlds semantics. (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)

For a free filter F on $$\omega $$ ω, endow the space $$N_F=\omega \cup \{p_F\}$$ N F = ω ∪ { p F }, where $$p_F\not \in \omega $$ p F ∉ ω, with the topology in which every element of $$\omega $$ ω is isolated whereas all open neighborhoods of $$p_F$$ p F are of the form $$A\cup \{p_F\}$$ A ∪ { p F } for $$A\in F$$ A ∈ F. Spaces of the form $$N_F$$ N F constitute the (...) class of the simplest non-discrete Tychonoff spaces. The aim of this paper is to study them in the context of the celebrated Josefson–Nissenzweig theorem from Banach space theory. We prove, e.g., that, for a filter F, the space $$N_F$$ N F carries a sequence $$\langle \mu _n:n\in \omega \rangle $$ ⟨ μ n : n ∈ ω ⟩ of normalized finitely supported signed measures such that $$\mu _n(f)\rightarrow 0$$ μ n ( f ) → 0 for every bounded continuous real-valued function f on $$N_F$$ N F if and only if $$F^*\le _K{\mathcal {Z}}$$ F ∗ ≤ K Z, that is, the dual ideal $$F^*$$ F ∗ is Katětov below the asymptotic density ideal $${\mathcal {Z}}$$ Z. Consequently, we get that if $$F^*\le _K{\mathcal {Z}}$$ F ∗ ≤ K Z, then: (1) if X is a Tychonoff space and $$N_F$$ N F is homeomorphic to a subspace of X, then the space $$C_p^*(X)$$ C p ∗ ( X ) of bounded continuous real-valued functions on X contains a complemented copy of the space $$c_0$$ c 0 endowed with the pointwise topology, (2) if K is a compact Hausdorff space and $$N_F$$ N F is homeomorphic to a subspace of K, then the Banach space C(K) of continuous real-valued functions on K is not a Grothendieck space. The latter result generalizes the well-known fact stating that if a compact Hausdorff space K contains a non-trivial convergent sequence, then the space C(K) is not Grothendieck. (shrink)

Reviewed Works:Tomek Bartoszynski, Marion Scheepers, Set Theory, Annual Boise Extravaganza in Set Theory Conference, March 13-15, 1992, April 10-11, 1993, March 25-27, 1994, Boise State University, Boise, Idaho.R. Aharoni, A. Hajnal, E. C. Milner, Interval Covers of a Linearly Ordered Set.Eyal Amir, Haim Judah, Souslin Absoluteness, Uniformization and Regularity Properties of Projective Sets.Tomek Bartoszynski, Ireneusz Reclaw, Not Every $\gamma$-Set is Strongly Meager.Andreas Blass, Reductions Between Cardinal Characteristics of the Continuum.Claude Laflamme, Filter Games and Combinatorial Properties of Strategies.R. Daniel Mauldin, Analytic (...) non-Borel Sets Modulo Null Sets.Janusz Pawlikowski, Laver's Forcing and Outer Measure.Marion Scheepers, Meager Sets and Infinite Games.Saharon Shelah, On Some Problems in General Topology.Saharon Shelah, Remarks on $\aleph_1$-CWH not CWH First Countable Spaces.Juris Steprans, Cardinal Invariants Associated with Hausdorff Capacities. (shrink)

Preference orderings assigned by coherent lower and upper conditional previsions are defined and they are considered to define maximal random variables and Bayes random variables. Sufficient conditions are given such that a random variable is maximal if and only if it is a Bayes random variable. In a metric space preference orderings represented by coherent lower and upper conditional previsions defined by Hausdorff inner and outer measures are given.

In set theory without the axiom of choice math formula, three-space type results for the Hahn-Banach property are provided. We deduce that for every Hausdorff compact scattered space K, the Banach space C of real continuous functions on K satisfies the continuous Hahn-Banach property in math formula. We also prove in math formula Rudin's theorem: “Radon measures on Hausdorff compact scattered spaces are discrete”.

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)

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.

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)

In this paper, we define a new cosine similarity between two interval valued neutrosophic sets based on Bhattacharya’s distance [19]. The notions of interval valued neutrosophic sets (IVNS, for short) will be used as vector representations in 3D-vector space. Based on the comparative analysis of the existing similarity measures for IVNS, we find that our proposed similarity measure is better and more robust. An illustrative example of the pattern recognition shows that the proposed method is simple and effective.

Fitelson (1999) demonstrates that the validity of various arguments within Bayesian confirmation theory depends on which confirmation measure is adopted. The present paper adds to the results set out in Fitelson (1999), expanding on them in two principal respects. First, it considers more confirmation measures. Second, it shows that there are important arguments within Bayesian confirmation theory and that there is no confirmation measure that renders them all valid. Finally, the paper reviews the ramifications that this "strengthened problem (...) of measure sensitivity" has for Bayesian confirmation theory and discusses whether it points at pluralism about notions of confirmation. (shrink)

This article describes the development and validation of a scale specifically designed to measure one's propensity for Objectivism. The scale developed in this article assesses metaphysics, epistemology, ethics, and politics. A three-stage process of scale development results in a multidimensional scale that largely supports Rand's original conception of the construct in the United States and Lithuania. Several challenges are identified, including problems with select items referencing specific political preferences and addressing notions of a higher being. Prospects for future research (...) are identified, including tests for associations between Objectivism and individual factors such as leadership style, organizational commitment, and job performance. (shrink)

Much critical attention has been given to Isabella’s non-answer to Duke Vincentio’s marriage proposal at the conclusion of Measure for Measure. What critics have failed to notice is that Isabella’s non-answer is not a unique or singular moment in the play. In fact, this paper will apply the theories of Slavoj Žižek to argue that the logic of subtraction, the negative gesture of non-compliance to which Isabella gives especially pronounced form, is fundamental to the structure of the play (...) in its entirety. Two characters in particular, Isabella and Barnardine, demonstrate the possibility of occupying a subjective orientation that is at once under the sway of the law and aware of the law’s incomplete hold on the subject. Ultimately, I will show that the logic of subtraction and refusal has important implications for how the play understands the potential political power of various forms of labor, especially sexual labor. (shrink)

This papers argues that the apparent constraint of adverbials like 'for two hours' (or 'throughout the house') should not be viewed as a restriction to telic events or event predicates, but should be explained entirely in terms of the quantificational status of such adverials, acting as quantifiers over (contextually individuated) parts of a time interval (or spatial region).

How is conceptual foreignness received within an existing territory? I am grateful to my respondents for receiving my invocation of foreignness from phenomenological psychopathology not as a question of culture or nationality but rather, in terms of philosophical distance. As I ask in the article: how do we measure philosophical distance? Rather than complete agreement, or assimilation, or estrangement, perhaps distance is best calibrated through the small events of thought–understandings, misunderstandings, and clarifications, that punctuate even the most thoughtful and (...) hospitable reception, as I have been fortunate to receive from our respondents. In my brief response, I will focus on some of these smaller events... (shrink)

Sorkin’s recent proposal for a realist interpretation of quantum theory, the anhomomorphic logic or coevent approach, is based on the idea of a “quantum measure” on the space of histories. This is a generalisation of the classical measure to one which admits pair-wise interference and satisfies a modified version of the Kolmogorov probability sum rule. In standard measure theory the measure on the base set Ω is normalised to one, which encodes the statement that “Ω happens”. (...) Moreover, the Kolmogorov sum rule implies that the measure of any subset A is strictly positive if and only if A cannot be covered by a countable collection of subsets of zero measure. In quantum measure theory on the other hand, simple examples suffice to demonstrate that this is no longer true. We propose an appropriate generalisation, the quantum cover, which in addition to being a cover of A, satisfies the property that if the quantum measure of A is non-zero then this is also the case for at least one of the elements in the cover. Our work implies a non-triviality result for the coevent interpretation for Ω of finite cardinality, and allows us to cast the Peres-Kochen-Specker theorem in terms of quantum covers. (shrink)

I am grateful to Dr William L. Craig for his reply to an earlier article of mine in this journal, on the relationship between God and time. Craig and I agree on most points with respect to the relationship between God and time. What then is there for us to disagree about? The point Craig argues for is, eternity is ‘coincident’ with our history, i.e. the duration of our space–time is simultaneous with some duration of eternity. But I already agree (...) to this point. In fact, I argued that if God sustains the universe, and if the universe and God are temporal, then God's time must be related to our time. We are in God's time, and God's time is our time, when by time we mean ‘ontological time’ or what I call duration, rather than Measured Time. If this is so, where is our disagreement? Our disagreement turns on this question: does history measure eternity? Does the ‘cosmic time’ of our universe give a proper measure to the same duration of God's time in eternity? I say it does not, while Craig says that it does. (shrink)

First Criticism of the Theory.—This is of the nature of an argumentum ad hominem. In the first place, It is surprising that so clever a man as Protagoras did not see that he proved more than he intended, for according to his theory not only are all men, the wise and the foolish, reduced to the same level, but on the plane of sentient experience it is just as true to say that a pig or a tadpole is the (...) class='Hi'>measure of all things. (shrink)