Cargando…
On the Complexity of Validity Degrees in Łukasiewicz Logic
Łukasiewicz logic is an established formal system of many-valued logic. Decision problems in both propositional and first-order case have been classified as to their computational complexity or degrees of undecidability; for the propositional fragment, theoremhood and provability from finite theorie...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7309509/ http://dx.doi.org/10.1007/978-3-030-51466-2_15 |