| Title |
Brodsky’s coding method for propositional logic / |
| Authors |
Alonderis, Romas |
| DOI |
10.15388/LMR.A.2017.01 |
| Full Text |
|
| Is Part of |
Lietuvos matematikos rinkinys.. Vilnius : Matematikos ir informatikos institutas. 2017, T. 58, p. 1-6.. ISSN 0132-2818. eISSN 2335-898X |
| Keywords [eng] |
propositional logic ; sequent calculi ; Brodsky’s coding method |
| Abstract [eng] |
Brodsky’s coding method for propositional logic is considered in the paper. Based on the sequent calculus, the method allows us to determine whether an arbitrary sequent is derivable in the calculus without constructing proof-search trees. The coding method, presented in the paper, can be used as a decision procedure for propositional logic. |
| Published |
Vilnius : Matematikos ir informatikos institutas |
| Type |
Journal article |
| Language |
English |
| Publication date |
2017 |
| CC license |
|
