Axiomatising first-order temporal logic: Until and since over linear time

We present an axiomatisation for the first-order temporal logic with connectives Until and Since over the class of all linear flows of time. Completeness of the axiom system is proved.We also add a few axioms to find a sound and complete axiomatisation for the first order temporal logic of Until and Since over rational numbers time.The author would like to thank Dov Gabbay and Ian Hodkinson for helpful discussions on this material. The work was supported by the U.K. Science and Engineering Research Council under the Metatem project (GR/F/28526).Presented by Dov Gabbay     

Reasoning about actions and obligations in first-order logic

We describe a new way in which theories about the deontic status of actions can be represented in terms of the standard two-sorted first-order extensional predicate calculus. Some of the resulting formal theories are easy to implement in Prolog; one prototype implementation—R. M. Lee's deontic expert shell DX—is briefly described.This research was partially supported by the Esprit III Basic Research Working Group No. 8319 ModelAge.     

Decidable Cases of First-order Temporal Logic with Functions

We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be decided with EXPSPACE-complete complexity. A single rigid function is sufficient to make the logic not recursively enumerable. However, the monadic monodic fragment with rigid functions, where no two distinct terms have variables bound by the same quantifier, is decidable and EXPSPACE-complete. Presented by Robert Goldblatt     

Modelling simultaneous games in dynamic logic

We make a proposal for formalizing simultaneous games at the abstraction level of player’s powers, combining ideas from dynamic logic of sequential games and concurrent dynamic logic. We prove completeness for a new system of ‘concurrent game logic’ CDGL with respect to finite non-determined games. We also show how this system raises new mathematical issues, and throws light on branching quantifiers and independence-friendly evaluation games for first-order logic.     

Elimination problems in logic: a brief history

A common aim of elimination problems for languages of logic is to express the entire content of a set of formulas of the language, or a certain part of it, in a way that is more elementary or more informative. We want to bring out that as the languages for logic grew in expressive power and, at the same time, our knowledge of their expressive limitations also grew, elimination problems in logic underwent some change. For languages other than that for monadic second-order logic, there remain important open problems.     

Products of Modal Logics. Part 3: Products of Modal and Temporal Logics

In this paper we improve the results of [2] by proving the product f.m.p. for the product of minimal n-modal and minimal n-temporal logic. For this case we modify the finite depth method introduced in [1]. The main result is applied to identify new fragments of classical first-order logic and of the equational theory of relation algebras, that are decidable and have the finite model property.     

Interactions between Knowledge,Action and Commitment within Agent Dynamic Logic

This paper considers a new class of agent dynamic logics which provide a formal means of specifying and reasoning about the agents activities and informational, motivational and practical aspects of the behaviour of the agents. We present a Hilbert-style deductive system for a basic agent dynamic logic and consider a number of extensions of this logic with axiom schemata formalising interactions between knowledge and commitment (expressing an agent s awareness of her commitments), and interactions between knowledge and actions (expressing no learning and persistence of knowledge after actions). The deductive systems are proved sound and complete with respect to a Kripke-style semantics. Each of the considered logics is shown to have the small model property and therefore decidable.Presented by Ewa Orlowska     

The road to two theorems of logic

Work on how to axiomatize the subtheories of a first-order theory in which only a proper subset of their extra-logical vocabulary is being used led to a theorem on recursive axiomatizability and to an interpolation theorem for first-order logic. There were some fortuitous events and several logicians played a helpful role.     

An intensional epistemic logic

One of the fundamental properties inclassical equational reasoning isLeibniz's principle of substitution. Unfortunately, this propertydoes not hold instandard epistemic logic. Furthermore,Herbrand's lifting theorem which isessential to thecompleteness ofresolution andParamodulation in theclassical first order logic (FOL), turns out to be invalid in standard epistemic logic. In particular, unlike classical logic, there is no skolemization normal form for standard epistemic logic. To solve these problems, we introduce anintensional epistemic logic, based on avariation of Kripke's possible-worlds semantics that need not have a constant domain. We show how a weaker notion of substitution through indexed terms can retain the Herbrand theorem. We prove how the logic can yield a satisfibility preserving skolemization form. In particular, we present an intensional principle for unifing indexed terms. Finally, we describe asound andcomplete inference system for a Horn subset of the logic withequality, based onepistemic SLD-resolution.     

Axiomatizing Relativistic Dynamics without Conservation Postulates

A part of relativistic dynamics is axiomatized by simple and purely geometrical axioms formulated within first-order logic. A geometrical proof of the formula connecting relativistic and rest masses of bodies is presented, leading up to a geometric explanation of Einstein’s famous E = mc ². The connection of our geometrical axioms and the usual axioms on the conservation of mass, momentum and four-momentum is also investigated.     

Vladimir Alexandrovich Smirnov as a Founder of Research Schools in Logic and Methodology of Science in the USSR and Russia

The article gives a short account of V.A. Smirnovs scientific biography, including his work in Tomsk University in Siberia and in the Department of Logic of the Institute of Philosophy in Moscow.