Implicit expressibility in multiple-valued logic
From MaRDI portal
Recommendations
- Implicit expressibility in two-valued logic and cryptoisomorphisms of two-element algebras
- The recognition of completeness relative to implicit reducibility in the chain extensions of intuitionistic logic
- scientific article; zbMATH DE number 2047493
- On the implicit expressibility of Boolean functions
- Implicit connectives of algebraizable logics
Cites work
- Finitely Many Primitive Positive Clones
- scientific article; zbMATH DE number 3162893 (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 3819803 (Why is no real title available?)
- scientific article; zbMATH DE number 3976988 (Why is no real title available?)
- scientific article; zbMATH DE number 4027415 (Why is no real title available?)
- scientific article; zbMATH DE number 2047493 (Why is no real title available?)
- Implicit expressibility in two-valued logic and cryptoisomorphisms of two-element algebras
- Implicitly maximal classes and implicit completeness criterion in the three-valued logic
- On some implicitly precomplete classes of monotone functions in P_k
- On the implicit expressibility of Boolean functions
- Operator of positive closure
- Parametric expressibility of functions of three-valued logic
- Positively closed classes of three-valued logic
- Some implicitly precomplete classes of functions of three-valued logic preserving subsets
- Toxicology of nanoparticles
This page was built for publication: Implicit expressibility in multiple-valued logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107856)
