|
This article is cited in 4 scientific papers (total in 4 papers)
Theoretical Foundations of Computer Science
On equivalence of two PFP-operator semantics
V. S. Sekorin Tver State University, Tver
Abstract:
We consider two different semantics of partial fixed point (PFP) operator. We establish that they are equivalent for structures those contain more than one element. For this purpose we show how to translate each type of PFP-operator to other one.
Keywords:
partial fixed point, infinite structure, semantic.
Received: 15.08.2020 Revised: 05.09.2020
Citation:
V. S. Sekorin, “On equivalence of two PFP-operator semantics”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2020, no. 3, 41–49
Linking options:
https://www.mathnet.ru/eng/vtpmk598 https://www.mathnet.ru/eng/vtpmk/y2020/i3/p41
|
Statistics & downloads: |
Abstract page: | 149 | Full-text PDF : | 99 | References: | 27 |
|