198 research outputs found

    Christian Responsibility

    Get PDF

    The Cosmological Proof for the Existence of God in Post-Reformation Theology

    Get PDF
    It ls the aim of this study to inquire whether the Post-Reformation theologians were aware of the difficulty which the cosmological proof has encountered in later thought, and, if so, how they responded to this difficulty

    The Morality of the Book of Judges

    Get PDF
    The purpose of this paper is not to establish the moral standard obtaining in this period of disorder, as though the standard of Jehovah were inferior to that of a later day, in that the deeds of God\u27s specially chosen deliverers, were to be an example to His people also morally, thereby making the standard. An objective examination of this morality would prove it the same as the Biblical morality of any other age; but that lies beyond our discussion. Again the purpose is not to prove that the Judges or God\u27s people did nothing contrary to the moral law of God

    The Use of the Word in the Counseling Process

    Get PDF
    The purpose of this study was to investigate the problem of what is meant by pastoral care and pastoral counseling, and by the counseling process, the techniques used in that process, and the place of the pastoral counseling process in the practical ministry of the pastor; then, to relate these findings to a sound scriptural approach of the use of the Word in the counseling process

    Bounds on entanglement assisted source-channel coding via the Lovasz theta number and its variants

    Get PDF
    We study zero-error entanglement assisted source-channel coding (communication in the presence of side information). Adapting a technique of Beigi, we show that such coding requires existence of a set of vectors satisfying orthogonality conditions related to suitably defined graphs GG and HH. Such vectors exist if and only if ϑ(G‾)≤ϑ(H‾)\vartheta(\overline{G}) \le \vartheta(\overline{H}) where ϑ\vartheta represents the Lov\'asz number. We also obtain similar inequalities for the related Schrijver ϑ−\vartheta^- and Szegedy ϑ+\vartheta^+ numbers. These inequalities reproduce several known bounds and also lead to new results. We provide a lower bound on the entanglement assisted cost rate. We show that the entanglement assisted independence number is bounded by the Schrijver number: α∗(G)≤ϑ−(G)\alpha^*(G) \le \vartheta^-(G). Therefore, we are able to disprove the conjecture that the one-shot entanglement-assisted zero-error capacity is equal to the integer part of the Lov\'asz number. Beigi introduced a quantity β\beta as an upper bound on α∗\alpha^* and posed the question of whether β(G)=⌊ϑ(G)⌋\beta(G) = \lfloor \vartheta(G) \rfloor. We answer this in the affirmative and show that a related quantity is equal to ⌈ϑ(G)⌉\lceil \vartheta(G) \rceil. We show that a quantity χvect(G)\chi_{\textrm{vect}}(G) recently introduced in the context of Tsirelson's conjecture is equal to ⌈ϑ+(G‾)⌉\lceil \vartheta^+(\overline{G}) \rceil. In an appendix we investigate multiplicativity properties of Schrijver's and Szegedy's numbers, as well as projective rank.Comment: Fixed proof of multiplicativity; more connections to prior work in conclusion; many changes in expositio

    Estimating quantum chromatic numbers

    Get PDF
    We develop further the new versions of quantum chromatic numbers of graphs introduced by the first and fourth authors. We prove that the problem of computation of the commuting quantum chromatic number of a graph is solvable by an SDP algorithm and describe an hierarchy of variants of the commuting quantum chromatic number which converge to it. We introduce the tracial rank of a graph, a parameter that gives a lower bound for the commuting quantum chromatic number and parallels the projective rank, and prove that it is multiplicative. We describe the tracial rank, the projective rank and the fractional chromatic numbers in a unified manner that clarifies their connection with the commuting quantum chromatic number, the quantum chromatic number and the classical chromatic number, respectively. Finally, we present a new SDP algorithm that yields a parameter larger than the Lov\'asz number and is yet a lower bound for the tracial rank of the graph. We determine the precise value of the tracial rank of an odd cycle.Comment: 34 pages; v2 has improved presentation based after referees' comments, published versio

    Häusliche Gewalt - Forschungsstand

    Get PDF
    Häusliche Gewalt hat viele Erscheinungsformen. Im vorliegenden Beitrag soll ein Überblick über den aktuellen Forschungsstand zum Phänomen der Häuslichen Gewalt im europäischen und insbesondere im deutschsprachigen Raum gegeben werden. Es wird im Weiteren auf Gewalthandlungen, -folgen und Unterstützungsangebote eingegangen. Es erfolgt eine Bezugnahme auf Psychosoziale Prozessbegleitung als Unterstützungsangebot für von Häuslicher Gewalt betroffene Menschen und im Fazit wird ein Ausblick auf mögliche Verbesserungen gegeben
    • …
    corecore