Abstract
We provide general conditions on hypersequent calculi that guarantee standard completeness for the formalized logics. These conditions are implemented in the PROLOG system AxiomCalc that takes as input any suitable axiomatic extension of Monoidal T-norm Logic MTL and outputs a hypersequent calculus for the logic and the result of the check. Our approach subsumes many existing results and allows for the computerized discovery of new fuzzy logics.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics. In: Hodges, W., et al. (eds.) Logic: From Foundations to Applications. Proc. Logic Colloquium, Keele, UK, pp. 1–32 (1993, 1996)
Baaz, M., Zach, R.: Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 187–201. Springer, Heidelberg (2000)
Ciabattoni, A., Galatos, N., Terui, K.: MacNeille Completions of FL-algebras. Algebra Universalis 66(4), 405–420 (2011)
Ciabattoni, A., Galatos, N., Terui, K.: From axioms to analytic rules in nonclassical logics. In: Proceedings of LICS 2008, pp. 229–240 (2008)
Ciabattoni, A., Esteva, F., Godo, L.: T-norm based logics with n-contraction. Neural Network World 12(5), 441–453 (2002)
Ciabattoni, A., Metcalfe, G.: Density elimination. Theor. Comput. Sci. 403(2-3), 328–346 (2008)
Esteva, F., Gispert, J., Godo, L., Montagna, F.: On the Standard and Rational Completeness of some Axiomatic Extensions of the Monoidal T-norm Logic. Studia Logica 71(2), 199–226 (2002)
Esteva, F., Godo, L.: Monoidal t-norm based logic: towards a logic for left-continuous t-norms. Fuzzy Sets and Systems 124, 271–288 (2001)
Galatos, N., Jipsen, P., Kowalski, T., Ono, H.: Residuated Lattices: an algebraic glimpse at substructural logics. Studies in Logics and the Foundations of Mathematics. Elsevier (2007)
Jenei, S., Montagna, F.: A proof of standard completeness for Esteva and Godo’s MTL logic. Studia Logica 70(2), 183–192 (2002)
Hájek, P.: Metamathematics of Fuzzy Logic. Kluwer (1998)
Horcik, R.: Alternative Proof of Standard Completeness Theorem for MTL. Soft Computing 11(2) (2006)
Metcalfe, G., Montagna, F.: Substructural fuzzy logics. Journal of Symbolic Logic 7(3), 834–864 (2007)
Metcalfe, G., Olivetti, N., Gabbay, D.: Proof Theory for Fuzzy Logics. Springer Series in Applied Logic, vol. 36 (2008)
Montagna, F., Ono, H.: Kripke semantics, undecidability and standard completeness for Esteva and Godo’s logic MTL∀. Studia Logica 71(2), 227–245 (2002)
Ono, H., Komori, K.: Logics without the contraction rule. Journal of Symbolic Logic 50, 169–201 (1985)
Takeuti, G., Titani, T.: Intuitionistic fuzzy logic and intuitionistic fuzzy set theory. Journal of Symbolic Logic 49(3), 851–866 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baldi, P., Ciabattoni, A., Spendier, L. (2012). Standard Completeness for Extensions of MTL: An Automated Approach. In: Ong, L., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2012. Lecture Notes in Computer Science, vol 7456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32621-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-32621-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32620-2
Online ISBN: 978-3-642-32621-9
eBook Packages: Computer ScienceComputer Science (R0)