scientific article; zbMATH DE number 2042617
From MaRDI portal
Publication:4450446
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Many-valued logic (03B50) Complexity of computation (including implicit computational complexity) (03D15) Word problems, etc. in computability and recursion theory (03D40) Complexity of proofs (03F20) MV-algebras (06D35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Recommendations
- Sequent calculi for finite-valued Lukasiewicz logics via Boolean decompositions
- Natural dualities for varieties of MV-algebras. I
- scientific article; zbMATH DE number 1420881
- Algebraic foundations of many-valued reasoning
- MODIFICATIONS OF MV-ALGEBRAS CORRESPONDING TO STRONG ORTHOLATTICES
- scientific article; zbMATH DE number 1076962
- scientific article; zbMATH DE number 201040
- scientific article; zbMATH DE number 2148624
- scientific article; zbMATH DE number 1209602
- scientific article; zbMATH DE number 1749199
Cited in
(10)- On the complexity of entailment in propositional multivalued logics
- Proof search and co-NP completeness for many-valued logics
- Automated theorem proving by resolution in non-classical logics
- scientific article; zbMATH DE number 1269582 (Why is no real title available?)
- Generalisation of proof simulation procedures for Frege systems by M. L. Bonet and S. R. Buss
- ON LOWER BOUNDS FOR COMPLEXITY OVER INFINITE BASISES FOR FUNCTIONS OF MULTI-VALUED LOGIC
- Natural dualities for varieties of MV-algebras. I
- A first polynomial non-clausal class in many-valued logic
- First-order satisfiability in Gödel logics: an NP-complete fragment
- Complexity issues in Basic Logic
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 Q4450446)