Positive Fragment of MTL with One Variable and Its Computational Complexity
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F09%3A00327989" target="_blank" >RIV/67985807:_____/09:00327989 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Positive Fragment of MTL with One Variable and Its Computational Complexity
Original language description
This abstract focuses on the computational complexity of Monoidal t-norm Based Logic, namely on its positive fragment. Since we are able to prove that this fragment is complete w.r.t. the class of 1-generated algebras, we obtain several consequences forits computational complexity. In particular, we show that up to some extent the computational complexity remains the same if we restrict the number of variables in our language to a single variable. These results were presented at the conference Topology, Algebra and Categories in Logic organized by University of Amsterdam in 2009.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/KJB100300701" target="_blank" >KJB100300701: Complexity of t-norm based logics - algebraic and proof-theoretical approach</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů