Theory of linear and integer programming
Theory of linear and integer programming
Satisfiability in many-valued sentential logic is NP-complete
Theoretical Computer Science
The complexity of the word problem for abelian l-groups
Theoretical Computer Science
Automated deduction in multiple-valued logics
Automated deduction in multiple-valued logics
The method of hypersequents in the proof theory of propositional non-classical logics
Logic: from foundations to applications
Resolution and model building in the infinite-valued calculus of Łukasiewicz
Theoretical Computer Science
Finiteness in Infinite-Valued Σukasiewicz Logic
Journal of Logic, Language and Information
Analytic Sequent Calculi for Abelian and ukasiewicz Logics
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Analytic calculi for monoidal t-norm based logic
Fundamenta Informaticae
Proof Theory for First Order Łukasiewicz Logic
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Labelled Calculi for Łukasiewicz Logics
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Implicit operations in MV-algebras and the connectives of Łukasiewicz logic
Algebraic and proof-theoretic aspects of non-classical logics
Expanding the realm of systematic proof theory
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Dual tableau for monoidal triangular norm logic MTL
Fuzzy Sets and Systems
Combining supervaluation and degree based reasoning under vagueness
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
We present two embeddings of Łukasiewicz logic Ł into Meyer and Slaney's Abelian logic A, the logic of lattice-ordered Abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding systems for Ł. These include hypersequent calculi, terminating hypersequent calculi, co-NP labeled sequent calculi, and unlabeled sequent calculi.