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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. N. Brodsky, Enthymeme reconstruction, Bull. Leningrad State Univ., 6, Part 1:40–44, 1988.
V.P. Moukhachjov and I.V. Netchitailov, An improvement of Brodsky’s coding method for the sequent calculus of first-order logic, in Logic Joint International Conference of Automated Reasoning, Siena, Italy, June 18–25, 2001, pp. 113–121, available from Internet: http://www.philosophy.ru/library/logic/an{_i}mprovement{_%o}f_brodsky.doc.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Alonderis, R. A coding method for a sequent calculus of propositional logic. Lith Math J 48, 123–136 (2008). https://doi.org/10.1007/s10986-008-9008-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10986-008-9008-6