Gunther Schmidt

Im Zentrum des hypnosystemischen Ansatzes, dessen Begründer Gunther Schmidt ist, steht die Orientierung auf Kompetenzen, Ressourcen und Lösungen. Diese Methode eignet sich für nahezu jede Beratungsform, ob Therapie, Organisationsberatung oder Supervision.

hypnosystemisches Arbeiten in schwierigen Kontexten

Liebesaffären zwischen Problem und Lösung

Michael Bohne

Matthias Ohler

Trenkle Bernhard

In der täglichen Praxis beschleicht Psychotherapeuten und Berater immer wieder der Verdacht: Reden reicht nicht. Wenn dem so ist, was hilft dann weiter? In diesem Band stellen neun Autoren unterschiedliche, in der Mehrzahl bifokal-multisensorische Techniken vor. Dazu gehören eingeführte Methoden wie Eye Movement Integration (EMI) und Eye Movement Desensitization and Reprocessing (EMDR), Klopfen sowie Prozess- und Embodimentfokussierte Psychologie (PEP). Sie werden ergänzt durch hypnosystemische und verhaltenstherapeutische Ansätze sowie die Ego-State-Therapie. Das Potenzial der Ansätze wird aus verschiedenen professionellen und wissenschaftlichen Perspektiven zur Diskussion gestellt. Im Vergleich werden Gemeinsamkeiten und Unterschiede sichtbar gemacht, in deren Mittelpunkt nicht Konkurrenz, sondern gegenseitige Wertschätzung steht. Mit Beiträgen von: Michael Bohne • Martin Grunwald • Evelyn Beverly Jahn • Matthias Ohler • Eva Pollani • Gary Bruno Schmid • Gunther Schmidt • Bernhard Trenkle • Matthias Wittfoth.

Bifokal-multisensorische Interventionsstrategien für Therapie und Beratung

Reden reicht nicht!?

Ernst W. Mayr

Gottfried Tinhofer

This volume presents the proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '94), held in Herrsching, Germany in June 1994. The volume contains 32 thoroughly revised papers selected from 66 submissions and provides an up-to-date snapshot of the research performed in the field. The topics addressed are graph grammars, treewidth, special graph classes, algorithms on graphs, broadcasting and architecture, planar graphs and related problems, and special graph problems.

20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings

Graph-Theoretic Concepts in Computer Science

Michael Winter

This book introduces and develops new algebraic methods to work with relations, often conceived as Boolean matrices, and applies them to topology. Although these objects mirror the matrices that appear throughout mathematics, numerics, statistics, engineering, and elsewhere, the methods used to work with them are much less well known. In addition to their purely topological applications, the volume also details how the techniques may be successfully applied to spatial reasoning and to logics of computer science. Topologists will find several familiar concepts presented in a concise and algebraically manipulable form which is far more condensed than usual, but visualized via represented relations and thus readily graspable. This approach also offers the possibility of handling topological problems using proof assistants.

Relational Topology

Winfried Schröder

Simon Schönrock

The investigations refer to the development of plant phenology since the 1960s in Germany. Spatiotemporal trends were assessed by means of regression kriging. It could be shown that there already is a distinct shift of phenological onset towards the beginning of the year of up to two weeks. In future, a shift of up to one month was calculated till 2080. Moreover, a prolongation of the vegetation period of up to three weeks was found. The findings are relevant for the development of mitigation measures to prevent from environmental, agricultural and economic issues due to climate change.

A Modelling and Mapping Approach

Plant Phenology as a Biomonitor for Climate Change in Germany

Chris Brink

Wolfram Kahl

The calculus of relations has been an important component of the development of logic and algebra since the middle of the nineteenth century, when Augustus De Morgan observed that since a horse is an animal we should be able to infer that the head of a horse is the head of an animal. For this, Aristotelian syllogistic does not suffice: We require relational reasoning. George Boole, in his Mathematical Analysis of Logic of 1847, initiated the treatment of logic as part of mathematics, specifically as part of algebra. Quite the opposite conviction was put forward early this century by Bertrand Russell and Alfred North Whitehead in their Principia Mathematica (1910 - 1913): that mathematics was essentially grounded in logic. Logic thus developed in two streams. On the one hand algebraic logic, in which the calculus of relations played a particularly prominent part, was taken up from Boole by Charles Sanders Peirce, who wished to do for the "calculus of relatives" what Boole had done for the calculus of sets. Peirce's work was in turn taken up by Schroder in his Algebra und Logik der Relative of 1895 (the third part of a massive work on the algebra of logic). Schroder's work, however, lay dormant for more than 40 years, until revived by Alfred Tarski in his seminal paper "On the calculus of binary relations" of 1941 (actually his presidential address to the Association for Symbolic Logic).

Relational Methods in Computer Science

A modern, comprehensive 2010 overview providing an easy introduction for applied scientists who are not versed in mathematics.

Relational Mathematics

Harrie de Swart

Ewa Orlowska

Marc Roubens

This book constitutes the major results of the EU COST (European Cooperation in the field of Scientific and Technical Research) Action 274: TARSKI - Theory and Applications of Relational Structures as Knowledge Instruments - running from July 2002 to June 2005. The papers are devoted to further understanding of interdisciplinary issues involving relational reasoning by addressing relational structures and the use of relational methods in applicable object domains.

International Workshops of COST Action 274, TARSKI, 2002-2005, Selected Revised Papers

Theory and Applications of Relational Structures as Knowledge Instruments II

Thomas Ströhlein

Relational methods can be found at various places in computer science, notably in data base theory, relational semantics of concurrency, relationaltype theory, analysis of rewriting systems, and modern programming language design. In addition, they appear in algorithms analysis and in the bulk of discrete mathematics taught to computer scientists. This book is devoted to the background of these methods. It explains how to use relational and graph-theoretic methods systematically in computer science. A powerful formal framework of relational algebra is developed with respect to applications to a diverse range of problem areas. Results are first motivated by practical examples, often visualized by both Boolean 0-1-matrices and graphs, and then derived algebraically.

Gunther Schmidt

About

Books

Join the club