Bases of Admissible Rules of Lukasiewicz Logic

We construct explicit bases of single-conclusion and multiple-conclusion admissible rules of propositional Lukasiewicz logic, and we prove that every formula has an admissibly saturated approximation. We also show that Lukasiewicz logic has no finite basis of admissible rules.

• Type: Journal
• Year: 2010
• Where: LOGCOM
• Authors: Emil Jerábek
• Keywords: Admissible Rules, LOGCOM 2010, Lukasiewicz Logic, Propositional Lukasiewicz Logic