A polynomial time complete disjunction property in intuitionistic propositional logic

Toshiyasu Arai

We extend the polynomial time algorithms due to Buss and Mints(APAL 1999) and Ferrari, Fiorentini and Fiorino(LPAR 2002) to yield a polynomial time complete disjunction property in intuitionistic propositional logic.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment