scientific article
From MaRDI portal
Publication:3754598
zbMATH Open0618.03006MaRDI QIDQ3754598
Publication date: 1985
Title of this publication is not available (Why is that?)
Complexity of computation (including implicit computational complexity) (03D15) Many-valued logic (03B50)
Related Items (5)
Proof search and co-NP completeness for many-valued logics ⋮ Extending the reach of SAT with many-valued logics ⋮ On the expressibility hierarchy of Magidor-Malitz quantifiers ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?)
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 Q3754598)
