Lewis dichotomies in many-valued logics

DOI10.1007/s11225-012-9450-7zbMath1271.03036OpenAlexW2091594026MaRDI QIDQ1935553

Simone Bova

Publication date: 18 February 2013

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-012-9450-7

zbMATH Keywords

many-valued logicscomplexity dichotomyparameterized satisfiability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Many-valued logic (03B50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerating fuzzy switching functions and free Kleene algebras
• Normal forms and free algebras for some extensions of MTL
• The complexity of propositional implication
• Bases for Boolean co-clones
• Metamathematics of fuzzy logic
• Closed systems of functions and predicates
• The Complexity of Generalized Satisfiability for Linear Temporal Logic
• Satisfiability problems for propositional calculi
• On the Structure of Polynomial Time Reducibility
• Identities in the lattices of closed classes
• Function Algebras on Finite Sets
• Generalized Modal Satisfiability
• Free L-algebras
• Lattices With Involution
• The complexity of theorem-proving procedures
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• A note on functions associated with Gödel formulas

This page was built for publication: Lewis dichotomies in many-valued logics