Harmonic Analysis and nonstandard Brownian Motion in the plane.
Harmonische Analysis bei Aussagenkalkülen.
Hausdorff gaps and towers in 𝓟(ω)/Fin
We define and study two classes of uncountable ⊆*-chains: Hausdorff towers and Suslin towers. We discuss their existence in various models of set theory. Some of the results and methods are used to provide examples of indestructible gaps not equivalent to a Hausdorff gap. We also indicate possible ways of developing a structure theory for towers based on classification of their Tukey types.
Hausdorff gaps reconstructed from Luzin gaps
Hausdorff ’s theorem for posets that satisfy the finite antichain property
Hausdorff characterized the class of scattered linear orderings as the least family of linear orderings that includes the ordinals and is closed under ordinal summations and inversions. We formulate and prove a corresponding characterization of the class of scattered partial orderings that satisfy the finite antichain condition (FAC). Consider the least class of partial orderings containing the class of well-founded orderings that satisfy the FAC and is closed under the following operations: (1)...
Hausdorffness in intuitionistic fuzzy topological spaces.
The basic concepts of the theory of intuitionistic fuzzy topological spaces have been defined by D. Çoker and co-workers. In this paper, we define new notions of Hausdorffness in the intuitionistic fuzzy sense, and obtain some new properties, in particular on convergence.
Hausdorffův-Banachův-Tarského paradox
Herbrand consistency and bounded arithmetic
We prove that the Gödel incompleteness theorem holds for a weak arithmetic Tₘ = IΔ₀ + Ωₘ, for m ≥ 2, in the form Tₘ ⊬ HCons(Tₘ), where HCons(Tₘ) is an arithmetic formula expressing the consistency of Tₘ with respect to the Herbrand notion of provability. Moreover, we prove , where is HCons relativised to the definable cut Iₘ of (m-2)-times iterated logarithms. The proof is model-theoretic. We also prove a certain non-conservation result for Tₘ.
Hercules and Hydra
Hercules and Hydra, a game on rooted finite trees
Hercules versus Hidden Hydra Helper
L. Kirby and J. Paris introduced the Hercules and Hydra game on rooted trees as a natural example of an undecidable statement in Peano Arithmetic. One can show that Hercules has a “short” strategy (he wins in a primitively recursive number of moves) and also a “long” strategy (the finiteness of the game cannot be proved in Peano Arithmetic). We investigate the conflict of the “short” and “long” intentions (a problem suggested by J. Nešetřil). After each move of Hercules (trying to kill Hydra fast)...
Hereditarily Hurewicz spaces and Arhangel'skii sheaf amalgamations
A classical theorem of Hurewicz characterizes spaces with the Hurewicz covering property as those having bounded continuous images in the Baire space. We give a similar characterization for spaces which have the Hurewicz property hereditarily. We proceed to consider the class of Arhangel’skii spaces, for which every sheaf at a point can be amalgamated in a natural way. Let denote the space of continuous real-valued functions on with the topology of pointwise convergence. Our main result...
Hereditary measurable sets and universal measure
Hereditary normality of a space of the form .
“Hidden variables” on concrete logics (extensions)
Hierarchien primitiv-rekursiver Funktionen im Transfiniten.
Hierarchies and reducibilities on regular languages related to modulo counting
We discuss some known and introduce some new hierarchies and reducibilities on regular languages, with the emphasis on the quantifier-alternation and difference hierarchies of the quasi-aperiodic languages. The non-collapse of these hierarchies and decidability of some levels are established. Complete sets in the levels of the hierarchies under the polylogtime and some quantifier-free reducibilities are found. Some facts about the corresponding degree structures are established. As an application,...
Hierarchies and reducibilities on regular languages related to modulo counting
We discuss some known and introduce some new hierarchies and reducibilities on regular languages, with the emphasis on the quantifier-alternation and difference hierarchies of the quasi-aperiodic languages. The non-collapse of these hierarchies and decidability of some levels are established. Complete sets in the levels of the hierarchies under the polylogtime and some quantifier-free reducibilities are found. Some facts about the corresponding degree structures are established. As an application, we...
Hierarchies of function classes defined by the first-value operator
The first-value operator assigns to any sequence of partial functions of the same type a new such function. Its domain is the union of the domains of the sequence functions, and its value at any point is just the value of the first function in the sequence which is defined at that point. In this paper, the first-value operator is applied to establish hierarchies of classes of functions under various settings. For effective sequences of computable discrete functions, we obtain a hierarchy connected...
Hierarchies of function classes defined by the first-value operator
The first-value operator assigns to any sequence of partial functions of the same type a new such function. Its domain is the union of the domains of the sequence functions, and its value at any point is just the value of the first function in the sequence which is defined at that point. In this paper, the first-value operator is applied to establish hierarchies of classes of functions under various settings. For effective sequences of computable discrete functions, we obtain a hierarchy connected...