Measure theory and weak König's lemma

We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of /spl Pi//sub 2//sup 0/-theorems in feasible analysis. By ineffective proof we mean a proof which involves the noncomputational principle weak Konig's lemma WKL, and by feasible analysis we mean Cook and Urquhart's system CPV/sup /spl omega// plus quantifier-free choice QF-AC. We shall also discuss the relation between the system CPV/sup /spl omega// + QF-AC and Ferreira's base theory for feasible analysis BTFA, for which /spl Pi//sub 2//sup 0/-conservation of WKL has been non-constructively proven. This paper treats the case of weak Konig's lemma, we indicate how to formalize the proof of the Heine/Borel covering lemma in this system. The main techniques used in the paper are Godel's functional interpretation and a novel form of binary bar recursion.

This paper investigates the determinacy and the complete determinacy of infinite games, following reverse mathematics program whose purpose is to find the set comprehension axioms that are necessary and sufficient for these statements in the frame of second order arithmetic. In some sense, this research clarifies how complex oracles we need to obtain the algorithms which give a winning strategies and which determine the winning positions for the players. It will be shown that, depending on the complexity of the rules of games, the complexity of the oracles changes drastically and that determinacy and complete determinacy statements are not always equivalent.

In 2007, Terence Tao wrote on his blog an essay about soft analysis, hard analysis and the finitization of soft analysis statements into hard analysis statements. One of his main examples was a quasi-finitization of the infinite pigeonhole principle IPP, arriving at the “finitary” infinite pigeonhole principle FIPP1. That turned out to not be the proper formulation and so we proposed an alternative version FIPP2. Tao himself formulated yet another version FIPP3 in a revised version of his essay.We give a counterexample to FIPP1 and discuss for both of the versions FIPP2 and FIPP3 the faithfulness of their respective finitization of IPP by studying the equivalences IPP ↔ FIPP2 and IPP ↔ FIPP3 in the context of reverse mathematics ([9]). In the process of doing this we also introduce a continuous uniform boundedness principle CUB as a formalization of Tao's notion of a correspondence principle and study the strength of this principle and various restrictions thereof in terms of reverse mathematics, i.e., in terms of the “big five” subsystems of second order arithmetic.

This paper is a contribution to the project of determining which set existence axioms are needed to prove various theorems of analysis. For more on this project and its history we refer the reader to [1] and [2].We work in a weak subsystem of second order arithmetic. The language of second order arithmetic includes the symbols 0, 1, =, <, +, ·, and ∈, together with number variables x, y, z, … (which are intended to stand for natural numbers), set variables X, Y, Z, … (which are intended to stand for sets of natural numbers), and the usual quantifiers (which can be applied to both kinds of variables) and logical connectives. We write ∀x < t φ and ∃x < t φ as abbreviations for ∀x(x < t → φ) and ∃x{x < t ∧ φ) respectively; these are called bounded quantifiers. A formula is said to be if it has no quantifiers applied to set variables, and all quantifiers applied to number variables are bounded. It is if it has the form ∃xθ and it is if it has the form ∀xθ, where in both cases θ is .The theory RCA0 has as axioms the usual Peano axioms, with the induction scheme restricted to formulas, and in addition the comprehension scheme, which consists of all formulas of the formwhere φ is , ψ is , and X does not occur free in φ(n). (“RCA” stands for “Recursive Comprehension Axiom.” The reason for the name is that the comprehension scheme is only strong enough to prove the existence of recursive sets.) It is known that this theory is strong enough to allow the development of many of the basic properties of the real numbers, but that certain theorems of elementary analysis are not provable in this theory. Most relevant for our purposes is the fact that it is impossible to prove in RCA0 that every continuous function on the closed interval [0, 1] attains maximum and minimum values (see [1]).Since the most common proof of the Mean Value Theorem makes use of this theorem, it might be thought that the Mean Value Theorem would also not be provable in RCA0. However, we show in this paper that the Mean Value Theorem can be proven in RCA0. All theorems stated in this paper are theorems of RCA0, and all of our reasoning will take place in RCA0.

We investigate the provability or nonprovability of certain ordinary mathematical theorems within certain weak subsystems of second order arithmetic. Specifically, we consider the Cauchy/Peano existence theorem for solutions of ordinary differential equations, in the context of the formal system RCA0whose principal axioms arecomprehension andinduction. Our main result is that, over RCA0, the Cauchy/Peano Theorem is provably equivalent to weak König's lemma, i.e. the statement that every infinite {0, 1}-tree has a path. We also show that, over RCA0, the Ascoli lemma is provably equivalent to arithmetical comprehension, as is Osgood's theorem on the existence of maximum solutions. At the end of the paper we digress to relate our results to degrees of unsolvability and to computable analysis.

A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions play a central role in algorithmic randomness and reverse mathematics. Flood and Towsner asked for which functions h, the principle stating the existence of an h-bounded d.n.c. function (h-DNR) implies Ramsey-type weak Konig's lemma (RWKL). In this paper, we prove that for every computable order h, there exists an $${\omega}$$? -model of h-DNR which is not a not model of the Ramsey-type graph coloring principle for two colors (RCOLOR 2) and therefore not a model of RWKL. The proof combines bushy tree forcing and a technique introduced by Lerman, Solomon and Towsner to transform a computable non-reducibility into a separation over $${\omega}$$? -models.

This paper describes axiomatic theories SA and SAR, which are versions of second order arithmetic with countably many sorts for sets of natural numbers. The theories are intended to be applied in reverse mathematics because their multi-sorted language allows to express some mathematical statements in more natural form than in the standard second order arithmetic. We study metamathematical properties of the theories SA, SAR and their fragments. We show that SA is mutually interpretable with the theory of arithmetical truth PATr obtained from the Peano arithmetic by adding infinitely many truth predicates. Corresponding fragments of SA and PATr are also mutually interpretable. We compare the proof-theoretical strengths of the fragments; in particular, we show that each fragment SAs with sorts <=s is weaker than next fragment SAs+1.

Parametrizing open universals

This paper considers fuzzifying topologies, a special case of I-fuzzy topologies (bifuzzy topologies), introduced by Ying [1]. It investigates topological notions defined by means of α-open sets when these are planted into the framework of Ying’s fuzzifying topological spaces (by Łukasiewicz logic in [0,1]) . The concept of α-irresolute functions and α-compactness in the framework of fuzzifying topology are introduced and some of their properties are obtained. We use the finite intersection property to give a characterization of fuzzifying α-compact spaces. Furthermore, we study the image of fuzzifying α-compact spaces under fuzzifying α-continuity and fuzzifying α-irresolute maps.

In this paper, given a homeomorphism f of a compact metric space X, we show that the set of all asymptotic average shadowable points of f is an open and invariant set and f has the asymptotic average shadowing property if and only if the set of all asymptotic average shadowable points of f is X if and only if any Borel probability measure μ of X has the asymptotic average shadowing property.

In this paper, we study a class of Borel measures on [Formula: see text] that arises as the class of representing measures of Herglotz-Nevanlinna functions. In particular, we study product measures within this class where products with the Lebesgue measures play a special role. Hence, we give several characterizations of the [Formula: see text]-dimensional Lebesgue measure among all such measures and characterize all product measures that appear in this class of measures. Furthermore, analogous results for the class of positive Borel measures on the unit poly-torus with vanishing mixed Fourier coefficients are also presented, and the relation between the two classes of measures with regard to the obtained results is discussed.

The main aim of this paper is to study new class of continuous function is called – continuous function. for this aim, the nation of - open and pre – open sets and - compact space are introduced. and we shall study the relationship between – continuous and pc– continuous functions.

For a finite, positive Borel measure μ \mu on ( 0 , 1 ) (0,1) we consider an infinite matrix Γ μ \Gamma _\mu , related to the classical Hausdorff matrix defined by the same measure μ \mu , in the same algebraic way that the Hilbert matrix is related to the Cesáro matrix. When μ \mu is the Lebesgue measure, Γ μ \Gamma _\mu reduces to the classical Hilbert matrix. We prove that the matrices Γ μ \Gamma _\mu are not Hankel, unless μ \mu is a constant multiple of the Lebesgue measure, we give necessary and sufficient conditions for their boundedness on the scale of Hardy spaces H p , 1 ≤ p > ∞ H^p, \, 1 \leq p > \infty , and we study their compactness and complete continuity properties. In the case 2 ≤ p > ∞ 2\leq p>\infty , we are able to compute the exact value of the norm of the operator.

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.

We consider the baker’s map B on the unit square X and an open convex set which we regard as a hole. The survivor set is defined as the set of all points in X whose B-trajectories are disjoint from H. The main purpose of this paper is to study holes H for which (dimension traps) as well as those for which any periodic trajectory of B intersects (cycle traps).We show that any H which lies in the interior of X is not a dimension trap. This means that, unlike the doubling map and other one-dimensional examples, we can have for H whose Lebesgue measure is arbitrarily close to one. Also, we describe holes which are dimension or cycle traps, critical in the sense that if we consider a strictly convex subset, then the corresponding property in question no longer holds.We also determine such that for all convex H whose Lebesgue measure is less than δ.This paper may be seen as a first extension of our work begun in Clark (2016 Discrete Continuous Dyn. Syst. A 6 1249–69; Clark 2016 PhD Dissertation The University of Manchester; Glendinning and Sidorov 2015 Ergod. Theor. Dynam. Syst. 35 1208–28; Hare and Sidorov 2014 Mon.hefte Math. 175 347–65; Sidorov 2014 Acta Math. Hung. 143 298–312) to higher dimensions.