On Three Types of Universal Propositional Proof Systems for All Versions of Many-Valued Logics and Some Its Properties

EasyChair Preprint 3994

3 pages•Date: August 2, 2020

Anahit Chubaryan, Hakob Nalbandyan and Artur Khamisyan

Abstract

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. 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

Links:

https://easychair.org/publications/preprint/BM8Z

BibTeX entry

BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:

@booklet{EasyChair:3994,
  author    = {Anahit Chubaryan and Hakob Nalbandyan and Artur Khamisyan},
  title     = {On Three Types of Universal Propositional Proof Systems for All Versions of Many-Valued Logics and Some Its Properties},
  howpublished = {EasyChair Preprint 3994},
  year      = {EasyChair, 2020}}

Download PDF Open PDF in browser