Abstract
A general procedure is presented for producing classic-like cut-based tableau systems for finite-valued logics. In such systems, cut is the only branching rule, and formulas are accompanied by signs acting as syntactic proxies for the two classical truth-values. The systems produced are guaranteed to be sound, complete and analytic, and they are also seen to polynomially simulate the truth-table method, thus extending the results in [7]. Łukasiewicz’s 3-valued logic is used throughout as a simple illustrative example.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avron, A., Lev, I.: Non-deterministic multiple-valued structures. Journ. of Logic and Computation 15, 241–261 (2005)
Boolos, G.: Don’t eliminate cut. Journ. of Phil. Logic 13, 373–378 (1984)
Caleiro, C., Carnielli, W., Coniglio, M.E., Marcos, J.: Two’s company: The humbug of many logical values. In: Béziau, J.-Y. (ed.) Log. Universalis, pp. 169–189. Birkhäuser Verlag, Basel (2005)
Caleiro, C., Marcos, J.: Classic-Like Analytic Tableaux for Finite-Valued Logics. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds.) WoLLIC 2009. LNCS, vol. 5514, pp. 268–280. Springer, Heidelberg (2009)
Caleiro, C., Marcos, J.: Many-valuedness meets bivalence: Using logical values in an effective way. J. of Multiple-Valued Log. and Soft Comp. 18 (2012)
D’Agostino, M.: Investigations into the complexity of some propositional calculi. PRG Techn. Monogr. 88. Oxford Univ., Computing Lab, Oxford (1990)
D’Agostino, M.: Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence. Journ. of Log., Lang., and Inform. 1, 235–252 (1992)
D’Agostino, M.: Tableau methods for classical propositional logic. In: Handbook of Tableau Methods, pp. 45–123. Kluwer Academic Publishers (1999)
D’Agostino, M., Mondadori, M.: The taming of the cut: Classical refutations with analytic cut. Journ. of Log. and Comp. 4(3), 285–319 (1994)
Finger, M., Gabbay, D.: Cut and pay. Journ. of Logic, Language and Information 15, 195–218 (2006)
Hähnle, R.: Automated Deduction in Multiple-Valued Logics. International Series of Monographs on Computer Science, vol. 10. Oxford University Press (1994)
Marcos, J., Mendonça, D.: Towards fully automated axiom extraction for finite-valued logics. In: Carnielli, W., et al. (eds.) The Many Sides of Logic, pp. 425–440. College Publications, London (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Volpe, M., Marcos, J., Caleiro, C. (2012). Classic-Like Cut-Based Tableau Systems for Finite-Valued Logics. In: Ong, L., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2012. Lecture Notes in Computer Science, vol 7456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32621-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-32621-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32620-2
Online ISBN: 978-3-642-32621-9
eBook Packages: Computer ScienceComputer Science (R0)