Computer Science – Logic in Computer Science
Scientific paper
2002-11-18
Computer Science
Logic in Computer Science
35 pages, 1 figure
Scientific paper
We present two embeddings of infinite-valued Lukasiewicz logic L 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 L. These include: hypersequent calculi for A and L and terminating versions of these calculi; labelled single sequent calculi for A and L of complexity co-NP; unlabelled single sequent calculi for A and L.
Gabbay Dov
Metcalfe George
Olivetti Nicola
No associations
LandOfFree
Sequent and Hypersequent Calculi for Abelian and Lukasiewicz Logics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Sequent and Hypersequent Calculi for Abelian and Lukasiewicz Logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sequent and Hypersequent Calculi for Abelian and Lukasiewicz Logics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-508610