𝔖 Bobbio Scriptorium
✦   LIBER   ✦

First-order logic — The unity of fuzziness and randomness

✍ Scribed by Zhang Zhen; YunJuan Cao

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
666 KB
Volume
93
Category
Article
ISSN
0165-0114

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fuzzy unification and first order probab
Fuzzy unification and first order probabilistic logic
✍ Marco Piastra 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB

The notion of unification for fuzzy sets in fuzzy logic programming is explored in this article from the standpoint of a theoretical framework based on first-order probabilistic modal logic. The fundamental difference between the latter perspective and other approaches described in the literature li

Uncertain fuzzy values still in the fram
Uncertain fuzzy values still in the framework of first-order logic
✍ O. Pons; J. C. Cubero; A. Gonzalez; M. A. Vila 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB 👁 2 views

In this article, we first summarize the more important aspects of a fuzzy logic relational database and show how a fuzzy relational database can be represented and handled using first-order logic. Given that the results obtained for fuzzy databases are satisfactory, we then tackle the problem of unc

Axiomatizing the monodic fragment of fir
Axiomatizing the monodic fragment of first-order temporal logic
✍ Frank Wolter; Michael Zakharyaschev 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 141 KB

It is known that even seemingly small fragments of the ÿrst-order temporal logic over the natural numbers are not recursively enumerable. In this paper we show that the monodic (not monadic, where this result does not hold) fragment is an exception by constructing its ÿnite Hilbert-style axiomatizat

Recursive complexity of the Carnap first
Recursive complexity of the Carnap first order modal logic C
✍ Amélie Gheerbrant; Marcin Mostowski 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

We consider first order modal logic C firstly defined by Carnap in "Meaning and Necessity" [1]. We prove elimination of nested modalities for this logic, which gives additionally the Skolem-Löwenheim theorem for C. We also evaluate the degree of unsolvability for C, by showing that it is exactly 0 .