Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika
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


Izv. Vyssh. Uchebn. Zaved. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2022, Number 10, Pages 22–32
DOI: https://doi.org/10.26907/0021-3446-2022-10-22-32 (Mi ivm9817) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Computability and universal determinability of negatively representative models

R. N. Dadazhanov

National University of Uzbekistan, 4 University str., Tashkent, 100174 Republic of Uzbekistan
Full-text PDF (364 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.26907/0021-3446-2022-10-22-32
Abstract: It has been established that a negative representable model is computable if and only if its standard enrichment with constants is isomorphically embedded in any model of a suitable computable enumerated set of universal sentences implemented in this model. It is shown that for computable enumerable sets of existential sentences this statement is incorrect.
Keywords: computable, negative and positive representations of models, standard enrichment, negative and positive diagram, universal and existential determinability.
Received: 26.12.2021
Revised: 26.12.2021
Accepted: 28.09.2022
English version:
Russian Mathematics (Izvestiya VUZ. Matematika), 2022, Volume 66, Issue 10, Pages 16–24
DOI: https://doi.org/10.3103/S1066369X22100036
Document Type: Article
UDC: 510.5
Language: Russian
Citation: R. N. Dadazhanov, “Computability and universal determinability of negatively representative models”, Izv. Vyssh. Uchebn. Zaved. Mat., 2022, no. 10, 22–32; Russian Math. (Iz. VUZ), 66:10 (2022), 16–24
Citation in format AMSBIB
\Bibitem{Dad22}
\by R.~N.~Dadazhanov
\paper Computability and universal determinability of negatively representative models
\jour Izv. Vyssh. Uchebn. Zaved. Mat.
\yr 2022
\issue 10
\pages 22--32
\mathnet{http://mi.mathnet.ru/ivm9817}
\crossref{https://doi.org/10.26907/0021-3446-2022-10-22-32}
\transl
\jour Russian Math. (Iz. VUZ)
\yr 2022
\vol 66
\issue 10
\pages 16--24
\crossref{https://doi.org/10.3103/S1066369X22100036}
Linking options:
  • https://www.mathnet.ru/eng/ivm9817
  • https://www.mathnet.ru/eng/ivm/y2022/i10/p22
    • 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
    		Известия высших учебных заведений. Математика Russian Mathematics (Izvestiya VUZ. Matematika)
    Statistics & downloads:
    Abstract page:94
    Full-text PDF :27
    References:18
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024