Download PDFOpen PDF in browserOn Three Types of Universal Propositional Proof Systems for All Versions of Many-Valued Logics and Some Its PropertiesEasyChair Preprint 39943 pages•Date: August 2, 2020AbstractOur research refers to the problem of constructing the universal proof systems for all versions of propositional many-valued logics (MVLs) such that any propositional proof system for every variant of MVL can be presented in described form. We presented three types of such universal systems, and investigated some properties of them. Our research refers to the problem of constructing the universal proof systems for all versions of propositional many-valued logics (MVLs) such that any propositional proof system for every variant of MVL can be presented in described form. We presented three types of such universal systems, and investigated some properties of them. Keyphrases: Elimination system, many-valued logic, sequent system, splitting method, universal proof system
|