The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in  can be obtained by composing two closure operators and that the resulting operator is still a closure
We establish the pumping lemma in automata theory based on quantum logic under certain conditions on implication, and discuss the recognizability by the product and union of orthomodular lattice-valued (quantum) automata. In particular, we show that the
We present a basic Framework of automats theory based on quantum logic. In particular, we introduce the orthomodular lattice-valued (quantum) predicate of recognizability and establish some of its fundamental properties.
We give two generalizations of Tarski's fixpoint theorem in the setting of residuated lattices and use them to establish van Emdem-Kowalski's least fixpoint semantics for residuated lattice-valued logic programs.
We introduce a new definition of weak confluences and show that they are equivalent to tau-inertness without any appealing to tau-well-foundedness. (C) 2000 Elsevier Science B.V. All rights reserved.
Drummond, PD, Kheruntsyan, K, Bremner, M & Myers, C 2000, 'Quantum and classical solitons with a two-component Bose gas', IQEC, International Quantum Electronics Conference Proceedings.
The superchemistry dynamics in a magnetic trap were dynamics, in which atoms coherently convert to molecules with a Bose-enhanced rate given by nonlinear equations that are similar to the equations of nonlinear optics. The superchemistry limit typically involves magnetic traps that are not spherically symmetric. The first fully three-dimensional lattice calculations of the coherent atom-molecule oscillations in this case is shown that different trapping frequencies do not destroy the coherent oscillations.
Ying, M & Wirsing, M 2000, 'Approximate bisimilarity', Algebraic Methodology and Software Technology, Algebraic Methodology and Software Technology, Springer-Verlag Berlin, Iowa City, Iowa, pp. 309-322.
We introduce a notion of approximate bisimilarity in order to be able to reason about the approximate equivalence of processes. Approximate bisimilarity is based on the notion of bisimulation index for labelled transition systems. We establish some basic properties of bisimulation indexes and give a Hennessy-Milner logical characterization of approximate bisimilarity. As an application we show how to describe approximate correctness of real time systems by giving an example in real time ACP.