Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes (Q2387440): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5341810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post's closed systems and the weak chromatic number of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: From logical gates synthesis to chromatic bicritical clutters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post classes characterized by functional terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive representations of Boolean functions and the finite generation of the Post classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic logic. Transl. from the Russian by Robert H. Silverman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On congruences in closed Post classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3474689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5735230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of finite bases in closed classes of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4948330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2755142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post's functional completeness theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3834101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815241 / rank
 
Normal rank

Revision as of 15:00, 10 June 2024

scientific article
Language Label Description Also known as
English
Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
scientific article

    Statements

    Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes (English)
    0 references
    2 September 2005
    0 references
    The Post classes are characterized in terms of forbidden subfunctions and, based on these results, a short proof of Post's theorem (a class of Boolean functions is closed iff it is a Post class) is given.
    0 references
    hereditary classes of Boolean functions
    0 references
    closed classes
    0 references
    Post theorem
    0 references

    Identifiers