The complexity of admissible rules of Łukasiewicz logic

Details The complexity of admissible rules of Łukasiewicz logic The complexity of admissible rules of Łukasiewicz logic

2011-08-31

arxiv.org/abs/1108.6261v2

Computer Science

Logic in Computer Science

14 pages, 2 figures; to appear in Journal of Logic and Computation

Scientific paper

We investigate the computational complexity of admissibility of inference
rules in infinite-valued {\L}ukasiewicz propositional logic (\L). It was shown
in [13] that admissibility in {\L} is checkable in PSPACE. We establish that
this result is optimal, i.e., admissible rules of {\L} are PSPACE-complete. In
contrast, derivable rules of {\L} are known to be coNP-complete.

Affiliated with

Also associated with

No associations

Rating

The complexity of admissible rules of Łukasiewicz logic 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 The complexity of admissible rules of Łukasiewicz logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The complexity of admissible rules of Łukasiewicz logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-626133