In the paper we present completeness theorems for hybrid logics, discuss the problem of finite axiomatization and study term rewriting and unification for the variety of distributive lattices and the variety of groups of exponent 2.

Schrödinger logics are logical systems in which the principle of identity is not true in general. The intuitive motivation for these logics is both Erwin Schrödinger's thesis that identity lacks sense for elementary particles of modern physics, and the way which physicists deal with this concept; normally, they understand identity as meaning indistinguishability . Observing that these concepts are equivalent in classical logic and mathematics, which underly the usual physical theories, we present a higher-order logical system in which these concepts (...) are systematically separated. A 'classical' semantics for the system is presented and some philosophical related questions are mentioned. One of the main characteristics of our system is that Leibniz' Principle of the Identity of Indiscernibles cannot be derived. This fact is in accordance with some authors who maintain that quantum mechanics violates this principle. Furthermore, our system may be viewed as a way of making sense some of Schrödinger's logical intuitions about the nature of elementary particles. (shrink)

The use of circumscription for formalizing commonsense knowledge and reasoning requires that a circumscription policy be selected for each particular application: we should specify which predicates are circumscribed, which predicates and functions are allowed to vary, and what priorities between the circumscribed predicates are established. The circumscription policy is usually described either informally or using suitable metamathematical notation. In this paper we propose a simple and general formalism which permits describing circumscription policies by axioms, included in the knowledge base along (...) with the axioms describing the objects of reasoning. The new formalism is illustrated by recasting some of the familiar applications of circumscription in its terms. (shrink)

The main result of this paper belongs to the field of the comparative study of program verification methods as well as to the field called nonstandard logics of programs. We compare the program verifying powers of various well-known temporal logics of programs, one of which is the Intermittent Assertions Method, denoted as Bur. Bur is based on one of the simplest modal logics called S5 or sometime-logic. We will see that the minor change in this background modal logic increases the (...) program verifying power of Bur. The change can be described either technically as replacing the reflexive version of S5 with an irreflexive version, or intuitively as using the modality some-other-time instead of sometime. Some insights into the nature of computational induction and its variants are also obtained. (shrink)