|
Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics], 2013, Issue 2, Pages 5–13
(Mi vtpmk127)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Theoretical Foundations of Computer Science
On Safety Of IFP-Operators And Recursive Queries
S. M. Dudakov Tver State University
Abstract:
We continue to investigate a totality of recursive queries on infinite universes. Early we have proved that models of countable categorical theories are safe. In this paper we have proposed an example of theory which is safe but is not countable categorical. Also we propose a necessary and sufficient condition for safety.
Keywords:
Inflationary fix point, finite axiomatizability.
Received: 23.04.2013 Revised: 15.05.2013
Linking options:
https://www.mathnet.ru/eng/vtpmk127
|
Statistics & downloads: |
Abstract page: | 92 |
|