Weierstrass approximations by Łukasiewicz formulas with one quantified variable

Proceedings of The International Symposium on Multiple-Valued Logic

Volumn , Issue , 2001, Pages 361-366

  Aguzzoli, S ^a   Mundici, D ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; LOGIC DEVICES;

WEIESTRASS APPROXIMATIONS;

PIECEWISE LINEAR TECHNIQUES;

EID: 0034835380     PISSN: 0195623X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. An algorithmic desingularization of 3-dimensional toric varieties
2. An algorithm for the automatic generation of a logical formula representing a control law
3. A new proof of the completeness of the Łukasiewicz axioms
4. Algebraic foundations of many-valued reasoning
5. The Ł∏ and Ł∏1/2 logics: Two complete fuzzy systems joining Łukasiewicz and product logic
6. Combinatorial convexity and algebraic geometry
7. Metamathematics of fuzzy logic
8. Triangular norms
9. A theorem about infinite-valued sentential logic
10. The equivalence problem for regular expressions with squaring requires exponential time
11. An algebraic approach to propositional fuzzy logic
12. Interpretation of AF C*-algebras in Łukasiewicz sentential calculus
13. Satisfiability in many-valued sentential logic is NP-complete
14. The logic of Ulam's game with lies
15. A constructive proof of McNaughton's theorem in infinite-valued logic
16. Łukasiewicz normal forms and toric desingularizations
17. Reasoning on imprecisely defined functions
18. Ulam game, the logic of Maxsat, and many-valued partitions
19. On fuzzy logic I,II,III
20. Fragments of many-valued statement calculi
21. Fuzzy control and conventional control: What is (and can be) the real contribution of fuzzy systems?