Journal of Formalized Mathematics
Volume 8, 1996
University of Bialystok
Copyright (c) 1996 Association of Mizar Users

The \SCMFSA Computer


Andrzej Trybulec
Warsaw University, Bialystok
Yatsuka Nakamura
Shinshu University, Nagano
Piotr Rudnicki
University of Alberta, Edmonton

MML Identifier: SCMFSA_2

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

Contents (PDF format)

  1. Preliminaries
  2. The ${\bf SCM}_{\rm FSA}$ Computer
  3. The Memory Structure
  4. The Instruction Structure
  5. Relationship to {\bf SCM}
  6. Users Guide
  7. Halt Instruction

Bibliography

[1] Grzegorz Bancerek. The ordinal numbers. Journal of Formalized Mathematics, 1, 1989.
[2] Grzegorz Bancerek. Sequences of ordinal numbers. Journal of Formalized Mathematics, 1, 1989.
[3] Grzegorz Bancerek. K\"onig's theorem. Journal of Formalized Mathematics, 2, 1990.
[4] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Journal of Formalized Mathematics, 1, 1989.
[5] Grzegorz Bancerek and Andrzej Trybulec. Miscellaneous facts about functions. Journal of Formalized Mathematics, 8, 1996.
[6] Czeslaw Bylinski. Functions and their basic properties. Journal of Formalized Mathematics, 1, 1989.
[7] Czeslaw Bylinski. Functions from a set to a set. Journal of Formalized Mathematics, 1, 1989.
[8] Czeslaw Bylinski. A classical first order language. Journal of Formalized Mathematics, 2, 1990.
[9] Czeslaw Bylinski. Finite sequences and tuples of elements of a non-empty sets. Journal of Formalized Mathematics, 2, 1990.
[10] 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.
[11] Agata Darmochwal. Finite sets. Journal of Formalized Mathematics, 1, 1989.
[12] Yatsuka Nakamura and Andrzej Trybulec. A mathematical model of CPU. Journal of Formalized Mathematics, 4, 1992.
[13] Yatsuka Nakamura and Andrzej Trybulec. On a mathematical model of programs. Journal of Formalized Mathematics, 4, 1992.
[14] Jan Popiolek. Some properties of functions modul and signum. Journal of Formalized Mathematics, 1, 1989.
[15] Dariusz Surowik. Cyclic groups and some of their properties --- part I. Journal of Formalized Mathematics, 3, 1991.
[16] Yasushi Tanaka. On the decomposition of the states of SCM. Journal of Formalized Mathematics, 5, 1993.
[17] Andrzej Trybulec. Binary operations applied to functions. Journal of Formalized Mathematics, 1, 1989.
[18] Andrzej Trybulec. Tarski Grothendieck set theory. Journal of Formalized Mathematics, Axiomatics, 1989.
[19] Andrzej Trybulec. Tuples, projections and Cartesian products. Journal of Formalized Mathematics, 1, 1989.
[20] Andrzej Trybulec. Subsets of real numbers. Journal of Formalized Mathematics, Addenda, 2003.
[21] Andrzej Trybulec and Yatsuka Nakamura. Some remarks on the simple concrete model of computer. Journal of Formalized Mathematics, 5, 1993.
[22] Andrzej Trybulec, Yatsuka Nakamura, and Piotr Rudnicki. An extension of \bf scm. Journal of Formalized Mathematics, 8, 1996.
[23] Michal J. Trybulec. Integers. Journal of Formalized Mathematics, 2, 1990.
[24] Wojciech A. Trybulec. Pigeon hole principle. Journal of Formalized Mathematics, 2, 1990.
[25] Zinaida Trybulec. Properties of subsets. Journal of Formalized Mathematics, 1, 1989.
[26] Edmund Woronowicz. Relations and their basic properties. Journal of Formalized Mathematics, 1, 1989.

Received February 7, 1996

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