Publication:4450452
From MaRDI portal
zbMath1046.03010MaRDI QIDQ4450452
Stefano Aguzzoli, Daniele Mundici
Publication date: 15 February 2004
computational complexity; decision problem; Weierstrass approximation theorem; Łukasiewicz infinite-valued propositional logic
03B70: Logic in computer science
03D15: Complexity of computation (including implicit computational complexity)
03B50: Many-valued logic
Related Items
Unnamed Item, Łukasiewicz Games, Implicit Operations in MV-Algebras and the Connectives of Łukasiewicz Logic, Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability, On the complexity of validity degrees in Łukasiewicz logic, Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics, An efficient algorithm for representing piecewise linear functions into logic