RUS  ENG
Full version
JOURNALS // Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics] // Archive

Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2012, Issue 4, Pages 71–80 (Mi vtpmk235)

This article is cited in 4 papers

Theoretical Foundations of Computer Science

On safety of recursive queries

S. M. Dudakov

Tver State University, Tver

Abstract: We investigate a totality of recursive queries on infinite universes. A recursive query model, which is considered, is inflationary fix point $IFP$. Properties of $IFP$-operator are investigated. We prove that models of countable categorical theories are safe.

Keywords: inflationary fix point, countable categoricity.

UDC: 510.675

Received: 13.12.2012
Revised: 15.12.2012



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024