Journal of Formalized Mathematics
Volume 7, 1995
University of Bialystok
Copyright (c) 1995 Association of Mizar Users

Combining of Circuits


Yatsuka Nakamura
Shinshu University, Nagano
Grzegorz Bancerek
Institute of Mathematics, Polish Academy of Sciences

Summary.

We continue the formalisation of circuits started in [11],[12],[10], [13]. Our goal was to work out the notation of combining circuits which could be employed to prove the properties of real circuits.

This work was written while the second author visited Shinshu University, July--August 1994.

MML Identifier: CIRCCOMB

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

Contents (PDF format)

  1. Combining of Many Sorted Signatures
  2. Combining of Circuits
  3. Signatures with One Operation
  4. Unsplit Condition
  5. One Gate Circuits
  6. Boolean Circuits

Bibliography

[1] Grzegorz Bancerek. K\"onig's theorem. Journal of Formalized Mathematics, 2, 1990.
[2] Grzegorz Bancerek. Tarski's classes and ranks. Journal of Formalized Mathematics, 2, 1990.
[3] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Journal of Formalized Mathematics, 1, 1989.
[4] Czeslaw Bylinski. Functions and their basic properties. Journal of Formalized Mathematics, 1, 1989.
[5] Czeslaw Bylinski. Functions from a set to a set. Journal of Formalized Mathematics, 1, 1989.
[6] Czeslaw Bylinski. Partial functions. Journal of Formalized Mathematics, 1, 1989.
[7] Czeslaw Bylinski. Finite sequences and tuples of elements of a non-empty sets. Journal of Formalized Mathematics, 2, 1990.
[8] 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.
[9] Agata Darmochwal. Finite sets. Journal of Formalized Mathematics, 1, 1989.
[10] Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Introduction to circuits, I. Journal of Formalized Mathematics, 6, 1994.
[11] Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Preliminaries to circuits, I. Journal of Formalized Mathematics, 6, 1994.
[12] Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Preliminaries to circuits, II. Journal of Formalized Mathematics, 6, 1994.
[13] Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Introduction to circuits, II. Journal of Formalized Mathematics, 7, 1995.
[14] Andrzej Trybulec. Binary operations applied to functions. Journal of Formalized Mathematics, 1, 1989.
[15] Andrzej Trybulec. Tarski Grothendieck set theory. Journal of Formalized Mathematics, Axiomatics, 1989.
[16] Andrzej Trybulec. Tuples, projections and Cartesian products. Journal of Formalized Mathematics, 1, 1989.
[17] Andrzej Trybulec. Many-sorted sets. Journal of Formalized Mathematics, 5, 1993.
[18] Andrzej Trybulec. Many sorted algebras. Journal of Formalized Mathematics, 6, 1994.
[19] Andrzej Trybulec. Subsets of real numbers. Journal of Formalized Mathematics, Addenda, 2003.
[20] Wojciech A. Trybulec. Groups. Journal of Formalized Mathematics, 2, 1990.
[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.
[23] Edmund Woronowicz. Many-argument relations. Journal of Formalized Mathematics, 2, 1990.

Received May 11, 1995

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