Formal treatments of epistemology and epistemological issues have come a great way in recent years. Valuable results have been produced by Bayesians, in formal learning theory (also known as computational epistemology in [Kelly 96] and epistemic logic. While the first to formal approaches concentrate on learning and knowledge acquisition issues, the latter concentrate on axiomatics and validity...

Abstract. The modal interpretation of quantum mechanics allows one to keep the standard classical definition of realism intact. That is, variables have a definite status for all time and a measurement only tells us which value it had. However, at present modal dynamics are only applicable to situations that are described in the orthodox theory by projective measures. In this paper we extend mod...

Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and infinite iteration. We show that these independently introduced kinds of algebras can actually be defined in terms of each other. By defining modal operators on the underlying weak semiring, that result directly gives a demonic refinement algebra of commands. This yields models in which extensio...

In this paper, we analyse a concept of total knowledge based on the idea that an agent’s total knowledge is the strongest proposition the agent knows. We propose semantics for propositional and first-order languages with a modal operator TK representing total knowledge, and establish a result showing that total knowledge is ‘epistemically categorical’, in the sense that it determines the agent’...

In the present paper a generalization of the operator Fα,β de ned by Atanassov in [1] is considered. This operator is de ned over the class of p-intuitionistic fuzzy sets. Its properties are studied and a Theorem analogous to the results obtained in [4] is proved.

We associate a modal operator with each language belonging to a given class of regular languages and use the (reverse) wreath product of monoids with distinguished generators to characterize the expressive power of the resulting logic.

There is a lot of research on formalization of intention. The common idea of these theories is to interprete intention as an unary modal operator in Kripkean semantics. These theories suffer from the side-effect problem seriously. We introduce an alternative approach by establishing a nonclassical logic of intention. This logic is based on a novel non-Kripkean semantics which embodies some cogn...

In this paper we analyse some logical notions relevant for representing the dynamics of institutionalised organisations. In particular, some well-known action concepts introduced in the Kanger-Lindahl-Pörn logical theory of agency are discussed and integrated. Secondly, moving from the work of Jones and Sergot, a logical characterisation is provided of the ideas of institutional links, “counts-...

A multi-modal teaching-advisory system for sensor-based robot systems is presented that uses complementary information obtained from the operator and sensors. W e propose a new framework for on-site robot teaching systems that takes account of the characteristics of humans and sensors. This framework enables the teaching system to integrate a variety of robot task constraints, task specificatio...

In this paper we present several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Gödel logic formulas. Based on different characterizations of necessity measures on fuzzy sets, a group of logics with Kripke style semantics are built over a restricted language, namely a two level language composed of non-modal and modal formulas, the latter ...