An application of the (p,q)-logic to the synthesis of the p-valued logical networks and the s-(p,q)-logical completeness
From MaRDI portal
Publication:1818784
DOI10.1016/S0020-0255(98)10075-0zbMATH Open0937.94016MaRDI QIDQ1818784FDOQ1818784
Authors: Takahiro Haga 
Publication date: 7 June 2000
Published in: Information Sciences (Search for Journal in Brave)
Recommendations
- The p-valued-input, q-valued-output threshold logic and its application to the synthesis of p-valued logical networks
- scientific article; zbMATH DE number 3893096
- scientific article; zbMATH DE number 3269892
- scientific article; zbMATH DE number 3405844
- scientific article; zbMATH DE number 4070866
- Quantitative research of generalized tautologies in \(n\)-valued propositional logic \(L^*_n\)
- Harmonious many-valued propositional logics and the logic of computer networks
- A new version of the proof of completeness criterion for k-valued logic functions
- scientific article; zbMATH DE number 4089530
- scientific article; zbMATH DE number 59352
Cites Work
Cited In (5)
- (p,q)-logical completeness for output-coherent sets of (p,q)-logical functions and an application of the set to image processing
- Title not available (Why is that?)
- Title not available (Why is that?)
- The p-valued-input, q-valued-output threshold logic and its application to the synthesis of p-valued logical networks
- The p-valued-input, q-valued-output threshold logic and the (p,q)- polypheck-like function
This page was built for publication: An application of the \((p,q)\)-logic to the synthesis of the \(p\)-valued logical networks and the \(s\)-\((p,q)\)-logical completeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818784)
