A deceptive fact about functions

• Autorzy: Wiesław Dziobiak , Andrzej Ehrenfeucht , Jacqueline B. Grace , Donald Silberger
• Języki publikacji: EN

Abstrakty

EN

The paper provides a proof of a combinatorial result which pertains to the characterization of the set of equations which are solvable in the composition monoid of all partial functions on an infinite set.

Kategorie tematyczne

• 08A50: Word problems
• 03E05: Other combinatorial set theory
• 05C20: Directed graphs (digraphs), tournaments
• 03E20: Other classical set theory (including functions, relations, and set algebra)

• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Fundamenta Mathematicae
• Rocznik: 2000
• Tom: 163
• Numer: 1
• Strony: 83-93

Daty

wydano

2000

otrzymano

1999-08-02

Twórcy

autor

Wiesław Dziobiak

• Department of Mathematics, University of Puerto Rico, Mayagüez, PR 00681, U.S.A.

autor

Andrzej Ehrenfeucht

• Department of Mathematics, University of Colorado, Boulder, CO 80309, U.S.A.

autor

Jacqueline B. Grace

• Department of Mathematics, State University of New York New, Paltz, NY 12561, U.S.A.

autor

Donald Silberger

Bibliografia

• [1] K. Rother, D. M. Silberger and M. E. Wilson, The reverse spelling of an FPrt-universal word in two letters, Algebra Universalis 36 (1996), 202-221.
• [2] D. M. Silberger, Universal words of complexity three, ibid. 11 (1980), 393-395.