scientific article; zbMATH DE number 3954886

MaRDI QIDQ3724312zbMATH OpenFDO

Authors Daniele Mundici

Publication date 1984

zbMATH Keywords

\(P=NP\) problemcomplexity of interpolants of tautological implications

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Interpolation, preservation, definability (03C40)

Recommendations

• Tautologies with a unique Craig interpolant, uniform vs. nonuniform complexity
• On the existence of polynomial time algorithms for interpolation problems in propositional logic
• scientific article; zbMATH DE number 3906484
• scientific article; zbMATH DE number 1390276
• The complexity of satisfiability problems

Cited in

(6)

• scientific article; zbMATH DE number 3906484 (Why is no real title available?)
• On the existence of polynomial time algorithms for interpolation problems in propositional logic
• scientific article; zbMATH DE number 1543346 (Why is no real title available?)
• Tautologies with a unique Craig interpolant, uniform vs. nonuniform complexity
• Preservation of Craig interpolation by the product of matrix logics
• Interpolants, cut elimination and flow graphs for the propositional calculus

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3724312)