Brodsky’s coding method for propositional logic
Articles
Romas Alonderis
Vilnius University
Published 2017-12-15
https://doi.org/10.15388/LMR.A.2017.01
PDF

Keywords

propositional logic
sequent calculus
Brodsky’s coding method

How to Cite

Alonderis R. (2017) “Brodsky’s coding method for propositional logic”, Lietuvos matematikos rinkinys, 58(A), pp. 1–6. doi: 10.15388/LMR.A.2017.01.

Abstract

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.

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy