Uncountable Families of Partial Clones Containing Maximal Clones

نویسندگان

  • Lucien Haddad
  • Dietlinde Lau
چکیده

Let A be a non singleton finite set. We show that every maximal clone determined by a prime affine or h-universal relation on A is contained in a family of partial clones on A of continuum cardinality. MSC 2000: 03B50, 08A40, 08A55

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Clones on Uncountable Sets That Include All Permutations

We first determine the maximal clones on a set X of infinite regular cardinality κ which contain all permutations but not all unary functions, extending a result of Heindorf’s for countably infinite X. If κ is countably infinite or weakly compact, this yields a list of all maximal clones containing the permutations since in that case the maximal clones above the unary functions are known. We th...

متن کامل

Uniqueness of minimal coverings of maximal partial clones

A partial function f on an k-element set Ek is a partial Sheffer function if every partial function on Ek is definable in terms of f . Since this holds if and only if f belongs to no maximal partial clone on Ek, a characterization of partial Sheffer functions reduces to finding families of minimal coverings of maximal partial clones on Ek. We show that for each k ≥ 2 there exists a unique minim...

متن کامل

Partial Clones Containing all Boolean Monotone Self-dual Partial Functions

The study of partial clones on 2 := {0, 1} was initiated by R. V. Freivald. In his fundamental paper published in 1966, Freivald showed, among other things, that the set of all monotone partial functions and the set of all self-dual partial functions are both maximal partial clones on 2. Several papers dealing with intersections of maximal partial clones on 2 have appeared after Freivald work. ...

متن کامل

On the interval of strong partial clones of Boolean functions containing Pol((0,0),(0,1),(1,0))

D. Lau raised the problem of determining the cardinality of the set of all partial clones of Boolean functions whose total part is a given Boolean clone. The key step in the solution of this problem, which was obtained recently by the authors, was to show that the sublattice of strong partial clones on {0, 1} that contain all total functions preserving the relation ρ0,2 = {(0, 0), (0, 1), (1, 0...

متن کامل

On the Interval of Strong Partial Clones of Boolean Functions Containing

D. Lau raised the problem of determining the cardinality of the set of all partial clones of Boolean functions whose total part is a given Boolean clone. The key step in the solution of this problem, which was obtained recently by the authors, was to show that the sublattice of strong partial clones on {0, 1} that contain all total functions preserving the relation ρ0,2 = {(0, 0), (0, 1), (1, 0...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007