An asymptotically tight bound on countermodels for Łukasiewicz logic

DOI10.1016/j.ijar.2006.02.003zbMath1107.03021OpenAlexW1993580992MaRDI QIDQ2506811

Stefano Aguzzoli

Publication date: 10 October 2006

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2006.02.003

zbMATH Keywords

many-valued logicinfinite-valued Łukasiewicz logic

Mathematics Subject Classification ID

MV-algebras (06D35) Many-valued logic (03B50)

Related Items (4)

Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction ⋮ Rational Pavelka logic: the best among three worlds? ⋮ On the complexity of validity degrees in Łukasiewicz logic ⋮ Poset products as relational models

Cites Work

• Unnamed Item
• Unnamed Item
• Satisfiability in many-valued sentential logic is NP-complete
• Metamathematics of fuzzy logic
• Finite-valued reductions of infinite-valued logics
• Algebraic foundations of many-valued reasoning
• Finiteness in infinite-valued Łukasiewicz logic
• Algebraic Analysis of Many Valued Logics
• A constructive proof of McNaughton's theorem in infinite-valued logic
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• A theorem about infinite-valued sentential logic

This page was built for publication: An asymptotically tight bound on countermodels for Łukasiewicz logic