The predicate method to construct the Post lattice

DOI10.1515/DMA.2011.022zbMATH Open1238.03049OpenAlexW1998557580MaRDI QIDQ2889730FDOQ2889730

Authors: D. N. Zhuk 

Publication date: 8 June 2012

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2011.022

Recommendations

• scientific article; zbMATH DE number 4075052
• On some closed classes in partial two-valued logic
• scientific article; zbMATH DE number 3875238
• On the structure of the lattice of classes of partial monotone many-valued logic functions
• Comparison of intervals of closed classes in a functional system of \(k\)-valued logic

Mathematics Subject Classification ID

Classical first-order logic (03B10) Logical aspects of lattices and related structures (03G10)

Cited In (4)

• Cardinality of generating sets for operations from the Post lattice classes
• On irreduceability of Boolean functions with respect to commutative associative operation
• Continuality of classes of functions in multivalued logic with minimal logarithmic growth rate
• Key (critical) relations preserved by a weak near-unanimity function

This page was built for publication: The predicate method to construct the Post lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889730)