Sequent and hypersequent calculi for abelian and łukasiewicz logics
- 1 July 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 6 (3) , 578-613
- https://doi.org/10.1145/1071596.1071600
Abstract
We present two embeddings of Łukasiewicz logicŁinto Meyer and Slaney's Abelian logicA, the logic of lattice-ordered Abelian groups. We give new analytic proof systems forAand use the embeddings to derive corresponding systems forŁ. These include hypersequent calculi, terminating hypersequent calculi, co-NP labeled sequent calculi, and unlabeled sequent calculi.Keywords
This publication has 29 references indexed in Scilit:
- A Tableau Calculus for Hajek's Logic BLJournal of Logic and Computation, 2003
- Monoidal t-norm based logictowards a logic for left-continuous t-normsFuzzy Sets and Systems, 2001
- Basic Fuzzy Logic is the logic of continuous t-norms and their residuaSoft Computing, 2000
- A deterministic terminating sequent calculus for Godel-Dummett logicLogic Journal of the IGPL, 1999
- Resolution and model building in the infinite-valued calculus of L̵ukasiewiczTheoretical Computer Science, 1998
- A constructive analysis of RMThe Journal of Symbolic Logic, 1987
- The complexity of the word problem for abelian l-groupsTheoretical Computer Science, 1986
- Algebraic Completeness Results for Dummett's LC and Its ExtensionsMathematical Logic Quarterly, 1971
- Algebraic analysis of many valued logicsTransactions of the American Mathematical Society, 1958
- Fragments of many-valued statement calculiTransactions of the American Mathematical Society, 1958