Brodsky’s coding method for propositional logic

Romas Alonderis

doi:10.15388/LMR.A.2017.01

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

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

Please read the Copyright Notice in Journal Policy.

Downloads

Article Views | PDF Downloads

Range Graph | Chart Graph

Most read articles by the same author(s)

Romas Alonderis, A labeled sequent calculus for propositional linear time logic , Lietuvos matematikos rinkinys: Vol 53 (2012): Ser. A
Romas Alonderis, Regimantas Pliuškevičius, Sequent systems for PLTL , Lietuvos matematikos rinkinys: Vol 54 (2013): Ser. A
Romas Alonderis, Regimantas Pliuškevičius, Aida Pliuškevičienė, Finite sequent calculi for PLTL , Lietuvos matematikos rinkinys: Vol 56 (2015): Ser. A
Romas Alonderis, Haroldas Giedra, A derivation-loop method for temporal logic , Lietuvos matematikos rinkinys: Vol 60 (2019): Ser. A
Haroldas Giedra, Romas Alonderis, Applications of logic of correlated knowledge to quantum mechanics , Lietuvos matematikos rinkinys: Vol 59 (2018): Ser. A
Romas Alonderis, A sequent calculus for propositional temporal logic with time gaps , Lietuvos matematikos rinkinys: Vol 52 (2011)
Romas Alonderis, Regimantas Pliuškevičius, Cut, invariant rule, and loop-check free sequent calculus for PLTL , Lietuvos matematikos rinkinys: Vol 52 (2011)