Abstract
In this paper, we define new decision procedures for Łukasiewicz logics. They are based on particular integer-labelled hypersequents and of logical proof rules for such hypersequents. These rules being proved strongly invertible our procedures naturally allow one to generate countermodels. From these results we define a “merge”-free calculus for the infinite version of Łukasiewicz logic and prove that it satisfies the sub-formula property. Finally we also propose for this logic a new terminating calculus by using a focusing technique.
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.: Finiteness in Infinite-Valued Lukasiewicz Logic. Journal of Logic, Language and Information 9(1), 5–29 (2000)
Avron, A.: A Tableau System for Gödel-Dummett Logic based on a Hypersequent Calculus. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol. 1847, pp. 98–111. Springer, Heidelberg (2000)
Ciabattoni, A., Fermüller, C., Metcalfe, G.: Uniform Rules and Dialogue Games for Fuzzy Logics. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 496–510. Springer, Heidelberg (2005)
Ciabattoni, A., Metcalfe, G.: Bounded Lukasiewicz Logics. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol. 2796, pp. 32–47. Springer, Heidelberg (2003)
Derschowitz, N., Manna, Z.: Proving termination with multiset ordering. Communications of ACM 22, 465–479 (1979)
Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. Journal of Symbolic Logic 57, 795–807 (1992)
Galmiche, D., Larchey-Wendling, D., Salhi, Y.: Provability and countermodels in Gödel-Dummett logics. In: Int. Workshop on Disproving: Non-theorems, Non-validity, Non-Provability, DISPROVING 2007, Bremen, Germany, July 2007, pp. 35–52 (2007)
Hájek, P.: Metamathematics of Fuzzy Logic. Kluwer Academic Publishers, Dordrecht (1998)
Larchey-Wendling, D.: Counter-model search in Gödel-Dummett logics. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 274–288. Springer, Heidelberg (2004)
Lukasiewicz, J., Tarski, A.: Untersuchungen über den Aussagenkalkül. In: Comptes Rendus des Séances de la Societé des Sciences et des Lettre de Varsovie, Classe III, vol. 23 (1930)
Metcalfe, G., Olivetti, N., Gabbay, D.: Lukasiewicz Logic: From Proof Systems To Logic Programming. Logic Journal of the IGPL 13(5), 561–585 (2005)
Metcalfe, G., Olivetti, N., Gabbay, D.: Sequent and hypersequent calculi for Abelian and Lukasiewicz logics. ACM Trans. Comput. Log. 6(3), 578–613 (2005)
Olivetti, N.: Tableaux for Lukasiewicz Infinite-valued Logic. Studia Logica 73(1), 81–111 (2003)
Prijatelj, A.: Bounded contraction and Gentzen-style formulation of Lukasiewicz logics. Studia Logica 57(2/3), 437–456 (1996)
Rothenberg, R.: An Hypersequent Calculus for Lukasiewicz Logic without the Merge Rule. In: Automated Reasoning Workshop (2006)
Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, Chichester (1987)
Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science, vol. 43. Cambridge University Press, Cambridge (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galmiche, D., Salhi, Y. (2008). Labelled Calculi for Łukasiewicz Logics. In: Hodges, W., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2008. Lecture Notes in Computer Science(), vol 5110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69937-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-69937-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69936-1
Online ISBN: 978-3-540-69937-8
eBook Packages: Computer ScienceComputer Science (R0)