Implicitly maximal classes and implicit completeness criterion in the three-valued logic
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5827847 (Why is no real title available?)
- scientific article; zbMATH DE number 3150816 (Why is no real title available?)
- scientific article; zbMATH DE number 5373715 (Why is no real title available?)
- scientific article; zbMATH DE number 5531164 (Why is no real title available?)
- scientific article; zbMATH DE number 3499613 (Why is no real title available?)
- scientific article; zbMATH DE number 2047493 (Why is no real title available?)
- scientific article; zbMATH DE number 3227055 (Why is no real title available?)
- Implicit expressibility in two-valued logic and cryptoisomorphisms of two-element algebras
- On a metric characteristic of implicit and parametric representations of Boolean functions
- On the implicit expressibility of Boolean functions
Cited in
(9)- On the classes of autodual functions implicitly maximal in \(P_k \)
- Implicit expressibility in multiple-valued logic
- Completeness criterion for the enumeration closure operator in three-valued logic
- On some implicitly precomplete classes of monotone functions in P_k
- Some implicitly precomplete classes of functions of three-valued logic preserving subsets
- scientific article; zbMATH DE number 2209457 (Why is no real title available?)
- scientific article; zbMATH DE number 7644095 (Why is no real title available?)
- On implicit extensions in many-valued logic
- Chair of Discrete Mathematics
This page was built for publication: Implicitly maximal classes and implicit completeness criterion in the three-valued logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1795427)
