8 citations · 8 across the 3 of their papers we have counts for
1 paper · 1 filter
Emil Jeřábek
We investigate the computational complexity of admissibility of inference rules in infinite-valued Łukasiewicz propositional logic (Ł). It was shown in [13] that admissibility in Ł…