We discuss in the paper the following problem: Given a function in a given Baire class, into "how many" (in terms of cardinal numbers) functions of lower classes can it be decomposed? The decomposition is understood here in the sense of the set-theoretical union.

We conclude the discussion of additivity, Baire number, uniformity, and covering for measure and category by constructing the remaining 5 models. Thus we complete the analysis of Cichon's diagram.

We show that the evasion number $\mathfrak {e}$ can be added to Cichoń’s maximum with a distinct value. More specifically, it is consistent that $\aleph _1<\operatorname {\mathrm {add}}(\mathcal {N})<\operatorname {\mathrm {cov}}(\mathcal {N})<\mathfrak {b}<\mathfrak {e}<\operatorname {\mathrm {non}}(\mathcal {M})<\operatorname {\mathrm {cov}}(\mathcal {M})<\mathfrak {d}<\operatorname {\mathrm {non}}(\mathcal {N})<\operatorname {\mathrm {cof}}(\mathcal {N})<2^{\aleph _0}$ holds.

We reimplement the creature forcing construction used by Fischer et al. :1045–1103, 2017. https://doi.org/10.1007/S00153-017-0553-8. arXiv:1402.0367 [math.LO]) to separate Cichoń’s diagram into five cardinals as a countable support product. Using the fact that it is of countable support, we augment our construction by adding uncountably many additional cardinal characteristics, sometimes referred to as localisation cardinals.

Using matrix iterations of ccc posets, we prove the consistency with ZFC of some cases where the cardinals on the right hand side of Cichon’s diagram take two or three arbitrary values (two regular values, the third one with uncountable cofinality). Also, mixing this with the techniques in J Symb Log 56(3):795–810, 1991, we can prove that it is consistent with ZFC to assign, at the same time, several arbitrary regular values on the left hand side of Cichon’s (...) diagram. (shrink)

We study regularity properties related to Cohen, random, Laver, Miller and Sacks forcing, for sets of real numbers on the Δ31\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Delta}^1_3}$$\end{document} level of the projective hieararchy. For Δ21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Delta}^1_2}$$\end{document} and Σ21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Sigma}^1_2}$$\end{document} sets, the relationships between these properties follows the pattern of the well-known Cichoń diagram for cardinal characteristics of the continuum. It is known that (...) assuming suitable large cardinals, the same relationships lift to higher projective levels, but the questions become more challenging without such assumptions. Consequently, all our results are proved on the basis of ZFC alone or ZFC with an inaccessible cardinal. We also prove partial results concerning Σ31\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Sigma}^1_3}$$\end{document} and Δ41\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Delta}^1_4}$$\end{document} sets. (shrink)

We prove that in many situations it is consistent with ZFC that part of the invariants involved in Cichon's diagram are equal to $\kappa$ while the others are equal to $\lambda$, where $\kappa < \lambda$ are both arbitrary regular uncountable cardinals. We extend some of these results to the case when $\lambda$ is singular. We also show that $\mathrm{cf}) < \kappa_A$ is consistent with ZFC.

Some cardinal invariants from Cichon's diagram can be characterized using the notion of cut-and-choose games on cardinals. In this paper we give another way to characterize those cardinals in terms of infinite games. We also show that some properties for forcing, such as the Sacks Property, the Laver Property and ω ω -boundingness, are characterized by cut-and-choose games on complete Boolean algebras.

We present several models which satisfy CH and some ♦-like principles while others fail, answering a question of Moore, Hrušák and Džamonja.

We use a creature construction to show that consistently $$\begin{aligned} \mathfrak d=\aleph _1= {{\mathrm{cov}}}< {{\mathrm{non}}}< {{\mathrm{non}}}< {{\mathrm{cof}}} < 2^{\aleph _0}. \end{aligned}$$The same method shows the consistency of $$\begin{aligned} \mathfrak d=\aleph _1= {{\mathrm{cov}}}< {{\mathrm{non}}}< {{\mathrm{non}}}< {{\mathrm{cof}}} < 2^{\aleph _0}. \end{aligned}$$.

We investigate the behavior of cardinal characteristics of the reals under extensions that do not add new [Formula: see text]-sequences (for some regular [Formula: see text]). As an application, we show that consistently the following cardinal characteristics can be different: The (“independent”) characteristics in Cichoń’s diagram, plus [Formula: see text]. (So we get thirteen different values, including [Formula: see text] and continuum). We also give constructions to alternatively separate other MA-numbers (instead of [Formula: see text]), namely: MA for [Formula: see (...) text]-Knaster from MA for [Formula: see text]-Knaster; and MA for the union of all [Formula: see text]-Knaster forcings from MA for precaliber. (shrink)

There has recently been work by multiple groups in extracting the properties associated with cardinal invariants of the continuum and translating these properties into similar analogous combinatorial properties of computational oracles. Each property yields a highness notion in the Turing degrees. In this paper we study the highness notions that result from the translation of the evasion number and its dual, the prediction number, as well as two versions of the rearrangement number. When translated appropriately, these yield four new highness (...) notions. We will define these new notions, show some of their basic properties and place them in the computability-theoretic version of Cichoń's diagram. (shrink)

Continuing [6], [8] and [16], we study the consequences of the weak Freese-Nation property of (?(ω),⊆). Under this assumption, we prove that most of the known cardinal invariants including all of those appearing in Cichoń's diagram take the same value as in the corresponding Cohen model. Using this principle we could also strengthen two results of W. Just about cardinal sequences of superatomic Boolean algebras in a Cohen model. These results show that the weak Freese-Nation property of (?(ω),⊆) captures many (...) of the features of Cohen models and hence may be considered as a principle axiomatizing a good portion of the combinatorics available in Cohen models. (shrink)

Let J be any proper ideal of subsets of the real line R which contains all finite subsets of R. We define an ideal J * ∣B as follows: X ∈ J * ∣B if there exists a Borel set $B \subset R \times R$ such that $X \subset B$ and for any x ∈ R we have $\{y \in R: \langle x,y\rangle \in B\} \in \mathscr{J}$ . We show that there exists a family $\mathscr{A} \subset \mathscr{J}^\ast\mid\mathscr{B}$ of power ω (...) 1 such that $\bigcup\mathscr{A} \not\in \mathscr{J}^\ast\mid\mathscr{B}$ . In the last section we investigate properties of ideals of Lebesgue measure zero sets and meager sets in Cohen extensions of models of set theory. (shrink)

The termination of rewrite systems for parameter recursion, simple nested recursion and unnested multiple recursion is shown by using monotone interpretations both on the ordinals below the first primitive recursively closed ordinal and on the natural numbers. We show that the resulting derivation lengths are primitive recursive. As a corollary we obtain transparent and illuminating proofs of the facts that the schemata of parameter recursion, simple nested recursion and unnested multiple recursion lead from primitive recursive functions to primitive recursive functions.

By B2 we denote the σ-ideal of all subsets A of the Cantor set {0,1}ω such that for every infinite subset T of ω the restriction A∣{0,1}T is a proper subset of {0,1}T. In this paper we investigate set theoretical properties of this and similar ideals.

In this article we consider linear isomorphisms over the field of rational numbers between the linear spaces ℝ2 and ℝ. We prove that if f is such an isomorphism, then the image by f of the unit disk is a strictly nonmeasurable subset of the real line, which has different properties than classical non-measurable subsets of reals. We shall also consider the question whether all images of bounded measurable subsets of the plane via a such mapping are non-measurable.

Let F be a signature and R a strictly orthogonal rewrite system on ground terms of F . We give an effective proof of a bounding condition for R , based on a detailed analysis of how terms are transformed during the rewrite process, which allows us to give recursive bounds on the derivation lengths of terms. We give a syntactic characterisation of the Grzegorczyk hierarchy and a rewriting schema for calculating its functions. As a consequence of this, using results (...) of Elias Tahhan–Bittar, it can be shown that, for n⩾3 , the derivation length functions for functions in Grzegorczyk class E n belong to Grzegorczyk class E n+1 . We also give recursive bounds for the derivation lengths of functions defined by parameter recursion. (shrink)

Brendle, J., H. Judah and S. Shelah, Combinatorial properties of Hechler forcing, Annals of Pure and Applied Logic 59 185–199. Using a notion of rank for Hechler forcing we show: assuming ωV1 = ωL1, there is no real in V[d] which is eventually different from the reals in L[ d], where d is Hechler over V; adding one Hechler real makes the invariants on the left-hand side of Cichoń's diagram equal ω1 and those on the right-hand side equal 2ω and (...) produces a maximal almost disjoint family of subsets of ω of size ω1; there is no perfect set of random reals over V in V[ r][ d], where r is random over V and d Hechler over V[r], thus answering a question of the first and second authors. (shrink)

We introduce the property “F-linked” of subsets of posets for a given free filter F on the natural numbers, and define the properties “μ-F-linked” and “θ-F-Knaster” for posets in a natural way. We show that θ-F-Knaster posets preserve strong types of unbounded families and of maximal almost disjoint families. Concerning iterations of such posets, we develop a general technique to construct θ-Fr-Knaster posets (where Fr is the Frechet ideal) via matrix iterations of <θ-ultrafilter-linked posets (restricted to some level of the (...) matrix). This is applied to prove consistency results about Cichoń's diagram (without using large cardinals) and to prove the consistency of the fact that, for each Yorioka ideal, the four cardinal invariants associated with it are pairwise different. At the end, we show that three strongly compact cardinals are enough to force that Cichoń's diagram can be separated into 10 different values. (shrink)

We discuss a dual of the Open Coloring Axiom introduced by Abraham et al. [U. Abraham, M. Rubin, S. Shelah, On the consistency of some partition theorems for continuous colorings, and the structure of 1-dense real order types, Ann. Pure Appl. Logic 29 123–206] and show that it follows from a statement about continuous colorings on Polish spaces that is known to be consistent. We mention some consequences of the new axiom and show that implies that all cardinal invariants in (...) Cichoń’s diagram are at least 2. (shrink)

We show: The procedure mentioned in the title is often impossible. It requires at least an inner model with a measurable cardinal. The consistency strength of changing b and d from a regular κ to some regular δ < κ is a measurable of Mitchell order δ. There is an application to Cichon's diagram.

Let $R$ be a (finite) rewrite system over a (finite) signature. Let $\succ$ be a strict well-founded termination ordering on the set of terms in question so that the rules of $R$ are reducing under $\succ$ . Then $R$ is terminating. In this article it is proved for a certain class of far reaching termination orderings (of order type reaching up to the first subrecursively inaccessible ordinal, i.e. the proof-theoretic ordinal of $ID_{<\omega}$ ) that – under some reasonable assumptions which (...) are met in current applications – the derivation lengths function for $R$ is bounded by a function from the slow growing hierarchy of level determined by the order type of the underlying termination ordering. This result is a (correction of the proof of and a) strong generalization of theorem 8.1 in Cichon's article Termination orderings and complexity characterisations. Leeds, Proof Theory 1990, (Aczel, Simmons, and Wainer, editors), Cambridge University Press 1992, 171-193. (shrink)

We propose a reformulation of the ideal $\mathcal {N}$ of Lebesgue measure zero sets of reals modulo an ideal J on $\omega $, which we denote by $\mathcal {N}_J$. In the same way, we reformulate the ideal $\mathcal {E}$ generated by $F_\sigma $ measure zero sets of reals modulo J, which we denote by $\mathcal {N}^*_J$. We show that these are $\sigma $ -ideals and that $\mathcal {N}_J=\mathcal {N}$ iff J has the Baire property, which in turn is equivalent to (...) $\mathcal {N}^*_J=\mathcal {E}$. Moreover, we prove that $\mathcal {N}_J$ does not contain co-meager sets and $\mathcal {N}^*_J$ contains non-meager sets when J does not have the Baire property. We also prove a deep connection between these ideals modulo J and the notion of nearly coherence of filters (or ideals). We also study the cardinal characteristics associated with $\mathcal {N}_J$ and $\mathcal {N}^*_J$. We show their position with respect to Cichoń’s diagram and prove consistency results in connection with other very classical cardinal characteristics of the continuum, leaving just very few open questions. To achieve this, we discovered a new characterization of $\mathrm {add}(\mathcal {N})$ and $\mathrm {cof}(\mathcal {N})$. We also show that, in Cohen model, we can obtain many different values to the cardinal characteristics associated with our new ideals. (shrink)

In this article we give a unifying approach to the theory of fundamental sequences and their related Hardy hierarchies of number-theoretic functions and we show the equivalence of the new approach with the classical one.

In this article we show how to extract with the use of the Buchholz -Cichon-Weiermann approach to subrecursive hierarchies from Rathjen's 1991 ordinal analysis of KPM a characterization of the provably total number-theoretic functions of KPM and some of its subsystems in a uniform and direct way.

The main purpose of this dissertation is to apply and develop new forcing techniques to obtain models where several cardinal characteristics are pairwise different as well as force many (even more, continuum many) different values of cardinal characteristics that are parametrized by reals. In particular, we look at cardinal characteristics associated with strong measure zero, Yorioka ideals, and localization and anti-localization cardinals.In this thesis we introduce the property “F-linked” of subsets of posets for a given free filter F on the (...) natural numbers, and define the properties “ $\mu $ -F-linked” and “ $\theta $ -F-Knaster” for posets in a natural way. We show that $\theta $ -F-Knaster posets preserve strong types of unbounded families and of maximal almost disjoint families. These kinds of posets led to the development of a general technique to construct $\theta $ - $\textrm {Fr}$ -Knaster posets (where $\textrm {Fr}$ is the Frechet ideal) via matrix iterations of ${<}\theta $ -ultrafilter-linked posets (restricted to some level of the matrix). The latter technique allows proving consistency results about Cichoń’s diagram (without using large cardinals) and to prove the consistency of the fact that, for each Yorioka ideal, the four cardinal characteristics associated with it are pairwise different. Another important application is to show that three strongly compact cardinals are enough to force that Cichoń’s diagram can be separated into 10 different values. Later on, it was shown by Goldstern, Kellner, Mejía, and Shelah that no large cardinals are needed for Cichoń’s maximum (J. Eur. Math. Soc. 24 (2022), no. 11, p. 3951–3967).On the other hand, we deal with certain types of tree forcings including Sacks forcing, and show that these increase the covering of the strong measure zero ideal $\mathcal {SN}$. As a consequence, in Sacks model, such covering number is equal to the size of the continuum, which indicates that this covering number is consistently larger than any other classical cardinal characteristics of the continuum. Even more, Sacks forcing can be used to force that $\operatorname {\mathrm{non}}(\mathcal {SN})<\operatorname {\mathrm{cov}}(\mathcal {SN})<\operatorname {\mathrm{cof}}(\mathcal {SN})$, which is the first consistency result where more than two cardinal characteristics associated with $\mathcal {SN}$ are pairwise different. To obtain another result in this direction, we provide bounds for $\operatorname {\mathrm{cof}}(\mathcal {SN})$, which generalizes Yorioka’s characterization of $\mathcal {SN}$ (J. Symbolic Logic 67.4 (2002), p. 1373–1384). As a consequence, we get the consistency of $\operatorname {\mathrm{add}}(\mathcal {SN})=\operatorname {\mathrm{cov}}(\mathcal {SN})<\operatorname {\mathrm{non}}(\mathcal {SN})<\operatorname {\mathrm{cof}}(\mathcal {SN})$ with ZFC (via a matrix iteration forcing construction).We conclude this thesis by combining creature forcing approaches by Kellner and Shelah (Arch. Math. Logic 51.1–2 (2012), p. 49–70) and by Fischer, Goldstern, Kellner, and Shelah (Arch. Math. Logic 56.7–8 (2017), p. 1045–1103) to show that, under CH, there is a proper $\omega ^\omega $ -bounding poset with $\aleph _2$ -cc that forces continuum many pairwise different cardinal characteristics, parametrized by reals, for each one of the following six types: uniformity and covering numbers of Yorioka ideals as well as both kinds of localization and anti-localization cardinals, respectively. This answers several open questions from Klausner and Mejía (Arch. Math. Logic 61 (2022), pp. 653–683).Abstract prepared by Miguel Antonio Cardona-MontoyaE-mail: [email protected]: https://repositum.tuwien.at/handle/20.500.12708/19629. (shrink)

In many cases medical diagnosis is based on information obtained through a process involving the emission of different forms of ionizing radiation. The safety of the medical staff and patients exposed to ionizing radiation is highly dependent on the proper design of the shielding used in the laboratory. Therefore, the authors propose a multi-platform application supporting such a design through the computation of the critical parameters of shielding. The specific requirements for shielding are defined by government authorities so the algorithm (...) must comply with all the written standards. The application was implemented using Xamarin. Forms for cross-platform development. The results obtained with the use of the developed tool were compared with those calculated manually for the design of stationary shields developed, deployed, and validated by local inspection. (shrink)

We estimate the derivation lengths of functionals in Gödel's system \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document} of primitive recursive functionals of finite type by a purely recursion-theoretic analysis of Schütte's 1977 exposition of Howard's weak normalization proof for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document}. By using collapsing techniques from Pohlers' local predicativity approach to proof theory and based on the Buchholz-Cichon and Weiermann 1994 approach to subrecursive hierarchies we define (...) a collapsing f unction\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\cal D}:T\to \omega$\end{document} so that for (closed) terms \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $a,b$\end{document} of Gödel's \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document} we have: If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $a$\end{document} reduces to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $b$\end{document} then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\omega>{\cal D}(a)>{\cal D}(b).$\end{document} By one uniform proof we obtain as corollaries: A derivation lengths classification for functionals in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document}, hence new proof of strongly uniform termination of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document}. A new proof of the Kreisel's classific ation of the number-theoretic functions which can be defined in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document}, hence a classification of the provably total functions of Peano Arithmetic. A new proof of Tait's results on weak normalization for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document}. A new proof of Troelstra's result on strong normalization for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document}. Additionally, a slow growing analysis of Gödel's \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document} is obtained via Girard's hierarchy comparison theorem. This analyis yields a contribution to two open pro blems posed by Girard in part two of his book on proof theory. For the sake of completeness we also mention the Howard Schütte bound on derivation lengths for the simple typed \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\lambda$\end{document}-calculus. (shrink)

Following a line of research initiated in [4], we describe a general framework for turning reduction concepts of relative computability into diagrams forming an analogy with the Cichoń diagram for cardinal characteristics of the continuum. We show that working from relatively modest assumptions about a notion of reduction, one can construct a robust version of such a diagram. As an application, we define and investigate the Cichoń diagram for degrees of constructibility relative to a fixed inner model W. Many analogies (...) hold with the classical theory as well as some surprising differences. Along the way, we introduce a new axiom stating, roughly, that the constructibility diagram is as complex as possible. (shrink)

Rosłanowski and Shelah [Small-large subgroups of the reals, Math. Slov. 68(3) (2018) 473–484] asked whether every locally compact non-discrete group has a null but non-meager subgroup, and conversely, whether it is consistent with [Formula: see text] that in every locally compact group a meager subgroup is always null. They gave affirmative answers for both questions in the case of the Cantor group and the reals. In this paper, we give affirmative answers for the general case.

Inspired by Pohlers' proof-theoretic analysis of KPω we give a straightforward non-metamathematical proof of the (well-known) classification of the provably total functions of $PA, PA + TI(\prec\lceil)$ (where it is assumed that the well-ordering $\prec$ has some reasonable closure properties) and KPω. Our method relies on a new approach to subrecursion due to Buchholz, Cichon and the author.

The slow growing hierarchy is commonly defined as follows: G0 = 0, Gx−1 := Gx + 1 and Gλ := Gλ[x] where λ<0 is a limit and ·[·]:0∩ Lim × ω → 0 is a given assignment of fundamental sequences for the limits below 0. The first obvious question which is encountered when one looks at this definition is: How does this hierarchy depend on the choice of the underlying system of fundamental sequences? Of course, it is well known and (...) easy to prove that for the standard assignment of fundamental sequence the hierarchy x<0 is slow growing, i.e. each Gx is majorized by a Kalmar elementary recursive function.It is shown in this paper that the slow growing hierarchy x<0 — when it is defined with respect to the norm-based assignment of fundamental sequences which is defined in the article by Cichon — is actually fast growing, i.e. each PA-provably recursive function is eventually dominated by Gx for some α<0. The exact classification of this hierarchy, i.e. the problem whether it is slow or fast growing, has been unsolved since 1992. The somewhat unexpected result of this paper shows that the slow growing hierarchy is extremely sensitive with respect to the choice of the underlying system of fundamental sequences.The paper is essentially self-contained. Only little knowledge about ordinals less than 0 — like the existence of Cantor normal forms, etc. and the beginnings of subrecursive hierarchy theory as presented, for example, in the 1984 textbook of Rose — is assumed. (shrink)

We give a term rewriting characterization of the polyspace functions. Our work follows investigations on term rewriting characterizations of some classes of (sub-) recursive functions as initiated by Cichon and Weiermann [4] and continued by Beckmann and Weiermann [1].The main novelty of this paper is a technique for reformulating recursion schemes. The aim of this technique is to provide rewriting rules which give rise to rewriting chains whose terms are suitably bounded. This bounding is crucial when dealing with computational (...) classes with space constraints. (shrink)

This article aims to develop new conceptions of the psychosocial dynamics that drive the re-romanticization of domestic femininity in current financialized capitalism. Feminist scholars have described this heightened cultivation of mothering as a reparative move in response to irreconcilable tensions between cultural ideals of the ‘balancing mother’ and ‘lean-in femininity’. This article adds a materialist-psychosocial lens to these conceptions, to enhance understanding of what drives this craving for domestic femininity. Drawing on a free-association narrative interview study with couples in the (...) financial elite in the comparatively gender-egalitarian Norwegian context, I describe a specific emotional mechanism that resists democratization of gender in this specific group. The interviews reveal a felt need to cultivate ‘the human side of things’ at safe distance from the competitiveness of ‘hard-core finance’. The Nordic earner–carer model with its entwinement of care and professional pursuits, cultivated by the more self-fulfilment-oriented parts of the professional middle-class appears not only unwanted but threatening. In my analysis, I retrieve and develop a psychoanalytically inspired historical-materialist feminism, one that perceives of the gendered division of work as a split in modes of focusing human energy. I suggest that the resurgent cultivation of domestic femininity is nurtured by a self-energizing antagonism between competitive and relational practices. I further argue that the cultivation of domestic femininity in these financial couples points to a potential antagonism between the democratization of love and the specific anxiety-driven competitiveness to which this financial-elite group may be particularly susceptible. (shrink)