The prospects for mathematical logic in the twenty-first century

The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.Comment: Association for Symbolic Logi

Towards "dynamic domains": totally continuous cocomplete Q-categories

It is common practice in both theoretical computer science and theoretical physics to describe the (static) logic of a system by means of a complete lattice. When formalizing the dynamics of such a system, the updates of that system organize themselves quite naturally in a quantale, or more generally, a quantaloid. In fact, we are lead to consider cocomplete quantaloid-enriched categories as fundamental mathematical structure for a dynamic logic common to both computer science and physics. Here we explain the theory of totally continuous cocomplete categories as generalization of the well-known theory of totally continuous suplattices. That is to say, we undertake some first steps towards a theory of "dynamic domains''.Comment: 29 pages; contains a more elaborate introduction, corrects some typos, and has a sexier title than the previously posted version, but the mathematics are essentially the sam

Организация учебного процесса по дискретной математике и математической логике

In this paper we consider the method of teaching discrete mathematics and mathematical logic for future bachelors of "Mathematics and Computer Science".Рассматривается методика обучения дискретной математике и математической логике будущих бакалавров по направлению подготовки «Математика и компьютерные науки»

On Pebble Automata for Data Languages with Decidable Emptiness Problem

In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we introduce the so-called top view weak PA. Roughly speaking, top view weak PA are weak PA where the equality test is performed only between the data values seen by the two most recently placed pebbles. The emptiness problem for this model is decidable. We also show that it is robust: alternating, nondeterministic and deterministic top view weak PA have the same recognition power. Moreover, this model is strong enough to accept all data languages expressible in Linear Temporal Logic with the future-time operators, augmented with one register freeze quantifier.Comment: An extended abstract of this work has been published in the proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS) 2009}, Springer, Lecture Notes in Computer Science 5734, pages 712-72