Implicitly maximal classes and implicit completeness criterion in the three-valued logic

DOI10.3103/S0027132218020067zbMath1397.03028OpenAlexW2800407027MaRDI QIDQ1795427

M. V. Starostin

Publication date: 16 October 2018

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132218020067

Mathematics Subject Classification ID

Boolean functions (06E30) Many-valued logic (03B50)

Related Items (4)

On some implicitly precomplete classes of monotone functions in \(P_k\) ⋮ Some implicitly precomplete classes of functions of three-valued logic preserving subsets ⋮ On the classes of autodual functions implicitly maximal in \(P_k \) ⋮ Implicit expressibility in multiple-valued logic

Cites Work

• On the implicit expressibility of Boolean functions
• Implicit expressibility in two-valued logic and cryptoisomorphisms of two-element algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Implicitly maximal classes and implicit completeness criterion in the three-valued logic