scientific article; zbMATH DE number 2042617
From MaRDI portal
Publication:4450446
zbMath1046.03012MaRDI QIDQ4450446
Publication date: 15 February 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) MV-algebras (06D35) Many-valued logic (03B50) Word problems, etc. in computability and recursion theory (03D40) Complexity of proofs (03F20)
Related Items
Automated theorem proving by resolution in non-classical logics, A first polynomial non-clausal class in many-valued logic, First-order satisfiability in Gödel logics: an NP-complete fragment, Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss
