Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.]:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics], 2012, Issue 4, Pages 71–80 (Mi vtpmk235)  
This article is cited in 4 scientific papers (total in 4 papers)

Theoretical Foundations of Computer Science

On safety of recursive queries

S. M. Dudakov

Tver State University, Tver
Citations (4)
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.
Funding agency Grant number
Russian Foundation for Basic Research 10-01-00532-a
Received: 13.12.2012
Revised: 15.12.2012
Bibliographic databases:
Document Type: Article
UDC: 510.675
Language: Russian
Linking options:
  • https://www.mathnet.ru/eng/vtpmk235
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics]
    Statistics & downloads:
    Abstract page:59
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024