

Author: Hoffmann Ilka R
Publisher: Emerald Group Publishing Ltd
ISSN: 0368-492X
Source: Kybernetes: The International Journal of Systems & Cybernetics, Vol.34, Iss.3-4, 2005-03, pp. : 400-408
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Purpose - This paper has the purpose of discussing the phenomenon of two competing positions, which appear in philosophy and psychology in a similar way, and the emerging possibilities when both are seen as complementary. Design/methodology/approach - The approach is to first point out the difficulty, which arises when both positions perceive each other as mutually exclusive and yet claim to fully describe reality. Then Ludwig Wittgenstein's attempt to end the conflict by drawing a line between what can be expressed in language and what is inexpressible is introduced. Finally it is shown how Heinz von Foerster tried to dissolve the argument between both positions by introducing the concept of "in principle undecidable questions". From here the position of "and" is developed. The implications of this position as a possible way of ending (i.e. "and"-ing) the argument are explored and then related to psychotherapy. Findings - The findings show how the position of "and" increases possibilities in psychotherapy and poses new challenges at the same time. Originality/value - The position of "and" with its consequences is a new perspective in psychotherapy which can be useful to practitioners and researchers as well.
Related content


Tolerating Transient and Intermittent Failures
Journal of Parallel and Distributed Computing, Vol. 62, Iss. 5, 2002-05 ,pp. :


A codicity undecidable problem in the plane
Theoretical Computer Science, Vol. 303, Iss. 2, 2003-07 ,pp. :


Undecidable problems in unreliable computations
By Mayr R.
Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. :


Grid structures and undecidable constraint theories
By Seynhaeve F. Tison S. Tommasi
Theoretical Computer Science, Vol. 258, Iss. 1, 2001-05 ,pp. :


Verifying identical communicating processes is undecidable
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :