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)

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 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)

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)

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)

Is there still any importance of Husserl's Phenomenology for contemporary forms of philosophy of science? A comparison between Phenomenology and a prominent form of such modern philosophy of science, the so-called 'Critical Rationalism' of Karl Popper, may help to answer this question. Therefore, the different levels of argumentation have to be worked out to make the respective arguments applicable to one another. We are arguing for the following thesis: the strategy of corroboration in Critical Rationalism can be justified by (...) means of the phenomenological conception of 'intentionality of consciousness'. A typical example may illustrate how Popper's conception of taking the degree of corroboration as an indicator of the degree of verisimilitude can find its deeper foundation in Husserl's genetic interpretation of ordinary kinds of experience. (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.

Pohl (Chinese studies, Trier U., Germany) and Muller (philosophy, Trier U.) present 16 contributions penned by U.S., German, Taiwanese, and Chinese scholars that explore the ethical viewpoints of their respective philosophical traditions. The collection is meant to be cross-cultural at the same time as it attends to the political/ideological rifts of the Western and Chinese regions. After exploring theoretical issues of understanding ethics in a global context, the contributors explore ethical and political values for Chinese and Western societies respectively. Final (...) papers offer a more explicitly comparative approach, looking at such ideas as morality and the family, medical ethics, and jurisprudential attitudes towards human rights. Annotation copyrighted by Book News, Inc., Portland, OR. (shrink)

We study a notion ofpartial primitive recursion (p.p.r.) including the concept ofparallelism in the context of partial continuous functions of type level one in the sense of [Krei], [Sco82], [Ers]. A variety of subrecursive hierarchies with respect top.p.r. is introduced and it turns out that they all coincide.

Habermas' discourse theory stresses the autonomy of public deliberation transcending the spontaneous emergence of private networks of legal relationships between individuals. Only the public discourse which is detached from the inertia of overlapping practical forms of coordination can refer to the ideally designed social work of legitimated interpersonal relationships. The democratic constitution is regarded as a legal institutionalization of the priority of the public forum of discourse. Conceptions related to classical liberalism would question the cognitive potential of public deliberation, and (...) even deny its productivity as a normative frame of reference for (post‐)modern societies which are confronted with the challenge of uncertainty and the continuous process of self‐transformation. (shrink)

It is easy to prove in ZF− that a relation R satisfies the maximal condition if and only if its transitive hull R* does; equivalently: R is well-founded if and only if R* is. We will show in the following that, if the maximal condition is replaced by the chain condition, as is often the case in Algebra, the resulting statement is not provable in ZF− anymore . More precisely, we will prove that this statement is equivalent in ZF− to (...) the countable axiom of choice ACω. Moreover, applying this result we will prove that the axiom of dependent choices, restricted to partial orders as used in Algebra, already implies the general form for arbitrary relations as formulated first by Teichmüller and, independently, some time later by Bernays and Tarski. (shrink)

Um eine globale Dimension zu gewinnen, muss moderne Geschichtswissenschaft theoriefähig sein. Das hier vorgeschlagene Konzept einer Historie, die sich zur Theorie hin weitet, entspricht einem neuen Paradigma des forschenden Umgangs mit Vergangenheit, also einer Fortbildung des Wissens zum Denken.