Skip to content

Ullin T. Place (1924-2000)

Related Publications

Barnes-Holmes, D., Hayes, S. C., Dymond, S. & O’Hora, D. (2001). Multiple stimulus relations and the transformations of stimulus functions. In S. C. Hayes, D. Barnes-Holmes, & B. Roche (Eds.), Relational frame theory: A post-Skinnerian account of human language and cognition (Chapter 3, pp. 51-71). Kluwer Academic/Plenum Publishers.
[Abstract]The key concept in Relational Frame Theory is the concept of stimulus relation (Hayes, 1991, 1994; Barnes and Holmes, 1991; Hayes and Hayes, 1989, 1992; Hayes and Wilson, 1996). Understanding the implications of an RFT approach requires clarity about this concept and its flexibility. In this chapter we will attempt to characterize multiple stimulus relations and to distinguish this approach from a traditional class based approach. We will point to ways in which increasingly elaborate relational networks are acquired, modified, and brought under various forms of contextual control. Finally we will describe in some detail the kinds of data that are generated in RFT research, and show how methodological advances are beginning to permit more complex questions to be asked and answered.
[Citing Place (1998b)]  
Citing Place (1998b) in context (citations start with an asterisk *):
Section 3.1. THE IMPORTANCE OF THE CONCEPT OF STIMULUS RELATION
Subsection 3.1.2. Complete and Coherent Networks
* The concept of relational network provides a way to approach the organization of larger language units in everyday terms, such as sentences, paragraphs, chapters, stories, trilogies, and so on. Relational networks can be more or less complete. By “complete” we mean the degree to which the events in the network, and the network itself, serve as a context for relational activity. At the lowest level, a network is complete if there are Crel terms that set the occasion for relational activity necessary to specify a relation between the events in the network. This corresponds closely to the common sense notion of a sentence, and thus one could say that the lowest level of a complete relational network in RFT is a sentence (a similar view can be found in Place, 1998).