Automated theorem proving for Łukasiewicz logics

DOI10.1007/BF01058388zbMath0801.03008OpenAlexW2942814310MaRDI QIDQ687151

Gordon S. Beavers

Publication date: 4 January 1994

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

Full work available at URL: https://doi.org/10.1007/bf01058388

zbMATH Keywords

algorithmcomputational complexitytheorem provingdecision procedures\(\aleph_ 0\)-valued Łukasiewicz logiclinear programming applicationstheoremhood

Mathematics Subject Classification ID

Cites Work

• Satisfiability in many-valued sentential logic is NP-complete
• Fragments of Many-Valued Statement Calculi
• A theorem about infinite-valued sentential logic

This page was built for publication: Automated theorem proving for Łukasiewicz logics