Implicit definability of truth constants in Łukasiewicz logic

In the framework of propositional Łukasiewicz logic, a suitable notion of implicit definability, tailored to the intended real-valued semantics and referring to the elements of its domain, is introduced. Several variants of implicitly defining each of the rational elements in the standard semantics are explored, and based on that, a faithful interpretation of theories in Rational Pavelka logic in theories in Łukasiewicz logic is obtained. Some of these results were already presented in Hájek (Metamathematics of fuzzy logic, 1998) as technical statements. A connection to the lack of (deductive) Beth property in Łukasiewicz logic is drawn. Moreover, while irrational elements of the standard semantics are not implicitly definable by finitary means, a parallel development is possible for them in infinitary Łukasiewicz logic. As an application of definability of the rationals, it is shown how computational complexity results for Rational Pavelka logic can be obtained from analogous results for Łukasiewicz logic. The complexity of the definability notion itself is studied as well. Finally, we review the import of these results for the precision/vagueness discussion for fuzzy logic, and for the general standing of truth constants in Łukasiewicz logic.

[1]  Petr Cintula,et al.  A note on axiomatizations of Pavelka-style complete fuzzy logics , 2016, Fuzzy Sets Syst..

[2]  E. Hoogland.  Definability and Interpolation: Model-theoretic investigations , 2001 .

[3]  Joan Gispert,et al.  Universal Classes of MV-chains with Applications to Many-valued Logics , 2002, Math. Log. Q..

[4]  Franco Montagna,et al.  Distinguished algebraic semantics for t-norm based fuzzy logics: Methods and algebraic equivalencies , 2009, Ann. Pure Appl. Log..

[5]  Xavier Caicedo.  Implicit Operations in MV-Algebras and the Connectives of Lukasiewicz Logic , 2006, Algebraic and Proof-theoretic Aspects of Non-classical Logics.

[6]  Franco Montagna,et al.  Interpolation and Beth's property in propositional many-valued logics: A semantic investigation , 2006, Ann. Pure Appl. Log..

[7]  Daniele Mundici,et al.  Universal Properties of Łukasiewicz Consequence , 2014, Logica Universalis.

[8]  Lluis Godo,et al.  Adding truth-constants to logics of continuous t-norms: Axiomatization and completeness results , 2007, Fuzzy Sets Syst..

[9]  Petr Hájek.  Computational complexity of t-norm based propositional fuzzy logics with rational truth constants , 2006, Fuzzy Sets Syst..

[10]  Antoni Torrens Torrell.  Cyclic Elements in MV-Algebras and Post Algebras , 1994, Math. Log. Q..

[11]  Petr Savický,et al.  Term satisfiability in FLew-algebras , 2016, Theor. Comput. Sci..

[12]  Joan Gispert.  Universal Classes of MV-Chains with Applications to Many-valued Logics , 2002 .

[13]  Robert McNaughton,et al.  A Theorem About Infinite-Valued Sentential Logic , 1951, J. Symb. Log..

[14]  Kerstin Vogler,et al.  Algebraic Foundations Of Many Valued Reasoning , 2016 .

[15]  J. A. Goguen,et al.  The logic of inexact concepts , 1969, Synthese.

[16]  Petr Hájek,et al.  Rational Pavelka predicate logic is a conservative extension of Łukasiewicz predicate logic , 2000, Journal of Symbolic Logic.

[17]  Jan Pavelka,et al.  On Fuzzy Logic III. Semantical completeness of some many-valued propositional calculi , 1979, Math. Log. Q..

[18]  Xavier Caicedo.  Implicit connectives of algebraizable logics , 2004, Stud Logica.

[19]  Libor Behounek.  In Which Sense Is Fuzzy Logic a Logic for Vagueness? , 2014, PRUV.

[20]  V. Marra.  The Problem of Artificial Precision in Theories of Vagueness: A Note on the Rôle of Maximal Consistency , 2013, 1306.4369.