Abstract
Łukasiewicz propositional logic Ł∞ comes equipped with the same parsing algorithms of boolean propositional logic, and with its own arithmetic–geometric algorithms to recognize tautologies and to decide if a formula Φ is a consequence of Ψ. Building on this basic algorithmic structure, and pulling the threads of earlier chapters together, the present chapter describes a rich array of methods for constructing algorithms for finitely presented MV-algebras and their associated rational polyhedra.
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
References
Hermes, H. (1969). Enumerability, decidability, computability (2nd ed.). New York: Springer.
Monk, J. D. (1976). Mathematical logic. Graduate texts in mathematics (Vol. 37). New York: Springer.
Cignoli, R. L. O., D’Ottaviano, I. M. L., Mundici, D. (2000). Algebraic foundations of many-valued reasoning. Volume 7 of Trends in Logic. Dordrecht: Kluwer.
Mundici, D. (1987). Satisfiability in many-valued sentential logic is NP-complete. Theoretical Computer Science, 52,145–153.
Hardy, G. H., Wright, E. M. (1960). An introduction to the theory of Numbers (5th ed.). Oxford: Clarendon Press.
Aguzzoli, S., Marra, V. (2010). Finitely presented MV-algebras with finite automorphism group. Journal of Logic and Computation, 20(4), 811–822.
Chernavski, A. V., Leksine, V. P. (2006). Unrecognizability of manifolds. Annals of Pure and Applied Logic, 141, 325–335.
Massey, W. S. (1980). Singular homology theory. Graduate Texts in Mathematics (Vol. 70). New York: Springer.
Marra, V. Non-Boolean partitions. A mathematical investigation through lattice-ordered Abelian groups and MV algebras. Ph.D. thesis, Department of Computer Science, University of Milan, 2002–2003, pp. 87.
Chang, C. C. (1958). Algebraic analysis of many-valued logics. Transactions of the American Mathematical Society, 88, 467–490.
Mundici, D., Panti, G. (2001). Decidable and undecidable prime theories in infinite-valued logic. Annals of Pure and Applied Logic, 108, 269–278.
Mishra, B. (1993). Algorithmic Algebra, Texts and Monographs in Computer Science. New York: Springer.
Seidenberg, A. (1954). A new decision method for elementary algebra. Annals of Mathematics, 60, 365–374.
Tarski, A. (1951). A decision method for elementary algebra and geometry. Berkeley, CA: University of California Press.
Mundici, D. (2006). Bookmaking over infinite-valued events, International Journal of Approximate Reasoning, 43, 223–240.
Flaminio, T., Montagna, F. (2011). Models for many-valued probabilistic reasoning. Journal of Logic and Computation, 21(3), 447–464.
Bova, S., Flaminio, T. (2010). The coherence of Łukasiewicz assessments is NP-complete. International Journal of Approximate Reasoning, 51, 294–304.
Panti, G. (1995). La logica infinito-valente di Łukasiewicz, (Łukasiewicz infinite-valued logic). Ph.D. thesis, Department of Mathematics, University of Siena.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Mundici, D. (2011). Effective Procedures for \(\hbox{\L}_{\infty}\) and MV-Algebras. In: Advanced Łukasiewicz calculus and MV-algebras. Trends in Logic, vol 35. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-0840-2_18
Download citation
DOI: https://doi.org/10.1007/978-94-007-0840-2_18
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-0839-6
Online ISBN: 978-94-007-0840-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)