Benefits and challenges in practice-oriented psychotherapy research in Germany: The TK and the QS-PSY-BAY projects of quality assurance in outpatient psychotherapy

Objective: Two patient-focused long-term research projects performed in the German outpatient psychotherapy system are focused on in this article. The TK (Techniker Krankenkasse) project is the first study to evaluate a quality assurance and feedback system with regard to its practical feasibility in German routine care. The other study (“Quality Assurance in Outpatient Psychotherapy in Bavaria”; QS-PSY-BAY) was designed to test a new approach for quality assurance in outpatient psychotherapy using electronic documentation of patient characteristics and outcome parameters. In addition this project provides the opportunity to analyze data on health-related costs for the patients undergoing outpatient psychotherapy. Method: Both projects and their results indicating high effect sizes are briefly described. Results: From the perspectives of the research teams, advisory boards and other stakeholders, the experiences with these projects are discussed focusing on obstacles, challenges, difficulties, and benefits in developing and implementing the studies. The triangle collaboration of therapists, researchers, and health insurance companies/health service institutions turned out to be fruitful in both studies. Conclusions: Despite some controversies between the partners the experiences indicate the importance of practiced-research collaborations to provide relevant information about the delivery of outpatient psychotherapy in the health system

Proof internalization in generalized Frege systems for classical logic

We present a general method for inserting proofs in Frege systems for classical logic that produces systems that can internalize their own proofs.

Censors for Boolean Description Logic

Protecting different kinds of information has become an important area of research. One aspect is to provide effective means to avoid that secrets can be deduced from the answers of legitimate queries. In the context of atomic propositional databases several methods have been developed to achieve this goal. However, in those databases it is not possible to formalize structural information. Also they are quite restrictive with respect to the specification of secrets. In this paper we extend those methods to match the much greater expressive power of Boolean description logics. In addition to the formal framework, we provide a discussion of various kinds of censors and establish different levels of security they can provide.

First steps towards probabilistic justification logic

In this article, we introduce the probabilistic justification logic PJ, a logic in which we can reason about the probability of justification statements. We present its syntax and semantics, and establish a strong completeness theorem. Moreover, we investigate the relationship between PJ and the logic of uncertain justifications.

Searching the hearts of graphene-like molecules for simplicity, sensitivity and logic

If quantum interference patterns in the hearts of polycyclic aromatic hydrocarbons (PAHs) could be isolated and manipulated, then a significant step towards realizing the potential of single-molecule electronics would be achieved. Here we demonstrate experimentally and theoretically that a simple, parameter-free, analytic theory of interference patterns evaluated at the mid-point of the HOMO-LUMO gap (referred to as M-functions) correctly predicts conductance ratios of molecules with pyrene, naphthalene, anthracene, anthanthrene or azulene hearts. M-functions provide new design strategies for identifying molecules with phase-coherent logic functions and enhancing the sensitivity of molecular-scale interferometers.

Reconsidering the logic of World Federation of Neurosurgical Societies grading in patients with severe subarachnoid hemorrhage.

OBJECT Current data show a favorable outcome in up to 50% of patients with World Federation of Neurosurgical Societies (WFNS) Grade V subarachnoid hemorrhage (SAH) and a rather poor prediction of worst cases. Thus, the usefulness of the current WFNS grading system for identifying the worst scenarios for clinical studies and for making treatment decisions is limited. One reason for this lack of differentiation is the use of "negative" or "silent" diagnostic signs as part of the WFNS Grade V definition. The authors therefore reevaluated the WFNS scale by using "positive" clinical signs and the logic of the Glasgow Coma Scale as a progressive herniation score. METHODS The authors performed a retrospective analysis of 182 patients with SAH who had poor grades on the WFNS scale. Patients were graded according to the original WFNS scale and additionally according to a modified classification, the WFNS herniation (hWFNS) scale (Grade IV, no clinical signs of herniation; Grade V, clinical signs of herniation). The prediction of poor outcome was compared between these two grading systems. RESULTS The positive predictive values of Grade V for poor outcome were 74.3% (OR 3.79, 95% CI 1.94-7.54) for WFNS Grade V and 85.7% (OR 8.27, 95% CI 3.78-19.47) for hWFNS Grade V. With respect to mortality, the positive predictive values were 68.3% (OR 3.9, 95% CI 2.01-7.69) for WFNS Grade V and 77.9% (OR 6.22, 95% CI 3.07-13.14) for hWFNS Grade V. CONCLUSIONS Limiting WFNS Grade V to the positive clinical signs of the Glasgow Coma Scale such as flexion, extension, and pupillary abnormalities instead of including "no motor response" increases the prediction of mortality and poor outcome in patients with severe SAH.

The Complexity of Non-Iterated Probabilistic Justification Logic

The logic PJ is a probabilistic logic defined by adding (noniterated) probability operators to the basic justification logic J. In this paper we establish upper and lower bounds for the complexity of the derivability problem in the logic PJ. The main result of the paper is that the complexity of the derivability problem in PJ remains the same as the complexity of the derivability problem in the underlying logic J, which is π[p/2] -complete. This implies that the probability operators do not increase the complexity of the logic, although they arguably enrich the expressiveness of the language.

Probabilistic Justification Logic

We present a probabilistic justification logic, PPJ, to study rational belief, degrees of belief and justifications. We establish soundness and completeness for PPJ and show that its satisfiability problem is decidable. In the last part we use PPJ to provide a solution to the lottery paradox.