Abstract
In this paper we deepen Mundici's analysis on reducibility of the decision problem from infinite-valued Łukasiewicz logic \( \mathcal{L} \) ∞ to a suitable m-valued Łukasiewicz logic\( \mathcal{L} \) m , where m only depends on the length of the formulas to be proved. Using geometrical arguments we find a better upper bound for the least integer m such that a formula is valid in \( \mathcal{L} \) ∞ if and only if it is also valid in \( \mathcal{L} \) m. We also reduce the notion of logical consequence in \( \mathcal{L} \) ∞ to the same notion in a suitable finite set of finite-valued Łukasiewicz logics. Finally, we define an analytic and internal sequent calculus for infinite-valued Łukasiewicz logic.
Similar content being viewed by others
References
Aguzzoli, S., 1998a, “A note on the representation of McNaughton lines by basic literals,” Soft Computing (Special Issue on Multiple-Valued Logic) 2, 111-115.
Aguzzoli, S., 1998b, “Geometric and proof-theoretic issues in Łukasiewicz propositional logics,” Ph.D. Dissertation, University of Siena.
Aguzzoli, S., Ciabattoni, A., and Di Nola, A., 1999, “Sequent calculi for finite-valued Łukasiewicz logics via Boolean decompositions,” Journal of Logic and Computation, to appear.
Baaz, M., Fermüller, C.G., and Zach, R., 1994, “Elimination of cuts in first-order finite-valued logics,” Journal of Information Processing and Cybernetics 6, 333-355.
Carnielli, W.A., 1987, “Systematization of finite many-valued logics through the method of tableaux,” Journal of Symbolic Logic 52(2), 473-493.
Ciabattoni, A. and Luchi, D., 1997, “Two connections between linear logic and Łukasiewicz logics,” pp. 128-139 in Proceedings of Computational Logic and Proof Theory, (KGC'97), G. Gottlob, A. Leitsch and D. Mundici, eds., Lecture Notes in Computer Science, Vol. 1289, Berlin: Springer-Verlag.
Cignoli, R., D'Ottaviano, I.M., and Mundici, D., 1999, Algebraic Foundations of Many-Valued Reasoning, in preparation.
Ewald, G., 1996, Combinatorial Convexity and Algebraic Geometry, Graduate Texts inMathematics, Vol. 168, Berlin: Springer-Verlag.
Gil, A.J., Torrens, A., and VerdÚ, V., 1997, “On Gentzen systems associated with the finite linear MV-algebras,” Journal of Logic and Computation 7(4), 473-500.
Grigolia, R., 1977, “Algebraic analysis of Łukasiewicz-Tarski n-valued logical systems,” pp. 81-91 in Selected Papers on Łukasiewicz Sentential Calculi, R. Wójcicki and G. Malinowski, eds., Wrocław: Polish Academy of Sciences, Ossolineum.
Hähnle, R., 1993, Automated Deduction inMultiple-Valued Logics, Oxford: Oxford University Press.
Hähnle, R., 1994, “Many-valued logic and mixed integer programming,” Annals of Mathematics and Artificial Intelligence 12, 231-264.
Hájek, P., 1998, Metamathematics of Fuzzy Logic, Dordrecht: Kluwer Academic Publishers.
Łukasiewicz, J., 1920, “O logice trówartosciowej,” Ruch Filozoficzny 5, 170-171. English Translation: 1970, “On three-valued logic,” pp. 87-88 in J. Łukasiewicz Selected Works, L. Borkowski, ed., Amsterdam: North-Holland.
McNaughton, R., 1951, “A theorem about infinite-valued sentential logic,” Journal of Symbolic Logic 16, 1-13.
Mundici, D., 1987, “Satisfiability in many-valued sentential logic is NP-complete,” Theoretical Computer Science 52, 145-153.
Mundici, D. and Olivetti, N., 1998, “Resolution and model building in the infinite-valued calculus of Łukasiewicz,” Theoretical Computer Science 200, 335-366.
Prijatelj, A., 1996, “Bounded contraction and Gentzen style formulation of Łukasiewicz logics,” Studia Logica 57, 437-456.
Rousseau, G., 1967, “Sequents in many valued logic I,” Fundamenta Mathematicae 60, 23-33.
Takahashi, M., 1967, “Many-valued logics of extended Gentzen style I,” Science Reports of the Tokyo Kyoiku Daigaku, Section A 9, 95-116.
Takahashi, M., 1970, “Many-valued logics of extended Gentzen style II,” Journal of Symbolic Logic 35(4), 493-528.
Wagner, H., 1999, “A new resolution calculus for the infinite-valued propositional logic of Łukasiewicz,” Journal of Applied Non-Classical Logics, to appear.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Aguzzoli, S., Ciabattoni, A. Finiteness in Infinite-Valued Łukasiewicz Logic. Journal of Logic, Language and Information 9, 5–29 (2000). https://doi.org/10.1023/A:1008311022292
Issue Date:
DOI: https://doi.org/10.1023/A:1008311022292