A polynomial time complete disjunction property in intuitionistic propositional logic
classification
🧮 math.LO
cs.LO
keywords
polynomialtimecompletedisjunctionintuitionisticlogicpropertypropositional
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.