scientific article; zbMATH DE number 2042622
From MaRDI portal
Publication:4450452
zbMath1046.03010MaRDI QIDQ4450452
Stefano Aguzzoli, Daniele Mundici
Publication date: 15 February 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitydecision problemWeierstrass approximation theoremŁukasiewicz infinite-valued propositional logic
Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Many-valued logic (03B50)
Related Items (7)
Łukasiewicz Games ⋮ Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability ⋮ Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics ⋮ An efficient algorithm for representing piecewise linear functions into logic ⋮ Implicit Operations in MV-Algebras and the Connectives of Łukasiewicz Logic ⋮ Unnamed Item ⋮ On the complexity of validity degrees in Łukasiewicz logic
This page was built for publication:
