Abstract
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the object logic received as input should be sufficiently expressive, in having the appropriate linguistic resources that allow for a bivalent representation. For each logic, the tableau system obtained as output has some attractive features: exactly two signs are used as labels in the rules, as in the case of classical logic, providing thus a uniform framework in which different logics can be represented and compared; the application of the rules is analytic, in that it always reduces complexity, providing thus an immediate proof-theoretical decision procedure together with a counter-model builder for the given logic.
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
Aguzzoli, S., Ciabattoni, A., Di Nola, A.: Sequent calculi for finite-valued Łukasiewicz logics via Boolean decompositions. Journal of Logic and Computation 10(2), 213–222 (2000)
Avron, A., Lev, I.: Non-deterministic multiple-valued structures. Journal of Logic and Computation 15, 241–261 (2005)
Surma, S.J.: An algorithm for axiomatizing every finite logic. In: Rine, D.C. (ed.) Computer Science and Multiple-Valued Logics, Selected Papers from the IV International Symposium on Multiple-Valued Logics, 2nd edn., pp. 143–149. North-Holland, Amsterdam (1974) 2nd edn. (1984)
Baaz, M., Fermüller, C.G., Salzer, G.: Automated deduction for many-valued logics. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 1355–1402. Elsevier and MIT Press (2001)
Béziau, J.-Y.: Sequents and bivaluations. Logique et Analyse (N.S.) 44(176), 373–394 (2001)
Caleiro, C., Carnielli, W., Coniglio, M.E., Marcos, J.: Two’s company: The humbug of many logical values. In: Béziau, J.-Y. (ed.) Logica Universalis, pp. 169–189. Birkhäuser Verlag, Basel (2005), http://wslc.math.ist.utl.pt/ftp/pub/CaleiroC/05-CCCM-dyadic.pdf
Caleiro, C., Carnielli, W.A., Coniglio, M.E., Marcos, J.: How many logical values are there? Dyadic semantics for many-valued logics. Draft (forthcoming) (2005)
Carnielli, W.A.: Systematization of the finite many-valued logics through the method of tableaux. The Journal of Symbolic Logic 52(2), 473–493 (1987)
Fermüller, C.G., Leitsch, A., Hustadt, U., Tammet, T.: Resolution decision procedures. In: Handbook of Automated Reasoning, pp. 1791–1849. Elsevier, Amsterdam (2001)
Hähnle, R.: Tableaux for many-valued logics. In: D’Agostino, M., Gabbay, D., Hähnle, R., Posegga, J. (eds.) Handbook of Tableau Methods, pp. 529–580. Springer, Heidelberg (1999)
Hähnle, R.: Advanced many-valued logics. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn., vol. 2, pp. 297–395. Kluwer, Dordrecht (2001)
Marcos, J.: Possible-translations semantics. In: Carnielli, W.A., Dionísio, F.M., Mateus, P. (eds.) Proceedings of the Workshop on Combination of Logics: Theory and applications (CombLog 2004), held in Lisbon, PT. 1049-001 Lisbon, PT, 2004. Departamento de Matemática, Instituto Superior Técnico. July 28–30, 2004, Lisbon, PT, July 28–30, 2004, pp. 119–128 (2004), http://wslc.math.ist.utl.pt/ftp/pub/MarcosJ/04-M-pts.pdf
Marcos, J., Mendonça, D.: Towards fully automated axiom extraction for finite-valued logics. In: Carnielli, W., Coniglio, M.E., D’Ottaviano, I.M.L. (eds.) The Many Sides of Logic, London. Studies in Logic. College Publications (2009), http://wslc.math.ist.utl.pt/ftp/pub/MarcosJ/08-MM-towards.pdf
Rosser, J.B., Turquette, A.R.: Many-Valued Logics. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam (1952)
Suszko, R.: The Fregean Axiom and Polish mathematical logic in the 1920s. Studia Logica 36, 373–380 (1977)
Wójcicki, R.: Theory of Logical Calculi. Kluwer, Dordrecht (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caleiro, C., Marcos, J. (2009). Classic-Like Analytic Tableaux for Finite-Valued Logics. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2009. Lecture Notes in Computer Science(), vol 5514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02261-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-02261-6_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02260-9
Online ISBN: 978-3-642-02261-6
eBook Packages: Computer ScienceComputer Science (R0)