Post classes characterized by functional terms

DOI10.1016/j.dam.2003.01.002zbMath1051.06011OpenAlexW1975829295MaRDI QIDQ1878400

Grant R. Pogosyan, Stephan Foldes

Publication date: 19 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.01.002

zbMATH Keywords

Boolean functionsclosed classesminimal rankPost classesfunctional terms

Mathematics Subject Classification ID

Boolean functions (06E30)

Related Items (9)

Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\) ⋮ Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes ⋮ Composition of Post classes and normal forms of Boolean functions ⋮ Join-irreducible Boolean functions ⋮ On a quasi-ordering on Boolean functions ⋮ On the efficiency of normal form systems for representing Boolean functions ⋮ Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms ⋮ A complete classification of equational classes of threshold functions included in clones ⋮ Hypomorphic Sperner systems and non-reconstructible functions

Cites Work

• Unnamed Item
• Unnamed Item
• Galois theory for minors of finite functions
• On generalized constraints and certificates
• Equational classes of Boolean functions via the HSP theorem
• Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\)
• Equational characterizations of Boolean function classes
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

This page was built for publication: Post classes characterized by functional terms