Bases of Admissible Rules of Lukasiewicz Logic
Emil Jeřábek · Journal of Logic and Computation · 2010
We construct explicit bases of single-conclusion and multiple-conclusion admissible rules of propositional Łukasiewicz logic, and we prove that every formula has an admissibly saturated approximation. We also show that Łukasiewicz logic has no finite basis of admissible rules.