On Sizes of Linear and Tree-Like Proofs for any Formulae Families in Some Systems of Propositional Calculus
The sizes of linear and tree-like proofs for any formulae families are investigated in some systems of propositional calculus: in different sequent systems (with quantifier rules, with the substitution rule, with the cut rule, without the cut rule, monotone) and in the generalization splitting syste...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Gitutyun
2022-06-01
|
| Series: | Mathematical Problems of Computer Science |
| Subjects: | |
| Online Access: | http://mpcs.sci.am/index.php/mpcs/article/view/734 |