Abstract
The present note consists of two separate but related parts. In the first, a new graphtheoretic proof is presented that an (ℳ,R)-system must always contain a nonreestablishable component. The second considers some questions concerning the relation between re-establishability and the time-lag structure in (ℳ,R)-systems. It is supposed that the reader is familiar with the terminology of the author's previous work on (ℳ,R)-systems, particularly R. Rosen,Bull. Math. Biophysics,20, 245–260, 1958.
Similar content being viewed by others
Literature
Rosen, R. 1958. “A Relational Theory of Biological Systems.”Bull. Math. Biophysics.,20, 245–260.
Weisz, P. B. 1962. “Enzymatic Reaction Sequences and Cytological Dimensions.”Nature,195, 772–774.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rosen, R. Some comments on re-estalishability. Bulletin of Mathematical Biophysics 27 (Suppl 1), 11–14 (1965). https://doi.org/10.1007/BF02477257
Issue Date:
DOI: https://doi.org/10.1007/BF02477257