A coding method for a sequent calculus of propositional logic |
| |
| Authors: | R Alonderis |
| |
| Institution: | (1) Institute of Mathematics and Informatics, Akademijos 4, LT-08663 Vilnius, Lithuania |
| |
| Abstract: | The paper deals with a coding method for a sequent calculus of the propositional logic. The method is based on the sequent
calculus. It allows us to determine if a formula is derivable in the calculus without constructing a derivation tree. The
main advantage of the coding method is its compactness in comparison with derivation trees of the sequent calculus. The coding
method can be used as a decision procedure for the propositional logic. |
| |
| Keywords: | propositional logic sequent calculus coding method |
| 本文献已被 SpringerLink 等数据库收录！ |
