A polynomial time complete disjunction property in intuitionistic propositional logic
Logic
2013-12-12 v1 Logic in Computer Science
Abstract
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.
Cite
@article{arxiv.1312.3059,
title = {A polynomial time complete disjunction property in intuitionistic propositional logic},
author = {Toshiyasu Arai},
journal= {arXiv preprint arXiv:1312.3059},
year = {2013}
}