Abstrakt
There are operators in the same phase, within the framework of the enunciation or metaoperational grammar of Adamczewski (1978, 1982), which enter into competition when getting in a relationship of a minimal pair in some communicative functions. In our opinion, this represents in principle a challenge to Adamczewski's phases' theory where minimal pairs are composed of operators in opposite phases.
In this paper, we try to approach the issue, trying to resolve it with the same tools of the metaoperational theory. For this, we resort to the principle of cyclicity (Adamczewski 1995), further developed by Matte Bon (in press) with his system of the Russian dolls tree of the double coding.
We have forged in addition some theoretic tools to help us in this task.