Abstract
We present a tableau calculus for propositional Dummett logic, also known as LC (i>Linear Chain), where the depth of the deductions is linearly bounded by the length of the formulas to be proved. We then show that it is possible to decide propositional Dummett logic in O(i>nlog i>n)-SPACE.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
