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)} is of continuum cardinality. In this paper we represent relations derived from ρ0,2 in terms of graphs, and we define a suitable closure operator on graphs such that the lattice of closed sets of graphs is isomorphic to the dual of this uncountable sublattice of strong partial clones. With the help of this duality, we provide a rough description of the structure of this lattice, and we also obtain a new proof for its uncountability.
منابع مشابه
ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کامل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...
متن کاملShape - Preserving Multivariate Polynomial Approximation in C [ − 1 , 1 ]
where C > 0 is independent of f , n1, and n2, satisfying, moreover, the following shapepreserving properties: (i) if f is convex of order (0,0), then so is Pn1,n1(f ); (ii) if f is simultaneously convex of orders (−1,0), (0,−1), and (0,0) (i.e., totally upper monotone), then so is Pn1,n2(f ); (iii) if f is convex of order (1,1), then so is Pn1,n2(f ); (iv) if f is simultaneously convex of order...
متن کاملShape-preserving multivariate polynomial approximation in C[-1, 1]m
where C > 0 is independent of f , n1, and n2, satisfying, moreover, the following shapepreserving properties: (i) if f is convex of order (0,0), then so is Pn1,n1(f ); (ii) if f is simultaneously convex of orders (−1,0), (0,−1), and (0,0) (i.e., totally upper monotone), then so is Pn1,n2(f ); (iii) if f is convex of order (1,1), then so is Pn1,n2(f ); (iv) if f is simultaneously convex of order...
متن کاملWhen to say “Don’t Know”: Confidence in Automatically Generated Hypotheses without the Assumption of an Underlying Distribution
We have a set S ⊂ {0,1}n, together with, for each x ∈ S, the result of some unknown function F : {0,1}n → {0,1} applied to x, and a method for generating a hypothesis h ∈ H about F given S. We present theoretical and experimental results on four possible methods (similarity, convexification, prevalence and Hamming distance) for determing, given two elements y,z ∈ {0,1}n\S, whether we should be ...
متن کامل