Positive Fragment of MTL with One Variable and Its Computational Complexity

Authors: Rostislav Horčík
Publication year: 2009
Publication type: Abstrakt
Periodical: Topology, Algebra and Categories in Logic
Projects: Complexity of t-norm based logics - algebraic and proof-theoretical approach
Bibliographic citation: HORČÍK, Rostislav. Positive Fragment of MTL with One Variable and Its Computational Complexity. In: Topology, Algebra and Categories in Logic. Amsterdam: University of Amsterdam, 2009.
ID: 327989

Abstract

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 for its 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.