𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Binary Relations Over the Category of Enumerated Sets

✍ Scribed by A. Orlicki

Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
747 KB
Volume
34
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Covariant Hom-Functors on the Category o
Covariant Hom-Functors on the Category of Enumerated Sets
✍ Andrzej Orlicki πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 918 KB

Let NSET be the category of enumerated sets. I n the ER&OV book [l] a lot has been said about the following problems related to this category. Let S, , S, be two enumerated sets. What assumptions about these sets should we accept in order to find "good" (i.e. principal computable) enumeration of the

Computable limits and colimits in catego
Computable limits and colimits in categories of partial enumerated sets
✍ Andrzej Orlicki πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 931 KB

## Abstract Computable limits and colimits are β€œrecursive counterparts” of the suitable classical concepts from category theory. We present mainly some interesting problems related to computable products. Moreover, some β€œcomputable counterparts” of well‐known classical facts from category theory ar

Enumeration of Special Sets of Polynomia
Enumeration of Special Sets of Polynomials over Finite Fields
✍ Astrid Reifegerste πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 379 KB

In this paper we consider squarefree polynomials over finite fields whose gcd with their reciprocal and Frobenius conjugate polynomial is trivial, respectively. Our focus is on the enumeration of these special sets of polynomials, in particular, we give the number of squarefree palindromes. These in