Investigation of P-Sheffer stroke on a partly ordered set
摘要
Sheffer stroke which was proposed by Sheffer can be utilized as a single logical connective to constitute the classical logic system. However, the problems of data classification and decision-making often are described by natural language rather than crisp numbers in artificial intelligence (AI). The requirement of dealing with the word in AI inspires people to study the Sheffer stroke operation on a partly ordered set. Therefore, this paper mainly discusses the Sheffer stroke in a partly ordered set (for short, P-Sheffer stroke) and expresses other logical connectives with the P-Sheffer stroke which is similar to the Sheffer stroke in classical logic. Practically speaking, a P-Sheffer stroke defined on a partly ordered set is firstly axiomatized. And then four L-fuzzy negations, a t-norm and a t-conorm defined on a partly ordered set are respectively generated by the P-Sheffer stroke. Further, four fuzzy implications defined on a lattice are constructed with the P-Sheffer stroke. Finally, we study two properties of fuzzy reasoning involved in the P-Sheffer stroke. Moreover, the application of P-Sheffer stroke is shown by two examples in real-life problem.