Two variants of monadic fuzzy predicate logic are analyzed and compared with the full fuzzy predicate logic with respect to nite model property (properties) and arithmetical complexity of sets of tautologies, satis-able formulas and of analogous notion restricted to nite models.

Our work is a contribution to the model-theoretic study of equality-free fuzzy predicate logics. We give a characterization of elementary equivalence in fuzzy predicate logics using elementary extensions and introduce an strengthening of this notion, the so-called strong elementary equivalence. Using the method of diagrams developed in [5] and elementary extensions we present a counterexample t...

A lattice theoretic framework for the calculus of program reenement is presented. Speciications and program statements are combined into a single (innnitary) language of commands which permits miraculous, angelic and demonic statements to be used in the description of program behavior. The weakest precondition calculus is extended to cover this larger class of statements and a game-theoretic in...

ion Allows a Clean Proof Markus Müller-Olm and Andreas Wolf 2 ? 1 Universität Dortmund, Fachbereich Informatik, LS V, 44221 Dortmund, Germany [email protected] 2 Christian-Albrechts-Universität, Institut für Informatik und Praktische Mathematik, Olshausenstraße 40, 24098 Kiel, Germany [email protected] Abstract. We prove the correctness of the translation of a prototypic While...

Dagger compact closed categories were recently introduced by Abramsky and Coecke, under the name “strongly compact closed categories”, as an axiomatic framework for quantum mechanics. We present a graphical language for dagger compact closed categories, and sketch a proof of its completeness for equational reasoning. We give a general construction, the CPM construction, which associates to each...

The aim of algebraic logic is to compact series of small steps of general logical inference into larger (in)equational steps. Algebraic structures that have proved very useful in this context are modal semirings and modal Kleene algebras. We show that they can also model knowledge and belief logics as well as games without additional effort; many of the standard logical properties are theorems ...

A systematic study of the optional maintenance strategies of the Transformer is conducted and a set of general factors which should be considered in the maintenance strategies is established. A Fuzzy Analytic Hierarchy Process (FAHP) based on the goal programming is proposed in view of the defects of the traditional Fuzzy Analytic Hierarchy Process (FAHP), and the specific application process o...

One of the problems in fault diagnosis of transformer based on dissolved gas, is lack of matching the result of fault diagnosis of different standards with the real world. In this paper, the result of the different standards is analyzed using fuzzy and the result is compared with the empirical test. The comparison between the suggested method and existing methods indicate the capability of the ...

We consider two applications of a simulation method in a predicate transformer setting: data reenement of sequential programs and implementation (trace inclusion) of processes. We identify two important special cases of the method: forward and backward simulation, and we investigate the soundness and completeness properties of these methods.

The standard Galois connection between the relational and predicate-transformer models of sequential programming (defined in terms of weakest precondition) confers a certain similarity between them. This paper investigates the extent to which the important involution on transformers (which, for instance, interchanges demonic and angelic nondeterminism, and reduces the two kinds of simulation in...