Abstract
In this work we investigate bounded Lukasiewicz logics}, characterised as the intersection of the k-valued Lukasiewicz logics for k = 2, ..., n (n ≥ 2). These logics formalise a generalisation of Ulam’s game with applications in Information Theory. Here we provide an analytic proof calculus GŁ B n for each bounded Lukasiewicz logic, obtained by adding a single rule to GŁ, a hypersequent calculus for Lukasiewicz infinite-valued logic. We give a first cut-elimination proof for GL with (suitable forms of) cut rules. We then prove completeness for GŁ B n with cut and show that cut can also be eliminated in this case.
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.: A constructive analysis of RM. J. of Symbolic Logic 52, 939–951 (1987)
Chang, C.C.: Algebraic analysis of many valued logics. Trans. Amer. Math. Soc. 88, 467–490 (1958)
Ciabattoni, A.: Bounded contraction in systems with linearity. In: Murray, N.V. (ed.) TABLEAUX 1999. LNCS (LNAI), vol. 1617, pp. 113–127. Springer, Heidelberg (1999)
Cicalese, F.: Reliable Computation with Unreliable Information. PhD thesis, University of Salerno (2001), http://dia.unisa.it/cicalese.dir/thesis.html
Cignoli, R.L.O., Mundici, D., D’Ottaviano, I.M.L.: Algebraic Foundations of Many-valued Reasoning. Kluwer, Dordrecht (2000)
Grigolia, R.: Algebraic analysis of Łukasiewicz-Tarski n-valued logical systems. In: Wójciki, R., Malinowski, G. (eds.) Selected Papers on Łukasiewicz Sentential Calculi, pp. 81–91. Polish Acad. of Sciences, Warsaw (1977)
Hájek, P.: Metamathematics of Fuzzy Logic. Kluwer, Dordrecht (1998)
Łukasiewicz, J.: O logice trójwartościowej. Ruch Filozoficzny 5, 169–171 (1920)
McNaughton, R.: A theorem about infinite-valued sentential logic. Journal of Symbolic Logic 16(1), 1–13 (1951)
Metcalfe, G., Olivetti, N., Gabbay, D.: Analytic sequent calculi for abelian and Łukasiewicz logics. In: Egly, U., Fermüller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol. 2381, pp. 191–205. Springer, Heidelberg (2002)
Metcalfe, G., Olivetti, N., Gabbay, D.: Sequent and hypersequent calculi for Abelian and Łukasiewicz logics (2003) (submitted), http://arXiv.org/list/cs/0211
Mundici, D.: The logic of Ulam’s game with lies. In: Bicchieri, C., Dalla Chiara, M.L. (eds.) Knowledge, belief and strategic interaction, pp. 275–284. Cambridge University Press, Cambridge (1992)
Mundici, D.: Ulam’s game, Łukasiewicz logic and C ∗ -algebras. Fundamenta Informaticae 18, 151–161 (1993)
Pelc, A.: Searching with known error probability. Theoretical Computer Science 63, 185–202 (1989)
Prijatelj, A.: Bounded contraction and Gentzen style formulation of Łukasiewicz logics. Studia Logica 57, 437–456 (1996)
Zadeh, L.A.: Fuzzy sets. Information and Control 8, 338–353 (1965)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ciabattoni, A., Metcalfe, G. (2003). Bounded Łukasiewicz Logics. In: Cialdea Mayer, M., Pirri, F. (eds) Automated Reasoning with Analytic Tableaux and Related Methods . TABLEAUX 2003. Lecture Notes in Computer Science(), vol 2796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45206-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-45206-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40787-4
Online ISBN: 978-3-540-45206-5
eBook Packages: Springer Book Archive