Bulletin of Irkutsk State University. Series Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Bulletin of Irkutsk State University. Series Mathematics:
Year:
Volume:
Issue:
Page:
Find







Bulletin of Irkutsk State University. Series Mathematics, 2020, Volume 33, Pages 80–95
DOI: https://doi.org/10.26516/1997-7670.2020.33.80
(Mi iigum429)
 

This article is cited in 2 scientific papers (total in 2 papers)

Algebraic and logical methods in computer science and artificial intelligence

Hierarchy of families of theories and their rank characteristics

S. V. Sudoplatovabc

a Novosibirsk State Technical University, Novosibirsk, Russian Federation
b Sobolev Institute of Mathematics, Novosibirsk, Russian Federation
c Novosibirsk State University, Novosibirsk, Russian Federation
Full-text PDF (779 kB) Citations (2)
References:
Abstract: Studying families of elementary theories produces an information on behavior and interactions of theories inside families, possibilities of generations and their complexity. The complexity is expressed by rank characteristics both for families and their elements inside families.
We introduce and describe a hierarchy of families of theories and their rank characteristics including dynamics of ranks. We consider regular families which based on a family of urelements — theories in a given language, and on a step-by-step process producing the required hierarchy. An ordinal-valued set-theoretic rank is used to reflect steps of this process. We introduce the rank RS and related ranks for regular families, with respect to sentence-definable subfamilies and generalizing the known RS-rank for families of urelements, as well as their degrees. Links and dynamics for these ranks and degrees are described on a base of separability of sets of urelements. Graphs and families of neighbourhoods witnessing ranks are introduced and characterized. It is shown that decompositions of families of neighbourhoods and their rank links, for discrete partitions, produce the additivity and the possibility to reduce complexity measures for families into simpler subfamilies.
Keywords: family of theories, closure, urelement, hierarchy, rank, decomposition.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation 0314-2019-0002
Ministry of Education and Science of the Republic of Kazakhstan AP05132546
The study was carried out within the framework of the state contract of the Sobolev Institute of Mathematics (project No. 0314-2019-0002), and Committee of Science in Education and Science Ministry of the Republic of Kazakhstan (Grant No. AP05132546).
Received: 08.07.2020
Bibliographic databases:
Document Type: Article
UDC: 510.67
MSC: 03C30, 03C15, 03C50
Language: English
Citation: S. V. Sudoplatov, “Hierarchy of families of theories and their rank characteristics”, Bulletin of Irkutsk State University. Series Mathematics, 33 (2020), 80–95
Citation in format AMSBIB
\Bibitem{Sud20}
\by S.~V.~Sudoplatov
\paper Hierarchy of families of theories and their rank characteristics
\jour Bulletin of Irkutsk State University. Series Mathematics
\yr 2020
\vol 33
\pages 80--95
\mathnet{http://mi.mathnet.ru/iigum429}
\crossref{https://doi.org/10.26516/1997-7670.2020.33.80}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000569137500006}
Linking options:
  • https://www.mathnet.ru/eng/iigum429
  • https://www.mathnet.ru/eng/iigum/v33/p80
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:319
    Full-text PDF :190
    References:63
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025