ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Aequationes mathematicae 17 (1978), S. 164-181 
    ISSN: 1420-8903
    Keywords: Primary 08A25 ; Secondary 02C05
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let A be a finite set,n 〉 1 andD $$ \subseteq $$ A n . We say thatf:D → A is a partial Sheffer function of size |D| if eachf*: A n → A agreeing withf onD is Sheffer (or complete that is 〈A; f〉 primal), i.e. iff* generates allg:A m → A (m = 1, 2, ⋯) via repeated composition. The least size of a partial Sheffer function is shown to be |A| + 2 and all partial Sheffer functions of this size are exhibited. This shows how surprisingly little information onf is needed to ensure thatf is Sheffer and, at the same time, gives a description of large classes of Sheffer functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 52 (1998), S. 49-61 
    ISSN: 1572-9036
    Keywords: delayed operators ; functional completeness ; maximal incomplete classes ; uniform completeness ; uniform composition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We survey algebraic results on combinatorial circuits constructed from many-valued uniformly delayed gates. These involve the composition of uniformly delayed operations, the lattice of uniform clones, the corresponding relational theory, uniform completeness and the search for an effective completeness criterion.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...