Have a personal or library account? Click to login
Stability of n-Bit Generalized Full Adder Circuits (GFAs). Part II Cover

Stability of n-Bit Generalized Full Adder Circuits (GFAs). Part II

Formalized Mathematics
Volume 16 (2008): Issue 1 (March 2008)
By: Katsumi Wasaki  
Open Access
|Mar 2009

References

  1. [1] Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.
    Search in Google Scholar
  2. [2] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.
    Search in Google Scholar
  3. [3] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.
    Search in Google Scholar
  4. [4] Grzegorz Bancerek and Yatsuka Nakamura. Full adder circuit. Part I. Formalized Mathematics, 5(3):367-380, 1996.
    Search in Google Scholar
  5. [5] Grzegorz Bancerek, Shin'nosuke Yamaguchi, and Katsumi Wasaki. Full adder circuit. Part II. Formalized Mathematics, 10(1):65-71, 2002.
    Search in Google Scholar
  6. [6] Czesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.
    Search in Google Scholar
  7. [7] Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.
    Search in Google Scholar
  8. [8] Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.
    Search in Google Scholar
  9. [9] Yatsuka Nakamura and Grzegorz Bancerek. Combining of circuits. Formalized Mathematics, 5(2):283-295, 1996.
    Search in Google Scholar
  10. [10] Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Introduction to circuits, I. Formalized Mathematics, 5(2):227-232, 1996.
    Search in Google Scholar
  11. [11] Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Preliminaries to circuits, II. Formalized Mathematics, 5(2):215-220, 1996.
    Search in Google Scholar
  12. [12] Andrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97-105, 1990.
    Search in Google Scholar
  13. [13] Andrzej Trybulec. Many-sorted sets. Formalized Mathematics, 4(1):15-22, 1993.
    Search in Google Scholar
  14. [14] Andrzej Trybulec. Many sorted algebras. Formalized Mathematics, 5(1):37-42, 1996.
    Search in Google Scholar
  15. [15] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.
    Search in Google Scholar
  16. [16] Edmund Woronowicz. Many-argument relations. Formalized Mathematics, 1(4):733-737, 1990.
    Search in Google Scholar
  17. [17] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.
    Search in Google Scholar
  18. [18] Shin'nosuke Yamaguchi, Katsumi Wasaki, and Nobuhiro Shimoi. Generalized full adder circuits (GFAs). Part I. Formalized Mathematics, 13(4):549-571, 2005.
    Search in Google Scholar
DOI: https://doi.org/10.2478/v10037-008-0011-5 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 73 - 80
Published on: Mar 20, 2009
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Related subjects:
Mathematics,
General mathematics,
Computer sciences,
Computer sciences, other

© 2009 Katsumi Wasaki, published by University of Białystok
This work is licensed under the Creative Commons License.

Volume 16 (2008): Issue 1 (March 2008)