Journal of Formalized Mathematics
Volume 9, 1997
University of Bialystok
Copyright (c) 1997 Association of Mizar Users

While Macro Instructions of \SCMFSA


Jing-Chao Chen
Shanghai Jiaotong University, Shanghai
Part of the work was done while the author was visiting the Institute of Mathematics at the University of Bia{\l}ystok.

Summary.

The article defines {\em while macro instructions} based on \SCMFSA. Some theorems about the generalized halting problems of {\em while macro instructions} are proved.

MML Identifier: SCMFSA_9

The terminology and notation used in this paper have been introduced in the following articles [15] [21] [16] [6] [22] [9] [10] [11] [5] [7] [12] [17] [8] [14] [20] [18] [19] [13] [4] [3] [1] [2]

Contents (PDF format)

Acknowledgments

The author wishes to thank Prof. Andrzej Trybulec and Dr. Grzegorz Bancerek for their helpful comments and encouragement during his stay in Bia{\l}ystok.

Bibliography

[1] Noriko Asamoto. Conditional branch macro instructions of \SCMFSA. Part I. Journal of Formalized Mathematics, 8, 1996.
[2] Noriko Asamoto. Conditional branch macro instructions of \SCMFSA. Part II. Journal of Formalized Mathematics, 8, 1996.
[3] Noriko Asamoto. Constant assignment macro instructions of \SCMFSA. Part II. Journal of Formalized Mathematics, 8, 1996.
[4] Noriko Asamoto, Yatsuka Nakamura, Piotr Rudnicki, and Andrzej Trybulec. On the composition of macro instructions. Part II. Journal of Formalized Mathematics, 8, 1996.
[5] Grzegorz Bancerek. Cardinal numbers. Journal of Formalized Mathematics, 1, 1989.
[6] Grzegorz Bancerek. The fundamental properties of natural numbers. Journal of Formalized Mathematics, 1, 1989.
[7] Grzegorz Bancerek. K\"onig's theorem. Journal of Formalized Mathematics, 2, 1990.
[8] Grzegorz Bancerek and Piotr Rudnicki. Development of terminology for \bf scm. Journal of Formalized Mathematics, 5, 1993.
[9] Czeslaw Bylinski. Functions and their basic properties. Journal of Formalized Mathematics, 1, 1989.
[10] Czeslaw Bylinski. Functions from a set to a set. Journal of Formalized Mathematics, 1, 1989.
[11] Czeslaw Bylinski. The modification of a function by a function and the iteration of the composition of a function. Journal of Formalized Mathematics, 2, 1990.
[12] Yatsuka Nakamura and Andrzej Trybulec. A mathematical model of CPU. Journal of Formalized Mathematics, 4, 1992.
[13] Piotr Rudnicki and Andrzej Trybulec. Memory handling for \SCMFSA. Journal of Formalized Mathematics, 8, 1996.
[14] Yasushi Tanaka. On the decomposition of the states of SCM. Journal of Formalized Mathematics, 5, 1993.
[15] Andrzej Trybulec. Tarski Grothendieck set theory. Journal of Formalized Mathematics, Axiomatics, 1989.
[16] Andrzej Trybulec. Subsets of real numbers. Journal of Formalized Mathematics, Addenda, 2003.
[17] Andrzej Trybulec and Yatsuka Nakamura. Some remarks on the simple concrete model of computer. Journal of Formalized Mathematics, 5, 1993.
[18] Andrzej Trybulec and Yatsuka Nakamura. Modifying addresses of instructions of \SCMFSA. Journal of Formalized Mathematics, 8, 1996.
[19] Andrzej Trybulec, Yatsuka Nakamura, and Noriko Asamoto. On the compositions of macro instructions. Part I. Journal of Formalized Mathematics, 8, 1996.
[20] Andrzej Trybulec, Yatsuka Nakamura, and Piotr Rudnicki. The \SCMFSA computer. Journal of Formalized Mathematics, 8, 1996.
[21] Zinaida Trybulec. Properties of subsets. Journal of Formalized Mathematics, 1, 1989.
[22] Edmund Woronowicz. Relations and their basic properties. Journal of Formalized Mathematics, 1, 1989.

Received December 10, 1997


[ Download a postscript version, MML identifier index, Mizar home page]