Skip to main content
Have a personal or library account? Click to login
Stability of the 4-2 Binary Addition Circuit Cells. Part I Cover

Stability of the 4-2 Binary Addition Circuit Cells. Part I

Formalized Mathematics
Volume 16 (2008): Issue 4 (December 2008)
By:   
Open Access
|Mar 2009
References

References

  1. [1] Grzegorz Bancerek. König's theorem., 1(3):589-593, 1990.
    Search in Google Scholar
  2. [2] Grzegorz Bancerek and Yatsuka Nakamura. Full adder circuit. Part I., 5(3):367-380, 1996.
    Search in Google Scholar
  3. [3] Czesław Byliński. Functions and their basic properties., 1(1):55-65, 1990.
    Search in Google Scholar
  4. [4] Yatsuka Nakamura and Grzegorz Bancerek. Combining of circuits., 5(2):283-295, 1996.
    Search in Google Scholar
  5. [5] Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Introduction to circuits, II., 5(2):273-278, 1996.
    Search in Google Scholar
  6. [6] Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Preliminaries to circuits, II., 5(2):215-220, 1996.
    Search in Google Scholar
  7. [7] Takaya Nishiyama and Yasuho Mizuhara. Binary arithmetics., 4(1):83-86, 1993.
    Search in Google Scholar
  8. [8] Andrzej Trybulec. Enumerated sets., 1(1):25-34, 1990.
    Search in Google Scholar
  9. [9] Andrzej Trybulec. Many sorted algebras., 5(1):37-42, 1996.
    Search in Google Scholar
  10. [10] Zinaida Trybulec. Properties of subsets., 1(1):67-71, 1990.
    Search in Google Scholar
  11. [11] E. Jean Vuillemin. A very fast multiplication algorithm for VLSI implementation, integration., 1(1):39-52, 1983.
    Open DOISearch in Google Scholar
  12. [12] Katsumi Wasaki and Pauline N. Kawamoto. 2's complement circuit., 6(2):189-197, 1997.
    Search in Google Scholar
  13. [13] Edmund Woronowicz. Many-argument relations., 1(4):733-737, 1990.
    Search in Google Scholar
  14. [14] Edmund Woronowicz. Relations and their basic properties., 1(1):73-83, 1990.
    Search in Google Scholar
  15. [15] Shin'nosuke Yamaguchi, Katsumi Wasaki, and Nobuhiro Shimoi. Generalized full adder circuits (GFAs). Part I., 13(4):549-571, 2005.
    Search in Google Scholar
DOI: https://doi.org/10.2478/v10037-008-0046-7 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 377 - 387
Published on: Mar 20, 2009
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Related subjects:
Computer sciences,
Artificial intelligence,
Computer sciences, other,
Mathematics,
Logic and set theory,
General mathematics

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

Volume 16 (2008): Issue 4 (December 2008)
Previous article
Next article