On Monotonous and Strongly Monotonous Properties of Some Propositional Proof Systems for Different Logics

EasyChair Preprint 3995

Abstract

For some propositional proof systems of different logics we investigate the relations between the lines (t-complexities) and sizes (l-complexities) of proofs for minimal tautologies of this logic and for results of a substitutions in them. We introduced the notions of monotonous and strongly monotonous properties for the proof systems and investigated these properties for many well known propositional proof systems of different two-valued and many-valued logics, as well as for some new systems, constructed for mentioned logics by us.v

Keyphrases: minimal tautology, monotonous proof system, strongly monotonous proof system

@booklet{EasyChair:3995,
  author    = {Anahit Chubaryan and Sergey Sayadyan and Arsen Hambardzumyan},
  title     = {On Monotonous and Strongly Monotonous Properties of Some Propositional Proof Systems for Different Logics},
  howpublished = {EasyChair Preprint 3995},
  year      = {EasyChair, 2020}}