Implicit Definability of Truth Constants in Łukasiewicz Logic
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F19%3A00503661" target="_blank" >RIV/67985807:_____/19:00503661 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00500-018-3461-x" target="_blank" >http://dx.doi.org/10.1007/s00500-018-3461-x</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00500-018-3461-x" target="_blank" >10.1007/s00500-018-3461-x</a>
Alternative languages
Result language
angličtina
Original language name
Implicit Definability of Truth Constants in Łukasiewicz Logic
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Soft Computing
ISSN
1432-7643
e-ISSN
—
Volume of the periodical
23
Issue of the periodical within the volume
7
Country of publishing house
DE - GERMANY
Number of pages
9
Pages from-to
2279-2287
UT code for WoS article
000461580400013
EID of the result in the Scopus database
2-s2.0-85053265965