Theory of linear and integer programming
Theory of linear and integer programming
Basic proof theory
Proving termination with multiset orderings
Communications of the ACM
Finiteness in Infinite-Valued Σukasiewicz Logic
Journal of Logic, Language and Information
A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Sequent and hypersequent calculi for abelian and łukasiewicz logics
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
In this paper, we define new decision procedures forŁukasiewicz logics. They are based on particularinteger-labelled hypersequents and of logical proof rules for suchhypersequents. These rules being proved strongly invertible ourprocedures naturally allow one to generate countermodels. Fromthese results we define a "merge"-free calculus for the infiniteversion of Łukasiewicz logic and prove that it satisfies thesub-formula property. Finally we also propose for this logic a newterminating calculus by using a focusing technique.