In the context of theistic religions, God representations are an important factor in explaining associations between religion/spirituality and well-being/mental health. Although the limitations of self-report measures of God representations are widely acknowledged, well-validated implicit measures are still unavailable. Therefore, we developed an implicit Attachment to God measure, the Apperception Test God Representations. In this study, we examined reliability and validity of an experimental scale based on attachment theory. Seventy-one nonclinical and 74 clinical respondents told stories about 15 cards with images (...) of people. The composite Attachment to God scale is based on scores on two scales that measure dimensions of Attachment to God: God as Safe Haven and God as Secure Base. God as Safe Haven scores are based on two subscales: Asking Support and Receiving Support from God. Several combinations of scores on these latter subscales are used to assess Anxious and Avoidant attachment to God. A final scale, Percentage Secure Base, measures primary appraisal of situations as nonthreatening. Intraclass correlation coefficients showed that the composite Attachment to God scale could be scored reliably. Associations of scores on the ATGR scales and on the explicit Attachment to God Inventory with scores on implicitly and explicitly measured distress partly confirmed the validity of the ATGR scales by demonstrating expected patterns of associations. Avoidant attachment to God seemed to be assessed more validly with the implicit than with the explicit scale. Patients scored more insecure on the composite Attachment to God scale and three subscales than nonpatients. (shrink)
It is argued that editors have a moral responsibility to reject submissions that they felt publication of which may cause harm. However, Ploeg and others suggest that there may exist better alternatives to rejection. He also called for the code of publication ethics to incorporate acknowledgement of the moral responsibility for the effects of publishing, define benefits and harms of publishing, and specify a range of actions an editor may take. This letter highlights a recent such rejection ostensibly made on (...) the basis of harm, but could easily be construed as editorial bias, and supports the call for improving the code of publication ethics to guide editors and secure consistency in decisions. (shrink)
In the context of his theory of numberings, Ershov showed that Kleene's recursion theorem holds for any precomplete numbering. We discuss various generalizations of this result. Among other things, we show that Arslanov's completeness criterion also holds for every precomplete numbering, and we discuss the relation with Visser's ADN theorem, as well as the uniformity or nonuniformity of the various fixed point theorems. Finally, we base numberings on partial combinatory algebras and prove a generalization of Ershov's theorem in this context.
One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the representation of reasoning and the resulting systems of computer mathematics on the other hand.
Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators or, in a more direct way, in which derivations are not translated. Both translations are (...) closely related in a canonical way. The two direct translations turn out to be complete. The paper fulfills the program of Church [1932], [1933] and Curry [1930] to base logic on a consistent system of λ-terms or combinators. Hitherto this program had failed because systems of ICL were either too weak (to provide a sound interpretation) or too strong (sometimes even inconsistent). (shrink)
Participants were unknowingly exposed to complex regularities in a working memory task. The existence of implicit knowledge was subsequently inferred from a preference for stimuli with similar grammatical regularities. Several affective traits have been shown to influence AGL performance positively, many of which are related to a tendency for automatic responding. We therefore tested whether the mindfulness trait predicted a reduction of grammatically congruent preferences, and used emotional primes to explore the influence of affect. Mindfulness was shown to correlate negatively (...) with grammatically congruent responses. Negative primes were shown to result in faster and more negative evaluations. We conclude that grammatically congruent preference ratings rely on habitual responses, and that our findings provide empirical evidence for the non-reactive disposition of the mindfulness trait. (shrink)
A closed λ-term E is called an enumerator if M ε /gL/dg /gTn ε N E/drn/dl = β M. Here Λ° is the set of closed λ-terms, N is the set of natural numbers and the /drn/dl are the Church numerals λfx./tfnx. Such an E is called reducing if moreover M ε /gL/dg /gTn ε N E/drn/dl /a/gb M. In 1983 I conjectured that every enumerator is reducing. An ingenious recursion theoretic proof of this conjecture by Statman is presented in (...)Barendregt . The proof is not intuitionistically valid, however. Dirk van Dalen has encouraged me to find intuitionistic proofs whenever possible. In the lambda calculus this is usually not difficult. In this paper an intuitionistic version of Statmans proof will be given. It took me somewhat longer to find it than in other cases. (shrink)
A λ-theory T is a consistent set of equations between λ-terms closed under derivability. The degree of T is the degree of the set of Godel numbers of its elements. H is the $\lamda$ -theory axiomatized by the set {M = N ∣ M, N unsolvable. A $\lamda$ -theory is sensible $\operatorname{iff} T \supset \mathscr{H}$ , for a motivation see [6] and [4]. In § it is proved that the theory H is ∑ 0 2 -complete. We present Wadsworth's proof (...) that its unique maximal consistent extention $\mathscr{H}^\ast (= \mathrm{T}(D_\infty))$ is Π 0 2 -complete. In $\S2$ it is proved that $\mathscr{H}_\eta(= \lambda_\eta-\text{Calculus} + \mathscr{H})$ is not closed under the ω-rule (see [1]). In $\S3$ arguments are given to conjecture that $\mathscr{H}\omega (= \lambda + \mathscr{H} + omega-rule)$ is Π 1 1 -complete. This is done by representing recursive sets of sequence numbers as λ-terms and by connecting wellfoundedness of trees with provability in Hω. In $\S4$ an infinite set of equations independent over H η will be constructed. From this it follows that there are 2^{ℵ_0 sensible theories T such that $\mathscr{H} \subset T \subset \mathscr{H}^\ast$ and 2 ℵ 0 sensible hard models of arbitrarily high degrees. In $\S5$ some nonprovability results needed in $\S\S1$ and 2 are established. For this purpose one uses the theory H η extended with a reduction relation for which the Church-Rosser theorem holds. The concept of Gross reduction is used in order to show that certain terms have no common reduct. (shrink)
Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers 4 systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators, or in a more direct way, in which derivations are not translated. Both translations (...) are closely related in a canonical way. In a preceding paper, Barendregt, Bunder and Dekkers, 1993, we proved completeness of the two direct translations. In the present paper we prove completeness of the two indirect translations by showing that the corresponding illative systems are conservative over the two systems for the direct translations. In another version, DBB (1997), we shall give a more direct completeness proof. These papers fulfill the program of Church and Curry to base logic on a consistent system of $\lambda$ -terms or combinators. Hitherto this program had failed because systems of ICL were either too weak (to provide a sound interpretation) or too strong (sometimes even inconsistent). (shrink)
Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. In a preceding paper, [2], we considered 4 systems of illative combinatory logic that are sound for first order intuitionistic propositional and predicate logic. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators, or in a more direct way, in which (...) derivations are not translated. Both translations are closely related in a canonical way. In the cited paper we proved completeness of the two direct translations. In the present paper we prove that also the two indirect translations are complete. These proofs are direct whereas in another version, [3], we proved completeness by showing that the two corresponding illative systems are conservative over the two systems for the direct translations. Moreover we shall prove that one of the systems is also complete for predicate calculus with higher type functions. (shrink)
Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants intended to capture inference. In a preceding paper, [2], we considered 4 systems of illative combinatory logic that are sound for first order intuitionistic propositional and predicate logic. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators, or in a more direct way, in which derivations are not translated. Both (...) translations are closely related in a canonical way. In the cited paper we proved completeness of the two direct translations. In the present paper we prove that also the two indirect translations are complete. These proofs are direct whereas in another version, [3], we proved completeness by showing that the two corresponding illative systems are conservative over the two systems for the direct translations. Moreover we shall prove that one of the systems is also complete for predicate calculus with higher type functions. (shrink)
In this study we analyzed to what extent partners who share the same household affect each other's exposure to television. With the use of linear structural equation modeling we analyzed data from a large scale representative survey in The Netherlands. Results indicate that both men and women influence their partner's exposure to television. When people spend much time watching television, their partners are also likely to spend a lot of time in front of the television. These influences on each other's (...) exposure were of equal magnitude for both men and women. Finally, we found a strong socialization effect of parental viewing in the family of origin. (shrink)
Health technology assessment (HTA) is often biased in the sense that it neglects relevant perspectives on the technology in question. To incorporate different perspectives in HTA, we should pursue agreement about what are relevant, plausible, and feasible research questions; interactive technology assessment (iTA) might be suitable for this goal. In this way a kind of procedural ethics is established. Currently, ethics too often is focussed on the application of general principles, which leaves a lot of confusion as to what really (...) is the matter in specific cases; in an iTA clashes of values should not be approached by use of such ethics. Instead, casuistry, as a tool used within the framework of iTA, should help to articulate and clarify what is the matter, as to make room for explication and consensus building. (shrink)
Events often share elements that guide us to integrate knowledge from these events. Integration allows us to make inferences that affect reactions to new events. Integrating events and making inferences are thought to depend on consciousness. We show that even unconsciously experienced events, that share elements, are integrated and influence reactions to new events. An unconscious event consisted of the subliminal presentation of two unrelated words. Half of subliminal word pairs shared one word . Overlapping word pairs were presented between (...) 6 s and 78 s apart. The test for integration required participants to judge the semantic distance between suprathreshold words . Evidence of integration was provided by faster reactions to suprathreshold words that were indirectly related versus unrelated. This effect was independent of the time interval between overlapping word pairs. We conclude that consciousness is no requirement for the integration of discontiguous events. (shrink)
