Equational characterizations of Boolean function classes
نویسندگان
چکیده
منابع مشابه
FUZZY EQUATIONAL CLASSES ARE FUZZY VARIETIES
In the framework of fuzzy algebras with fuzzy equalities and acomplete lattice as a structure of membership values, we investigate fuzzyequational classes. They consist of special fuzzy algebras fullling the samefuzzy identities, dened with respect to fuzzy equalities. We introduce basicnotions and the corresponding operators of universal algebra: construction offuzzy subalgebras, homomorphisms...
متن کاملDecidable Equational Classes
I will discuss the progress that has been made on solving two open problems dealing with the decidability of the first order theory of equationally defined classes of algebras (varieties).
متن کاملOn the Lattice of Equational Classes of Boolean Functions and Its Closed Intervals
Let A be a finite set with |A| ≥ 2. The composition of two classes I and J of operations on A, is defined as the set of all composites f(g1, . . . , gn) with f ∈ I and g1, . . . , gn ∈ J . This binary operation gives a monoid structure to the set EA of all equational classes of operations on A. The set EA of equational classes of operations on A also constitutes a complete distributive lattice ...
متن کاملGame characterizations of function classes and Weihrauch degrees
Games are an important tool in mathematics and logic, providing a clear and intuitive understanding of the notions they define or characterize. In particular, since the seminal work of Wadge in the 1970s, game characterizations of classes of functions in Baire space have been a rich area of research, having had significant and far-reaching development by van Wesep, Andretta, Duparc, Motto Ros, ...
متن کاملModel-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth
In this paper we give a characterization of both Boolean and arithmetic circuit classes of logarithmic depth in the vein of descriptive complexity theory, i.e., the Boolean classes NC1, SAC1 and AC1 as well as their arithmetic counterparts #NC1, #SAC1 and #AC1. We build on Immerman’s characterization of constant-depth polynomial-size circuits by formulae of first-order logic, i.e., AC0 = FO, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00132-6