• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Combining of Circuits (2002)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [mizar.org]
  • [www.umic.ueda.nagano.jp]
  • [mizar.uw.bialystok.pl]
  • [mizar.uw.bialystok.pl]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Yatsuka Nakamura , Grzegorz Bancerek
Citations:89 - 23 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Nakamura02combiningof,
    author = {Yatsuka Nakamura and Grzegorz Bancerek},
    title = {Combining of Circuits},
    year = {2002}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

this paper. 1. COMBINING OF MANY SORTED SIGNATURES Let S be a many sorted signature. A gate of S is an element of the operation symbols of S

Citations

1274 Tarski Grothendieck set theory - Trybulec - 1989
1237 Functions and their basic properties - Byliński - 1989
1164 Properties of subsets - Trybulec - 1989
991 Functions from a set to a set - Byliński - 1989
971 Relations and their basic properties - Woronowicz - 1989
709 Some basic properties of sets - Byliński - 1989
633 The fundamental properties of natural numbers - Bancerek - 1989
616 Cardinal numbers - Bancerek - 1989
537 Basic properties of real numbers - Hryniewiecki - 1990
413 Partial functions - Byliński - 1990
370 Subsets of real numbers - Trybulec
301 Finite sets - Darmochwał - 1989
281 Finite sequences and tuples of elements of a non-empty sets - Byliński - 1990
266 Tuples, projections and Cartesian products - Trybulec - 1990
259 Pigeon hole principle - Trybulec - 1990
246 Binary operations applied to functions - Trybulec - 1990
242 The modification of a function by a function and the iteration of the composition of a function - Byliński - 1990
224 König’s theorem - Bancerek - 1990
208 Finite sets - Darmochwa̷l - 1990
193 Many-sorted sets - Trybulec - 1993
153 A classical first order language - Byli'nski - 1990
123 Many sorted algebras - Trybulec - 1996
117 Product of family of universal algebras - Madras - 1993
63 Cartesian product of functions - Bancerek - 1991
63 Semilattice operations on finite subsets - Trybulec - 1990
62 Many-argument relations - Woronowicz - 1990
62 Curried and uncurried functions - Bancerek - 1990
57 Products of many sorted algebras - Madras - 1994
54 Joining of decorated trees - Bancerek - 1993
38 Introduction to trees - Bancerek - 1990
29 Ma̷lgorzata Korolkiewicz. Basic notation of universal algebra - Kotowicz, Madras - 1992
27 Sets and functions of trees and joining operations of trees - Bancerek - 1992
26 Tarski’s classes and ranks - Bancerek - 1990
3 Introduction to circuits - Nakamura, Rudnicki, et al. - 1996
1 Konig's lemma - Bancerek - 1991
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University