Implicit definability of truth constants in Łukasiewicz logic
From MaRDI portal
Publication:2317518
Abstract: In the framework of propositional {L}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 {L}ukasiewicz logic is obtained. Some of these results were already presented in H'ajek's "Metamathematics of Fuzzy Logic" as technical statements. A connection to the lack of (deductive) Beth property in {L}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 the infinitary {L}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 {L}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 {L}ukasiewicz logic.
Recommendations
- Complexity and Definability Issues in LFormula
- Computational complexity of infinite-valued Łukasiewicz propositional logic
- Implicit Operations in MV-Algebras and the Connectives of Łukasiewicz Logic
- Rational Pavelka predicate logic is a conservative extension of Łukasiewicz predicate logic
- Modal definability based on Łukasiewicz validity relations
Cites work
- A note on axiomatizations of Pavelka-style complete fuzzy logics
- A theorem about infinite-valued sentential logic
- Adding truth-constants to logics of continuous t-norms: axiomatization and completeness results
- Advanced Łukasiewicz calculus and MV-algebras
- Computational complexity of t-norm based propositional fuzzy logics with rational truth constants
- Cyclic Elements in MV‐Algebras and Post Algebras
- Distinguished algebraic semantics for t-norm based fuzzy logics: methods and algebraic equivalencies
- scientific article; zbMATH DE number 1850735 (Why is no real title available?)
- scientific article; zbMATH DE number 247100 (Why is no real title available?)
- scientific article; zbMATH DE number 6276271 (Why is no real title available?)
- scientific article; zbMATH DE number 6276275 (Why is no real title available?)
- Implicit connectives of algebraizable logics
- Implicit Operations in MV-Algebras and the Connectives of Łukasiewicz Logic
- Interpolation and Beth's property in propositional many-valued logics: a semantic investigation
- Metamathematics of fuzzy logic
- On Fuzzy Logic I Many‐valued rules of inference
- Rational Pavelka predicate logic is a conservative extension of Łukasiewicz predicate logic
- Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras
- The logic of inexact concepts
- The problem of artificial precision in theories of vagueness: a note on the rôle of maximal consistency
- Universal properties of Łukasiewicz consequence
Cited in
(6)- Structural completeness in many-valued logics with rational constants
- On the complexity of validity degrees in Łukasiewicz logic
- scientific article; zbMATH DE number 2015288 (Why is no real title available?)
- Which truth values in fuzzy logics are definable?
- Complexity and Definability Issues in LFormula
- Rational Pavelka logic: the best among three worlds?
This page was built for publication: Implicit definability of truth constants in Łukasiewicz logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2317518)
