Реверсивные конструктивные логики

##plugins.themes.bootstrap3.article.main##

N.N. Nepeivoda

Abstract

The subject of the inquiry is a new class of constructive logics: reversive ones. They are induced by class of problems where all actions are to be reversible (i. e. each sequence of actions can be undone). Those actions do not lose and do not add information. Semantic of reversive logic is based on amalgam of realizability and modified Girard’s idea. Worlds and actions in their models are elements Of the same group. It is shown that reversive logic is formalizable and stated some basic properties of reversive logic.

##plugins.generic.usageStats.downloads##

##plugins.generic.usageStats.noStats##

##plugins.themes.bootstrap3.article.details##

Section
Статьи

References

Landauer R. Irreversibility and heat generation in the computing process // IBM Journal of Research and Development. 1961. V. 5. P. 183-191.
Bennett С.H. Logical reversibility of computation // IBM Journal of Research and Development. 1973. V. 17. P. 525-532.
Toffoli T. Reversible Computing // MIT Technical Report MIT/LCS/TM-151, 1980.
Fredkin E., Toffoli T. Conservative logic // International Journal of Theoretical Physics. 1982. V. 21. P. 219-253.
Merkle R.C. Towards Practical Reversible Logic, // Workshop on Physics and Computation, PhysComp ’92, October, Dallas Texas. IEEE Press, 1992.
Непейвода _. H., Скопин И. H. Основания программирования. М.;Ижевск, 2004.