The differentiation of trait anxiety and depression in nonclinical and clinical populations is addressed. Following the tripartite model, it is assumed that anxiety and depression share a large portion of negative affectivity, but differ with respect to bodily hyperarousal and anhedonia. In contrast to the tripartite model, NA is subdivided into worry and dysthymia, which leads to a four-variable model of anxiety and depression encompassing emotionality, worry, dysthymia, and anhedonia. Item-level confirmatory factor analyses and latent class cluster analysis based on (...) a large nation-wide representative German sample substantiate the construct validity of the model. Further evidence concerning convergent and discriminant validity with respect to related constructs is obtained in two smaller nonclinical and clinical samples. Factors influencing the association between components of anxiety and depression are discussed. (shrink)

Two simply typed term systems $\sf {PR}_1$ and $\sf {PR}_2$ are considered, both for representing algorithms computing primitive recursive functions. $\sf {PR}_1$ is based on primitive recursion, $\sf {PR}_2$ on recursion on notation. A purely syntactical method of determining the computational complexity of algorithms in $\sf {PR}_i$ , called $\mu$ -measure, is employed to uniformly integrate traditional results in subrecursion theory with resource-free characterisations of sub-elementary complexity classes. Extending the Schwichtenberg and Müller characterisation of the Grzegorczyk classes ${\mathcal{E}}_n$ for $n\ge (...) 3$ , it is shown $\mathcal{E}_{n+1} = \mathcal{R}^n_1 $ for $ n\ge 1 $, where $ \mathcal{R}^n_i$ denotes the \emph{ $n$ th modified Heinermann class} based on $\mu$ . The proof does not refer to any machine-based computation model, unlike the Schwichtenberg and Müller proofs. This is due to the notion of modified recursion lying on top of each other provided by $\mu$ . By Ritchie's result, $\mathcal{R}^1_1$ characterises the linear-space computable functions. Using the same method, a short and straightforward proof is presented, showing that $\mathcal{R}^1_2$ characterises the polynomial time computable functions. Furthermore, the classes $\mathcal{R}^n_2$ and $\mathcal{R}^n_1$ coincide at and above level 2. (shrink)

This article aims principally at a reflection on the discursive reading of democracy and the democratic state of law as conceived by the German philosopher Jürgen Habermas, with a view to confront them with some sociological theories concerning democracy. In these models, Habermas seeks to identify elements that put under risk all that he understands as deliberative processes opinion formation and as the citizens will, emphasizing his model of a deliberative democracy.

The paper builds on both a simply typed term system ${\cal PR}^\omega$ and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion of partial primitive recursive functional on Scott domains $D_\rho$ supporting a suitable concept of parallelism. Computability on Scott domains seems to entail that Kleene's schema of higher type simultaneous course-of-values recursion (scvr) is not reducible to partial primitive recursion. So extensions ${\cal PR}^{\omega e}$ and PTWP $^e$ are studied that (...) are closed under scvr. The twist are certain type 1 Gödel recursors ${\cal R}_k$ for simultaneous partial primitive recursion. Formally, ${\cal R}_k\vec{g}\vec{H}xi$ denotes a function $f_i \in D_{\iota\to\iota}$ , however, ${\cal R}_k$ is modelled such that $f_i$ is finite, or in other words, a partial sequence. As for PTWP $^e$ , the concept of type $\iota\to\iota$ writable variables is introduced, providing the possibility of creating and manipulating partial sequences. It is shown that the PTWP $^e$ -computable functionals coincide with those definable in ${\cal PR}^{\omega e}$ plus a constant for sequential minimisation. In particular, the functionals definable in ${\cal PR}^{\omega e}$ denoted ${\cal R}^{\omega e}$ can be characterised by a subclass of PTWP $^e$ -computable functionals denoted ${\rm PPR}^{\omega e}$ . Moreover, hierarchies of strictly increasing classes ${\cal R}^{\omega e}_n$ in the style of Heinermann and complexity classes ${\rm PPR}^{\omega e}_n$ are introduced such that $\forall n\ge 0. {\cal R}^{\omega e}_n ={\rm PPR}^{\omega e}_n$ . These results extend those for ${\cal PR}^\omega$ and PTWP [Nig94]. Finally, scvr is employed to define for each type $\sigma$ the enumeration functional $E^\sigma$ of all finite elements of $D_\sigma$. (shrink)

The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, this notion supports a rich concept of parallelism in the sense of Plotkin. The complexity of these functions is analysed by a hierarchy of classes ${\cal E}^{\bot}_n$ similar to the Grzegorczyk classes. The functions considered are characterised by a function algebra ${\cal R}^{\bot}$ generated by continuity preserving operations starting from computable initial functions. Its (...) layers ${\cal R}^{\bot}_n$ are related to those above by showing $\forall n \ge 2.{\cal E}^{\bot}_{n+1} ={\cal R}^{\bot}_n$ , thus generalising results of Schwichtenberg/Müller and Niggl. (shrink)

Romano Guardini gilt als einer der massgeblichen christlichen Denker des 20. Jahrhunderts. Seine Schriften, philosophische und theologische Abhandlungen, aber auch zahlreiche meditative und spirituelle Texte, haben eine weltweite Verbreitung gefunden und pragen ungebrochen bis heute Generationen von Leserinnen und Lesern. Der vorliegende Band, der aus Anlass des 50. Todestages Romano Guardinis am 1. Oktober 2018 sowie zur Eroffnung des Seligsprechungsprozesses erscheint, versammelt Beitrage namhafter Autorinnen und Autoren. Aus unterschiedlichen Perspektiven widmen sie sich insbesondere Guardinis Buch "Der Herr" uber Person und (...) Botschaft Jesu Christi, aber beispielsweise auch Aspekten der Gottesfrage, der Ethik oder des Gebets. Eine Fundgrube fur alle, die sich der Person und dem Denken Guardinis neu nahern mochten. Mit Beitragen von Hanna-Barbara Gerl-Falkovitz, Jean Greisch, Karl Kardinal Lehmann (+), Peter Reifenberg, Marius Reiser, Peter Schallenberg, P. Kosmas Lars Thielmann OCist, Karl-Heinz Wiesemann. (shrink)

The paper builds on a simply typed term system ${\cal PR}^\omega $ providing a notion of partial primitive recursive functional on arbitrary Scott domains $D_\sigma$ that includes a suitable concept of parallelism. Computability on the partial continuous functionals seems to entail that Kleene's schema of higher type simultaneous course-of-values recursion (SCVR) is not reducible to partial primitive recursion. So an extension ${\cal PR}^{\omega e}$ is studied that is closed under SCVR and yet stays within the realm of subrecursiveness. The twist (...) are certain type 1 Gödel recursors ${\cal R}_k$ for simultaneous partial primitive recursion. Formally, the value ${\cal R}_k\vec{g}\vec{H} x i$ is a function $f_i$ of type $\iota \to \iota$ , however, ${\cal R}_k$ is modelled such that $f_i$ is a finite element of $D_{\iota\to\iota}$ or in other words, a partial sequence. It is shown that the Ackermann function is not definable in ${\cal PR}^{\omega e}$. (shrink)

The chronological proximity of the Marburg neo-Kantian school and Edith Stein's phenomenological philosophy, and - related to this - the existence of common philosophical problems allow us to approach the question of the relationship between Edith Stein and the Marburg neo-Kantian school not looking for similarities, but rather comparing the points of view of Edith Stein and Paul Natorp (the author chosen to represent this School) on the same problems.

We will prove in Zermelo-Fraenkel set theory without axiom of choice that the transitive hull R* of a relation R is not much “bigger” than R itself. As a measure for the size of a relation we introduce the notion of κ+-narrowness using surjective Hartogs numbers rather than the usul injective Hartogs values. The main theorem of this paper states that the transitive hull of a κ+-narrow relation is κ+-narrow. As an immediate corollary we obtain that, for every infinite cardinal (...) κ, the class HCκ of all κ-hereditary sets is a set with von Neumann rank ϱ(HCκ) ≤ κ+. Moreover, ϱ(HCκ) = κ+ if and only if κ is singular, otherwise ϱ(HCκ) = κ. The statements of the corollary are well known in the presence of the axiom of choice (AC). To prove them without AC - as carried through here - is, however, much harder. A special case of the corollary (κ = ω1, i.e., the class HCω1 of all hereditarily countable sets) has been treated independently by T. JECH. (shrink)

Auch als originar politischer Denker ist Karl Jaspers reich an Einsichten: Ausgehend vom Ethos der Freiheit jedes Einzelnen richtet er seinen Blick auf die konkrete politische Gestaltung einer Freiheitsordnung. Dabei steht fur ihn im Hinblick auf die noch junge Bundesrepublik die Selbsterziehung in Freiheit im Zentrum seiner oft mahnenden Worte. Ganz im sokratischen Sinne fordert er intellektuelle Redlichkeit und politische Wahrhaftigkeit ein, um den beiden grossen Gegenwartsherausforderungen gewachsen zu sein: einer atomwaffenbestuckten Welt, die sich jederzeit selbst ausloschen kann, und (...) dem modernen Totalitarismus, der in seiner Verherrlichung des Antipolitischen allen politischen Ordnungsbestrebungen die Vernichtung androht. Jeder Frieden, der mehr ist als die Friedhofsruhe eines Waffenstillstands, grundet fur Jaspers in der politischen Freiheit handelnder Burgerinnen und Burger, die gemeinsam Sorge fur die Integritat ihres politischen Gemeinwesens tragen. Mit Beitragen von Karl-Heinz Breier, Alexander Gantschow, Anton Hugli, Annabelle Petschow, Kurt Salamun, Reinhard Schulz, Bernhard Sutor, Bernd Weidmann. (shrink)