A-closed classes of idempotent functions of many-valued logic definable by binary relations
نویسندگان
چکیده
منابع مشابه
Some Closed Classes of Three-Valued Logic Generated by Periodic Symmetric Functions
Closed classes of three-valued logic generated by periodic symmetric funtions that equal 1 in tuples from {1, 2} and equal 0 on the rest tuples are considered. Criteria for bases existence and finite bases existence for these classes is obtained. The problem of the bases existence for some families of closed classes of the three-valued logic functions is considered in the paper. E. Post [1] (se...
متن کاملInteger-valued definable functions
We present a dichotomy, in terms of growth at infinity, of analytic functions definable in the real exponential field which take integer values at natural number inputs. Using a result concerning the density of rational points on curves definable in this structure, we show that if a function f : [0,∞) → R is such that f(N) ⊆ Z, then either sup|x̄|≤r f(x̄) grows faster than exp(r), for some δ > 0,...
متن کاملClassification of Closed Sets of Functions in Multi-valued Logic
Using Mal’cev’s preiterative algebra (iterative algebra is not sound) we construct in the first time the natural classification of closed sets of functions in multi-valued logic: every closed set belongs only one class and the classes are disjoint. All contemporary papers construct only intersecting classes. We confirm Post’s thesis that multi-valued logic does not contain anything special in c...
متن کاملFinite Closed Sets of Functions in Multi-valued Logic
The article is devoted to classification of close sets of functions in k-valued logic. We build the classification of finite closed sets. The sets contain only constants and unary functions since sets containing even a two-ary function are infinite. Formulas of the number of finite sets and minimal sets exist for all natural k. We find the numbers of closed sets containing the identity function...
متن کاملModified Reconstructability Analysis for Many-valued Functions and Relations
A novel many-valued decomposition within the framework of lossless Reconstructability Analysis is presented. In previous work, Modified Recontructability Analysis (MRA) was applied to Boolean functions, where it was shown that most Boolean functions not decomposable using conventional Reconstructability Analysis (CRA) are decomposable using MRA. Also, it was previously shown that whenever decom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00370-x