Arithmetical complexity of fuzzy predicate logics – a survey
✍ Scribed by P. Hájek
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 158 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1432-7643
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
It is proved in this paper that the predicate logic of each complete constructive arithmetic theory T having the existential property is T 1 -complete. In this connection, the techniques of a uniform partial truth deÿnition for intuitionistic arithmetic theories is used. The main theorem is applied
Fuzzy predicate calculi are powerful tools in analyzing topics of Zadeh's agenda, such as fuzzy modus ponens, compositional rule of inference, fuzzy functions and fuzzy control, etc. So far, however, predicate logics which are complete with respect to the semantics over [0; 1] are rather scarce. In